Marr and Hildreth's theory of LoG filtering with multiple scales has been extensively elaborated. One problem with LoG filtering is that it is very time-consuming, especially with a large size of filters. This paper presents a recursive convolution scheme for LoG filtering and a fast algorithm to extract zero-crossings. It has a constant computational complexity per pixel and is independent of the size of the filter. A line buffer is used to determine the locations of zero-crossings along with filtering hence avoiding the need for an additional convolution and extra memory units. Various images have been tested.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Fast LoG filtering using recursive filters


    Beteiligte:
    Yan Gao (Autor:in) / Jin, J.S. (Autor:in)


    Erscheinungsdatum :

    01.01.1995


    Format / Umfang :

    597905 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Fast LoG Filtering Using Recursive Filters

    Gao, Y. / Jin, J. S. / IEEE; Computer Society; Technical Committee for Pattern Analysis and Machine Intelligence | British Library Conference Proceedings | 1995


    Recursive Least-Squares Filtering

    Zarchan, Paul / Musoff, Howard | AIAA | 2015


    Recursive Least-Squares Filtering

    Musoff, Howard / Zarchan, Paul | AIAA | 2009


    Recursive Least-Squares Filtering

    Musoff, Howard / Zarchan, Paul | AIAA | 2005