Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19962
Title: On the efficient computation of 2-D image moments using the discrete radon transform
Authors: Shen, TW
Lun, DPK 
Siu, WC 
Keywords: Discrete radon transform
Fast algorithm
Moment invariants
Moments
Pattern recognition
Issue Date: 1998
Source: Pattern recognition, 1998, v. 31, no. 2, p. 115-120 How to cite?
Journal: Pattern Recognition 
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.
URI: http://hdl.handle.net/10397/19962
ISSN: 0031-3203
DOI: 10.1016/S0031-3203(97)00035-6
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Mar 29, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
0
Citations as of Mar 23, 2017

Page view(s)

20
Last Week
3
Last month
Checked on Mar 26, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.