图象匹配时矩的高效算法

被引:3
作者
刘永红
机构
[1] 大连理工大学电子工程系
关键词
图象匹配; 矩; 不变矩; 快速算法;
D O I
暂无
中图分类号
TP391.4 [模式识别与装置];
学科分类号
0811 ; 081101 ; 081104 ; 1405 ;
摘要
用不变矩作为相似度度量进行图象匹配,可减少图象平移、旋转以及比例缩放对匹配性能的影响。但不变矩的计算量大,使匹配速度变慢。本文根据图象匹配的特点,提出了一种适用于图象匹配时的矩的增量算法—IACM算法。用此算法可大大提高用不变矩进行图象匹配的速度。
引用
收藏
页码:356 / 361
页数:6
相关论文
共 8 条
  • [1] Fast algorithm for the computation of moment invariants. Zakaria M F,et al. Pattern Recognition . 1987
  • [2] Simple and fast computation of moments. Jiang X Y,Bunke H. Pattern Recognition . 1991
  • [3] Scene matching with invariant moments. Wong R Y. Computer Graphics . 1978
  • [4] An efficient algorithm for computation of shap moments fromrun—length codes or chain codes. Dai M,Baylou P,Najim M. Pattern Recognition . 1992
  • [5] Efficient parallel algorithms for the computation of two-dimentsional image moments. Chen K. Pattern Recognition .
  • [6] Fast computation of moment invariants. Li B C,Shen J. Pattern Recognition . 1991
  • [7] Calculation of moment invariants viaHadamard transform. Fu Chang-wu,Yen jui-cheng,Chang Shyang. Pattern Recognition . 1993
  • [8] Pattern recognition by moment invariants. Hu M.K. Proceedings of the Institute of Radio Engineers . 1961