Fast Algorithm for Computing the Shape of a Set of Digital Points.
Mahmoud MelkemiDenis VandorpePublished in: ICIP (1) (1994)
Keyphrases
- computational complexity
- learning algorithm
- initial set
- convex hull
- np hard
- preprocessing
- boundary points
- dynamic programming
- input data
- digital straight line
- search space
- delaunay triangulation
- matching algorithm
- segmentation algorithm
- input pattern
- detection algorithm
- expectation maximization
- simulated annealing
- cost function
- d objects
- point sets
- image set
- geodesic distance
- packing problem
- data points
- k means
- feature space
- average distance
- finite set of points
- objective function