2021
DOI: 10.1007/s00521-021-05955-2
|View full text |Cite
|
Sign up to set email alerts
|

Image retrieval based on texture using latent space representation of discrete Fourier transformed maps

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 64 publications
0
4
0
Order By: Relevance
“…The statistical method mainly describes texture features by analyzing the grayscale distribution in images, like gray level co-occurrence matrix [7], scale-invariant feature transform (SIFT) [8], and local binary pattern (LBP) [9]. The frequency method converts the grayscale distribution in the spatial domain into the frequency distribution in the frequency domain to describe texture features, mainly including wavelet transform [10] and Fourier transform [11]. The model method uses a small number of parameters to establish a mathematical model to describe texture features, like Markov models [12], and fractal dimensions [13].…”
Section: Texture Featuresmentioning
confidence: 99%
See 1 more Smart Citation
“…The statistical method mainly describes texture features by analyzing the grayscale distribution in images, like gray level co-occurrence matrix [7], scale-invariant feature transform (SIFT) [8], and local binary pattern (LBP) [9]. The frequency method converts the grayscale distribution in the spatial domain into the frequency distribution in the frequency domain to describe texture features, mainly including wavelet transform [10] and Fourier transform [11]. The model method uses a small number of parameters to establish a mathematical model to describe texture features, like Markov models [12], and fractal dimensions [13].…”
Section: Texture Featuresmentioning
confidence: 99%
“…Then, a similarityweighted approach is used to fuse the texture features and color features. Assuming that ρ1, ρ2, and ρ3 represent the local texture feature, global texture feature, and color feature, respectively, the final similarity S can be defined by Equation (11).…”
Section: Similarity Measurementmentioning
confidence: 99%
“…Any periodic signal satisfying Dirichlet condition can be expressed as infinite series of complex harmonic signal; and for aperiodic signal x ( t ) , if it meets the requirements of energy limited signal and Dirichlet condition, it can be Fourier transformed. 22,23 This signal can be regarded as a linear combination of infinite sinusoidal functions with different frequencies and different initial phases; its amplitude is the value of the corresponding frequency | X ( j 2 π f ) | , and its phase is the value of the corresponding frequency φ ( 2 π f ) :…”
Section: Load Solving Theorymentioning
confidence: 99%
“…However, to evaluate the processing information, the relevant sensitive features of the surface need to be accurately identified and extracted. Saikia et al [16] introduce a method with image Fourier transform [17] for extracting characteristics of filter frequency changes during processing. Based on Empirical Modal Decomposition (EMD) [18,19], Sun Huibin et al [20] proposed a texture monitoring method, successfully extracting sensitive features from vibration signals on the basis of empirical model decomposition, and then establishing a mapping relationship from texture feature to texture image features and vibration signal feature.…”
Section: Introductionmentioning
confidence: 99%