6533b831fe1ef96bd1298f08
RESEARCH PRODUCT
A fast recursive algorithm for the computation of axial moments
Cesare ValentiRoman M. PalenichkaM.b. Zarembasubject
Mathematical optimizationSettore INF/01 - InformaticaComputational complexity theoryVelocity MomentsOrientation (computer vision)ComputationFeature extractionA fast recursive algorithm for the computation of axial momentsPoint (geometry)Time complexityAlgorithmObject detectionMathematicsdescription
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. © 2001 IEEE.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2002-11-13 | Proceedings 11th International Conference on Image Analysis and Processing |