The signed k-distance transformation (k-DT) computes the k nearest prototypes from each location on a discrete regular grid within a given D dimensional volume. We propose a new k-DT algorithm that divides the problem into D 1-dimensional problems and compare its accuracy and computational complexity to the existing raster-scanning and propagation approaches.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The Euclidean k-distance transformation in arbitrary dimensions: a separable implementation


    Beteiligte:
    Cuisenaire, O. (Autor:in)


    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    107419 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    The Euclidean K-Distance Transformation in arbitrary Dimensions: A Separable Implementation

    Cuisenaire, O. | British Library Conference Proceedings | 2005


    A Parallel Euclidean Distance Transformation Algorithm

    Embrechts, H. / Roose, D. | British Library Online Contents | 1996


    Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods

    Cuisenaire, O. / Macq, B. | British Library Online Contents | 1999


    Fast Euclidean distance transformation in two scans using a 3x3 neighborhood

    Shih, F. Y. / Wu, Y. T. | British Library Online Contents | 2004


    Fast Euclidean Morphological Operators Using Local Distance Transformation by Propagation, and Applications

    Cuisenaire, O. / Macq, B. / Institution of Electrical Engineers et al. | British Library Conference Proceedings | 1999