Abstract
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. Published by Elsevier Science Ltd.
Original language | English |
---|---|
Pages (from-to) | 115-120 |
Number of pages | 6 |
Journal | Pattern Recognition |
Volume | 31 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Jan 1998 |
Keywords
- Discrete radon transform
- Fast algorithm
- Moment invariants
- Moments
- Pattern recognition
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence