0000000000628254
AUTHOR
Roman M. Palenichka
A fast recursive algorithm to compute local axial moments
The paper describes a fast algorithm to compute local axial moments used in the algorithm of discrete symmetry transform (DST). The basic idea is grounded on fast recursive implementation of respective linear filters by using the so-called primitive kernel functions since the moment computation can be performed in the framework of linear filtering. The main result is that the computation of the local axial moments is independent of the kernel size, i.e. of the order O(1) per data point (pixel). This result is of relevance whenever the DST is used to face with real time computer vision problems. The experimental results confirm the time complexity predicted by the theory.
A fast recursive algorithm for the computation of axial moments
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 b…