[1]张辉,周健,C. Toumoulin,等.Tchebichef矩的快速算法[J].东南大学学报(自然科学版),2006,36(5):857-862.[doi:10.3969/j.issn.1001-0505.2006.05.035]
 Zhang Hui,Zhou Jian,C. Toumoulin,et al.Fast computation of Tchebichef moments[J].Journal of Southeast University (Natural Science Edition),2006,36(5):857-862.[doi:10.3969/j.issn.1001-0505.2006.05.035]
点击复制

Tchebichef矩的快速算法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
36
期数:
2006年第5期
页码:
857-862
栏目:
计算机科学与工程
出版日期:
2006-09-20

文章信息/Info

Title:
Fast computation of Tchebichef moments
作者:
张辉1 周健13 C. Toumoulin23 舒华忠13
1 东南大学计算机科学与工程学院, 南京 210096; 2 雷恩一大信号与图像处理实验室, 雷恩 35042; 3 东南大学中法生物医学信息研究中心, 南京 210096
Author(s):
Zhang Hui1 Zhou Jian13 C. Toumoulin23 Shu Huazhong13
1 School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
2 Laboratoire Traitement du Signal et de l’Image, Université de Rennes Ⅰ, 35042 Rennes, France
3 French-Chinese Biomedical Information Research Center, Southeast University, Nanjing 210096,China
关键词:
Tchebichef正交矩 快速算法 图像块描述方法
Keywords:
Tchebichef moment fast algorithm image block representation
分类号:
TP391
DOI:
10.3969/j.issn.1001-0505.2006.05.035
摘要:
为了更有效将Tchebichef矩应用于模式识别和图像分析等领域,提出一种关于Tchebichef矩的快速有效算法.对二值图像采用图像块描述方法,并在推导了Tchebichef多项式一些性质的基础上,实现了一种快速计算Tchebichef矩的新方法.实验结果表明,该方法能够有效地节省计算时间,尤其在图像尺寸较大,以及所使用矩的阶数较高的情况下,该算法的效果更为明显.
Abstract:
To expand the application of the Tchebichef moments in the fields of pattern recognition and image analysis, a novel algorithm for fast computation of Tchebichef moments is presented. By using the image block representation to describe a binary image, and by establishing some useful properties of Tchebichef polynomials, an efficient method is proposed for computation of Tchebichef moments. Experimental results show that this method can save much CPU(central processing unit)time in the calculation of moments, especially in the case where the image size is large and the high order of moments is used.

参考文献/References:

[1] Hu M K.Visual problem recognition by moment invariant [J].IRE Trans Inform Theory,1962,8(2):179-187.
[2] Prokop R J,Reeves A P.A survey of moment-based techniques for unoccluded object representation and recognition [J]. Graphical Models Image Process,1992,54(5):438-460.
[3] Haddadnia J,Faez K,Moallem P.Neural network based face recognition with moment invariants [C] //Proceedings of International Conference on Image Processing.Thessaloniki,Greece,2001,1:1018-1021.
[4] Shu Huazhong,Luo Limin,Bao Xudeng,et al.An efficient method for computation of Legendre moments [J]. Graphical Models,2000,62(4):237-262.
[5] Shu Huazhong,Luo Limin,Yu Wenxue,et al.A new fast method for computing Legendre moments[J]. Pattern Recognition,2000,33(2):341-348.
[6] Zhou Jindan,Shu Huazhong.Two new algorithms for efficient computation of Legendre moments [J]. Pattern Recognition,2002,35(5):1143-1152.
[7] Chong Chee Way,Raveendran P,Mukundan R.A comparative analysis of algorithms for fast computation of Zernike moments [J]. Pattern Recognition,2003,36(3):731-742.
[8] Mukundan R,Ramakrishnan K R.Fast computation of Legendre and Zernike moments [J]. Pattern Recognition,1995,28(9):1433-1442.
[9] Gu Jia,Shu Huazhong,Toumoulin C,et al.A novel algorithm for fast computation of Zernike moments [J].Pattern Recognition,2002,35(12):2905-2911.
[10] Mukundan R,Ong S H,Lee P A.Image analysis by Tchebichef moments [J].IEEE Trans Image Processing,2001,10(9):1357-1364.
[11] Yap P T,Raveendran P,Ong S H.Image analysis by Krawtchouk moments [J].IEEE Trans Image Processing,2003,12(11):1367-1377.
[12] Qin Lei,Shu Huazhong,Jin Fenghua,et al.Two new algorithms for fast computation of Legendre moments [C] //SPIE:Visual Communications and Image Processing.Lugano,Switzerland,2003,5150:2114-2121.
[13] Spiliotis I M,Mertzios B G.Real-time computation of two-dimensional moments on binary images using image block representation [J]. IEEE Trans Image Processing,1998, 7(11):1609-1615.
[14] Comtet L.Advanced combinatorics:the art of finite and infinite expansions [M].Dordrecht,Holland:D.Reidel Publishing Company,1974:34-46.

相似文献/References:

[1]周茜,伍家松,董志芳,等.一种新的三维MDCT的快速算法[J].东南大学学报(自然科学版),2010,40(1):75.[doi:10.3969/j.issn.1001-0505.2010.01.014]
 Zhou Qian,Wu Jiasong,Dong Zhifang,et al.A fast algorithm for computation of 3-D MDCT[J].Journal of Southeast University (Natural Science Edition),2010,40(5):75.[doi:10.3969/j.issn.1001-0505.2010.01.014]
[2]陆建江,徐宝文,邹晓峰.模糊规则发现算法研究[J].东南大学学报(自然科学版),2003,33(3):271.[doi:10.3969/j.issn.1001-0505.2003.03.006]
 Lu Jianjiang,Xu Baowen,Zou Xiaofeng.Algorithms for discovering fuzzy rules[J].Journal of Southeast University (Natural Science Edition),2003,33(5):271.[doi:10.3969/j.issn.1001-0505.2003.03.006]
[3]赵正敏.相位截尾对DDS输出频谱影响的分析与计算[J].东南大学学报(自然科学版),2000,30(1):141.[doi:10.3969/j.issn.1001-0505.2000.01.028]
 Zhao Zhengmin.Analysis and Computation of Output Spectrum of DDS in Presence of Phase-Accumulator Truncation[J].Journal of Southeast University (Natural Science Edition),2000,30(5):141.[doi:10.3969/j.issn.1001-0505.2000.01.028]
[4]董志芳,伍家松,王膂,等.一种新的基于矩的改进离散余弦变换及其反变换快速算法[J].东南大学学报(自然科学版),2009,39(4):747.[doi:10.3969/j.issn.1001-0505.2009.04.019]
 Dong Zhifang,Wu Jiasong,Wang Lü,et al.Novel approach for fast computation of MDCT and IMDCT based on moments[J].Journal of Southeast University (Natural Science Edition),2009,39(5):747.[doi:10.3969/j.issn.1001-0505.2009.04.019]
[5]徐旦华,辜嘉,李松毅,等.Zernike矩的快速算法[J].东南大学学报(自然科学版),2002,32(2):189.[doi:10.3969/j.issn.1001-0505.2002.02.009]
 Xu Danhua,Gu Jia,Li Songyi,et al.Fast algorithm for computation of Zernike moments[J].Journal of Southeast University (Natural Science Edition),2002,32(5):189.[doi:10.3969/j.issn.1001-0505.2002.02.009]
[6]王元明.W矩阵与FFT[J].东南大学学报(自然科学版),1979,9(1):117.[doi:10.3969/j.issn.1001-0505.1979.01.009]
 Wang Yuan-Ming.Matrix w and FFT[J].Journal of Southeast University (Natural Science Edition),1979,9(5):117.[doi:10.3969/j.issn.1001-0505.1979.01.009]

备注/Memo

备注/Memo:
基金项目: 科学技术部基础研究重大资助项目(2003CB716102)、 国家自然科学基金资助项目(60272045)、教育部新世纪优秀人才支持计划资助项目(NCET-04-0477).
作者简介: 张辉(1981—),男,硕士生,jabpzh@hotmail.com; 舒华忠(联系人),男,博士,教授,博士生导师,shu.list@seu.edu.cn.
更新日期/Last Update: 2006-09-20