## Hamilton-Jacobi Skeletons (1999)

### Cached

### Download Links

- [www.cs.mcgill.ca]
- [www.cim.mcgill.ca]
- [www.cim.mcgill.ca]
- [pages.cs.wisc.edu]
- [www.cim.mcgill.ca]
- [www.cim.mcgill.ca]
- DBLP

### Other Repositories/Bibliography

Citations: | 119 - 12 self |

### BibTeX

@MISC{Siddiqi99hamilton-jacobiskeletons,

author = {Kaleem Siddiqi and Sylvain Bouix and Allen Tannenbaum and Steven W. Zucker},

title = {Hamilton-Jacobi Skeletons},

year = {1999}

}

### Years of Citing Articles

### OpenURL

### Abstract

The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical morphology, stereo, shape-from-shading and for recent dynamic theories of shape. Its numerical simulation can be delicate, owing to the formation of singularities in the evolving front and is typically based on level set methods. However, there are more classical approaches rooted in Hamiltonian physics which have yet to be widely used by the computer vision community. In this paper we review the Hamiltonian formulation, which offers specific advantages when it comes to the detection of singularities or shocks. We specialize to the case of Blum's grass fire flow and measure the average outward ux of the vector field that underlies the Hamiltonian system. This measure has very different limiting behaviors depending upon whether the region over which it is computed shrinks to a singular point or a non-singular one. Hence, it is an effective way to distinguish between these two cases. We combine the ux measurement with a homotopy preserving thinning process applied in a discrete lattice. This leads to a robust and accurate algorithm for computing skeletons in 2D as well as 3D, which has low computational complexity. We illustrate the approach with several computational examples.