JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/9516

Title: In-Place Linear-time Algorithms for Euclidean Distance Transform
Authors: Asano, Tetsuo
Tanaka, Hiroshi
Keywords: binary image
Euclidean Distance Transform
in-place algorithm
space-efficient algorithm
Issue Date: 2010-09-18
Publisher: Springer
Magazine name: Transactions on Computational Science VIII, Lecture Notes in Computer Science
Volume: 6260/2011
Start page: 103
End page: 113
DOI: 10.1007/978-3-642-16236-7_7
Abstract: Given a binary image, Euclidean distance transform is to compute for each pixel the Euclidean distance to the closest black pixel. This paper presents a linear-time algorithm for Euclidean distance transform without using any extra array. This is an improvement over a known algorithm which uses additional arrays as work storage. An idea to reduce the work space is to utilize the output array as work storage. Implementation results and comparisons with existing algorithms are also included.
Rights: This is the author-created version of Springer, Tetsuo Asano and Hiroshi Tanaka, Transactions on Computational Science VIII, Lecture Notes in Computer Science, 6260/2011, 2010, 103-113. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-16236-7_7
URI: http://hdl.handle.net/10119/9516
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
15871-1.pdf184KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology