Incremental Distance Transforms (IDT)

Theo E. Schouten, Egon van den Broek

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    8 Citations (Scopus)
    106 Downloads (Pure)


    A new generic scheme for incremental implementations of distance transforms (DT) is presented: Incremental Distance Transforms (IDT). This scheme is applied on the cityblock, Chamfer, and three recent exact Euclidean DT (E2DT). A benchmark shows that for all five DT, the incremental implementation results in a significant speedup: 3.4×−10×. However, significant differences (i.e., up to 12.5×) among the DT remain present. The FEED transform, one of the recent E2DT, even showed to be faster than both city-block and Chamfer DT. So, through a very efficient incremental processing scheme for DT, a relief is found for E2DT’s computational burden.
    Original languageUndefined
    Title of host publication20th IEEE International Conference on Pattern Recognition (ICPR 2010)
    EditorsA. Erçil, M. Çetin, K. Boyer, S.-W. Lee
    Place of PublicationPiscataway, NJ, USA
    Number of pages4
    ISBN (Print)978-0-7695-4109-9
    Publication statusPublished - 23 Aug 2010
    Event20th International Conference on Pattern Recognition 2010 - Istanbul Convention & Exhibition Centre, Istanbul, Turkey
    Duration: 23 Aug 201026 Aug 2010
    Conference number: 20

    Publication series

    PublisherIEEE Computer Society Press


    Conference20th International Conference on Pattern Recognition 2010
    Abbreviated titleICPR 2010
    Internet address


    • METIS-270964
    • Incremental Distance Transforms (IDT)
    • Euclidean distance
    • IR-73395
    • EWI-18265
    • Fast Exact Euclidean Distance (FEED)
    • distance maps/transforms
    • incremental implementation
    • HMI-IE: Information Engineering
    • Video processing

    Cite this