Related Experiment Video
Updated: Jul 7, 2026
13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Iterative methods for solving the Gabor expansion: considerations of convergence
1Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC.
Summary
This study reformulates J.G. Daugman's neural network for Gabor expansion as steepest descent. Nonlinear optimization improves convergence for image analysis and lattice structures.
Area of Science:
- Computer Vision
- Image Processing
- Machine Learning
Background:
- J.G. Daugman's (1988) work established a neural network approach for Gabor image expansion.
- Efficient computation of Gabor expansions is crucial for various image analysis tasks.
Purpose of the Study:
- To reformulate Daugman's neural network solution as a steepest descent method.
- To apply nonlinear optimization theory to enhance convergence speed and stability.
- To investigate the efficacy of quasi-Newton methods for specific lattice types.
Main Methods:
- Reformulation of the Gabor expansion as a steepest descent algorithm.
- Application of nonlinear optimization techniques to determine optimal convergence factors.
- Implementation and evaluation of two quasi-Newton-based methods.
Main Results:
- The Gabor expansion was successfully reformulated using steepest descent.
- Nonlinear optimization provided a method for selecting convergence factors.
- Quasi-Newton methods demonstrated improved convergence for certain lattice structures.
Conclusions:
- The steepest descent reformulation offers an alternative perspective on Daugman's method.
- Nonlinear optimization is a viable approach for tuning convergence parameters.
- Quasi-Newton methods show potential for accelerating Gabor expansion computations in specific scenarios.
Related Concept Videos
01:21Convergence of Fourier Series
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...
01:30Convergence of Taylor Series
The Taylor series provides a systematic method for approximating a smooth function by a polynomial that closely matches the function near a chosen point. This approach is particularly valuable in scientific and engineering contexts where functions may be difficult to evaluate directly, such as oscillatory voltages in alternating current (AC) circuits. Replacing complex functions with polynomial expressions simplifies computation while preserving essential local behavior. Taylor’s Theorem...
01:23Partial Sums and Series Convergence
An infinite series is formed by adding the terms of an infinite sequence. Although the addition continues without end, some infinite series approach a definite finite value. This idea is useful for modeling physical processes in which each successive action becomes smaller, such as the motion of a bouncing ball that rises to a fraction of its previous height after each bounce.Consider a ball dropped from a height of one meter. After the first drop, it rises to half of that height, or 0.5 meters.
01:20Region of Convergence of Laplace Tarnsform
The Region of Convergence (ROC) is a fundamental concept in signal processing and system analysis, particularly associated with the Laplace transform. The ROC represents an area in the complex plane where the Laplace transform of a given signal converges, determining the transform's applicability and utility.
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...
01:30Gaussian Elimination: Problem Solving
Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
01:20Inverse z-Transform by Partial Fraction Expansion
The inverse z-transform is a crucial technique for converting a function from its z-domain representation back to the time domain. One effective method for finding the inverse z-transform is the Partial Fraction Method, which involves decomposing a function into simpler fractions with distinct coefficients. These fractions correspond to known z-transform pairs, facilitating the inverse transformation process.
To begin the process, the poles of the function are identified and the function is...
To begin the process, the poles of the function are identified and the function is...