By Topic

Approximating Euclidean distance transform with simple operations in cellular processor arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Razmjooei, S. ; Sch. of Electr. & Electron. Eng., Univ. of Manchester, Manchester, UK ; Dudek, P.

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 wave-propagating 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.

Published in:

Cellular Nanoscale Networks and Their Applications (CNNA), 2010 12th International Workshop on

Date of Conference:

3-5 Feb. 2010