Approximating euclidean distance transform with simple operations in cellular processor arrays

Samad Razmjooei, Piotr Dudek

    Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

    Abstract

    This paper presents a new algorithm for computing a distance transform, particularly suitable for massively parallel cellular processor arrays. The proposed Enhanced City Block Distance Transform (ECBDT) achieves good approximation to Euclidean distances, operating with 'increment' and 'minimum' operations only, and requiring only local 4-neighbour communication. The distance values are calculated in a wavepropagating manner, and are suitable for implementation on asynchronous processor arrays. The performance of the algorithm is adjustable through parameters. Presented simulation results illustrate the operation of the algorithm, and discuss the accuracy of the distance approximation that is achieved in comparison to Euclidean, City Block, Chessboard and Chamfer distance transforms. © 2010 IEEE.
    Original languageEnglish
    Title of host publication2010 12th International Workshop on Cellular Nanoscale Networks and their Applications, CNNA 2010|Int. Workshop Cell. Nanoscale Netw. Appl., CNNA
    DOIs
    Publication statusPublished - 2010
    Event2010 12th International Workshop on Cellular Nanoscale Networks and their Applications, CNNA 2010 - Berkeley, CA
    Duration: 1 Jul 2010 → …

    Conference

    Conference2010 12th International Workshop on Cellular Nanoscale Networks and their Applications, CNNA 2010
    CityBerkeley, CA
    Period1/07/10 → …

    Fingerprint

    Dive into the research topics of 'Approximating euclidean distance transform with simple operations in cellular processor arrays'. Together they form a unique fingerprint.

    Cite this