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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A fast recursive algorithm for the computation of axial moments


    Beteiligte:
    Palenichka, R.M. (Autor:in) / Zaremba, M.B. (Autor:in) / Valenti, C. (Autor:in)


    Erscheinungsdatum :

    01.01.2001


    Format / Umfang :

    677664 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    A Fast Recursive Algorithm for the Computation of Axial Moments

    Palenichka, R. / Zaremba, M. / Valenti, C. et al. | British Library Conference Proceedings | 2001


    Fast Recursive Computation of 1D and 2D Finite Convolutions

    Chernov, A. V. | British Library Online Contents | 2005


    Algorithms for fast computation of Zernike moments and their numerical stability

    Singh, C. / Walia, E. | British Library Online Contents | 2011