Related Experiment Video
Updated: Apr 23, 2026

13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
42.6K
Multifractal detrended moving average analysis for texture representation
Fang Wang1, Lin Wang2, Rui-Biao Zou1
1College of Science, Hunan Agricultural University, Changsha 410128, China.
Chaos (Woodbury, N.Y.)
|October 3, 2014
Summary
This study introduces a new method, Multifractal Detrended Moving Average analysis (MF-DMA), to analyze surface complexity. The MF-DMA-based local generalized Hurst exponent (LHq) proves superior to MF-DFA for texture analysis.
Area of Science:
- Complex systems analysis
- Image texture analysis
- Time series analysis
Background:
- Multifractal Detrended Moving Average analysis (MF-DMA) is a recent technique for analyzing time series.
- Detecting long-range correlations and multifractal properties in stationary and non-stationary data is crucial.
- Existing methods like Multifractal Detrended Fluctuation Analysis (MF-DFA) provide a basis for surface analysis.
Purpose of the Study:
- To propose a novel method for calculating local generalized Hurst exponents for image surfaces using MF-DMA.
- To evaluate the performance of this MF-DMA-based local generalized Hurst exponent (LHq) against MF-DFA.
- To determine the optimal parameters for the MF-DMA approach in texture characterization.
Main Methods:
- Developed the MF-DMA-based local generalized Hurst exponent (LHq) for pixel-wise surface analysis.
- Tested the method on synthetic multifractal surfaces and natural textures.
- Compared MF-DMA-based LHq with MF-DFA-based LHq across backward, centered, and forward analysis cases.
- Investigated the impact of different q values and sub-image sizes.
Main Results:
- The MF-DMA-based LHq demonstrated superior performance compared to MF-DFA-based LHq in segmentation experiments.
- The backward MF-DMA algorithm (θ=0) was found to be more computationally efficient than centered and forward algorithms.
- Local generalized Hurst exponents calculated with q<0 were more effective in characterizing natural texture image features than those with q>0 for both MF-DMA and MF-DFA.
Conclusions:
- The MF-DMA-based local generalized Hurst exponent is a powerful tool for analyzing surface complexity and texture.
- The backward MF-DMA approach offers an efficient and effective method for image analysis.
- Negative q-values provide superior characterization of image features in multifractal analysis.
Related Concept Videos
Discrete Fourier Transform
1.2K
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
1.2K
Convergence of Fourier Series
608
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
608
Discrete-time Fourier transform
1.5K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
1.5K
Continuous -time Fourier Transform
1.2K
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
1.2K
Fast Fourier Transform
1.3K
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.3K
Discrete-Time Fourier Series
954
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
954

