By Topic

A constant-time algorithm for computing the Euclidean Distance Transform on reconfigurable meshes

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
$33 $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)
Yi Pan ; Comput. Sci. Dept., Dayton Univ., OH, USA ; Keqin Li

The Euclidean Distance Transform (EDT) is a basic operation in computer vision, pattern recognition, and robotics. Fast computation of the EDT is needed since most of the applications using the EDT requires real-time computation. The authors propose a new and fast parallel algorithms for computing the EDT problem on the reconfigurable VLSI mesh model. It is shown that the VLSI complexity of the algorithm described is the same as those of other sequential algorithms and the mesh algorithm, while it uses much less time. To authors' best knowledge, this is the first constant-time EDT algorithm on any parallel computational model

Published in:

Aerospace and Electronics Conference, 1997. NAECON 1997., Proceedings of the IEEE 1997 National  (Volume:1 )

Date of Conference:

14-18 Jul 1997