On the efficient computation of 2-d image moments using the discrete radon transform

作者:

Highlights:

摘要

In this paper, a fast algorithm for the computation of two-dimensional image moments is proposed. In our approach, a new discrete Radon transform (DRT) is used for the major part of the algorithm. The new DRT preserves an important property of the continuous Radon transform that the regular or geometric moments can be directly obtained from the projection data. With this property, the computation of two-dimensional (2-D) image moments can be decomposed to become a number of one-dimensional (1-D) ones, hence it reduces greatly the computational complexity. The new DRT algorithm can be applied with a recursive approach such that the number of multiplication required is further reduced. However, the number of addition will then be increased. It suits to the situation where the effort for realizing multiplication is much greater than addition. Comparisons of the present approaches with some known methods show that the proposed algorithms significantly reduce the complexity and computation time.

论文关键词:Pattern recognition,Moments,Moment invariants,Fast algorithm,Discrete Radon transform

论文评审过程:Received 13 February 1996, Revised 24 October 1996, Available online 7 June 2001.

论文官网地址:https://doi.org/10.1016/S0031-3203(97)00035-6