An Optimal Algorithm for Computing the Spherical Depth of Points in the Plane.
David BremnerRasoul ShahsavarifarPublished in: CoRR (2017)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- computational complexity
- preprocessing
- matching algorithm
- detection algorithm
- simulated annealing
- probabilistic model
- cost function
- closed form
- convex hull
- similarity measure
- three dimensional
- simple polygon
- optimal parameters
- average distance
- learning algorithm
- expectation maximization
- np hard
- k means
- objective function
- image segmentation