Name
Abstract | ||
|---|---|---|
Orthogonal moments provide an efficient mathematical framework for computer vision, image analysis, and pattern recognition. They are derived from the polynomials that are relatively perpendicular to each other. Orthogonal moments are more efficient than non-orthogonal moments for image representation with minimum attribute redundancy, robustness to noise, invariance to rotation, translation, and scaling. Orthogonal moments can be both continuous and discrete. Prominent continuous moments are Zernike, Pseudo-Zernike, Legendre, and Gaussian-Hermite. This article provides a comprehensive and comparative review for continuous orthogonal moments along with their applications.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3331167 | ACM Computing Surveys |
Keywords | Field | DocType |
Bessel Fourier moments,Chebyshev Fourier moments,Gaussian-Hermite moments,Gegenbauer moments,Jacobi Fourier moments,Laguerre moments,Legendre moments,Orthogonal Fourier Mellin moments,Pseudo-Jacobi Fourier moments,Radial Harmonic Fourier moments,Zernike moments,continuous Hahn moments | Invariant (physics),Polynomial,Computer science,Image representation,Algorithm,Legendre polynomials,Zernike polynomials,Theoretical computer science,Robustness (computer science),Redundancy (engineering),Scaling | Journal |
Volume | Issue | ISSN |
52 | 4 | 0360-0300 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Parminder Kaur | 1 | 17 | 5.35 |
| Husanbir S. Pannu | 2 | 18 | 5.73 |
| Avleen Kaur Malhi | 3 | 3 | 1.75 |