Some Computational Aspects of Discrete Orthonormal Moments
Type of content
Journal Article
UC permalink
Publisher's DOI/URI
Thesis discipline
Degree name
Publisher
University of Canterbury. Computer Science and Software Engineering.
Journal Title
Journal ISSN
Volume Title
Language
Date
2004
Authors
Mukundan, R.
Abstract
Discrete orthogonal moments have several computational advantages over continuous moments. However when the moment order becomes large, discrete orthogonal moments (such as the Tchebichef moments) tend to exhibit numerical instabilities. This paper introduces the orthonormal version of Tchebichef moments, and analyses some of their computational aspects. The recursive procedure used for polynomial evaluation can be suitably modified to reduce the accumulation of numerical errors. The proposed set of moments can be used for representing image shape features and for reconstructing an image from its moments with a high degree of accuracy.
Description
Citation
Mukundan, R. (2004) Some Computational Aspects of Discrete Orthonormal Moments. IEEE Transactions on Image Processing, 13(8), pp. 1055-1059.
Keywords
Computer Vision, Discrete Orthogonal Polynomials, Image Reconstruction, Orthonormal Moments, Tchebichef Moments.
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Rights
©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.