.png){kind=icon}
.png){kind=icon}
Return
New sequential exact Euclidean distance transform algorithms based on convex analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.imavis.2006.10.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present several sequential exact Euclidean distance transform algorithms. The algorithms are based on fundamental transforms of convex analysis: The Legendre Conjugate or Legendre-Fenchel transform, and the Moreau envelope or Moreau-Yosida approximate. They combine the separability of the Euclidean distance with convex properties to achieve an optimal linear-time complexity. We compare them with a Parabolic Envelope distance transform, and provide several extensions. All the algorithms presented perform equally well in higher dimensions. They can naturally handle grayscale images, and their principles are generic enough to apply to other transforms. (C) 2006 Elsevier B.V. All rights reserved.
Keywords:
Distance transform
Euclidean distance
Feature transform
Fast Legendre transform
Legendre-Fenchel transform
Fenchel conjugate
Moreau envelope
Moreau-Yosida approximate
Computational convex analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
4.0K
Citations:
6.7K
Organization
No organization information available