Improved 3 × 3 sequential Euclidean distance transform | Zendy

Kwon OhKyu | Zendy; Suh Jung W. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Improved 3 × 3 sequential Euclidean distance transform

Author(s) -

Kwon OhKyu,

Suh Jung W.

Publication year - 2013

Publication title -

ieej transactions on electrical and electronic engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.254

H-Index - 30

eISSN - 1931-4981

pISSN - 1931-4973

DOI - 10.1002/tee.21858

Subject(s) - euclidean distance , computation , euclidean geometry , distance transform , euclidean distance matrix , algorithm , computer science , point (geometry) , separable space , euclidean algorithm , artificial intelligence , mathematics , image (mathematics) , geometry , mathematical analysis

We 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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research