Some computational aspects of discrete orthonormal moments

被引：153
|
作者：
Mukundan, R [1 ]
机构：
[1] Univ Canterbury, Dept Comp Sci, Christchurch 1, New Zealand
来源：
IEEE TRANSACTIONS ON IMAGE PROCESSING | 2004年 / 13卷 / 08期
关键词：
discrete orthogonal polynomials; image reconstruction; orthonormal moments; Tchebichef moments;
D O I：
10.1109/TIP.2004.828430
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：1055 / 1059
页数：5
相关论文
共 50 条
12345