A fast recursive algorithm for the computation of axial moments

Author

Palenichka, Roman M. ; Zaremba, Marek B. ; Valenti, Cesare

Author_Institution

Quebec Univ., Hull, Que., Canada

fYear

2001

Firstpage

95

Lastpage

100

Abstract

This paper describes a fast algorithm to compute local axial moments used for the detection of objects of interest in images. The basic idea is grounded on the elimination of redundant operations while computing axial moments for two neighboring angles of orientation. The main result is that the complexity of recursive computation of axial moments becomes independent of the total number of computed moments in a given point, i.e. it is of the order O(N) where N is the data size. This result is of great importance in computer vision since many feature extraction methods are based on the computation of axial moments. The experimental results confirm the time complexity and accuracy predicted by the theoretical analysis

Keywords

computational complexity; computer vision; feature extraction; object detection; recursive estimation; computer vision; feature extraction; local axial moments; object detection; orientation angles; recursive algorithm; redundant operation elimination; time complexity; Computational complexity; Computational efficiency; Computer vision; Feature extraction; Image analysis; Image segmentation; Object detection; Shape; Skeleton; Surface fitting;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Analysis and Processing, 2001. Proceedings. 11th International Conference on

Conference_Location

Palermo

Print_ISBN

0-7695-1183-X

Type

conf

DOI

10.1109/ICIAP.2001.956991

Filename

956991