Abstract
AbstractWe propose an improved 3 × 3 sequential Euclidean distance transform (DT) using quad‐scan propagation. Our method has a separable scan structure that can be processed with a multicore processor to reduce computation time with a better accuracy. The computer simulation shows that the proposed DT algorithm approximates the Euclidean map more precisely than conventional 3 × 3 DTs while reducing dramatically computation time comparable to 8‐point sequential Euclidean distance algorithm. © 2013 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEJ Transactions on Electrical and Electronic Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
