A General Algorithm for Computing Distance Transforms in Linear Time.
Arnold MeijsterJos B. T. M. RoerdinkWim H. HesselinkPublished in: ISMM (2000)
Keyphrases
- distance transform
- objective function
- special case
- worst case
- learning algorithm
- optimal solution
- np hard
- computational complexity
- higher dimensional
- k means
- euclidean distance transform
- expectation maximization
- segmentation algorithm
- feature space
- multiresolution
- object recognition
- medical images
- segmentation method
- path planning
- convex hull