Affiliation:
1. Thapar Institute of Engineering and Technology, Patiala, Punjab, India
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.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献