Some computational aspects of discrete orthonormal moments

Author

Mukundan, R.

Author_Institution

Dept. of Comput. Sci., Univ. of Canterbury, Christchurch, New Zealand

Volume

13

Issue

8

fYear

2004

Firstpage

1055

Lastpage

1059

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 analyzes 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.

Keywords

image reconstruction; image representation; polynomials; Tchebichef moments; computational aspects; discrete orthonormal moments; image reconstruction; image shape features representation; numerical errors; numerical instabilities; polynomial evaluation; recursive procedure; Application software; Chebyshev approximation; Computer applications; Computer errors; Computer vision; Finite wordlength effects; Image reconstruction; Pattern recognition; Polynomials; Shape; Algorithms; Image Enhancement; Image Interpretation, Computer-Assisted; Numerical Analysis, Computer-Assisted; Reproducibility of Results; Sensitivity and Specificity; Signal Processing, Computer-Assisted;

fLanguage

English

Journal_Title

Image Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7149

Type

jour

DOI

10.1109/TIP.2004.828430

Filename

1315694