On the continuous Fermat-Weber problem for a convex polygon using Euclidean distance.
Thomas T. C. K. ZhangJohn Gunnar CarlssonPublished in: CoRR (2014)
Keyphrases
- euclidean distance
- convex hull
- image space
- distance measure
- minkowski sum
- euclidean space
- discrete space
- data points
- feature vectors
- distance function
- similarity measure
- distance metric
- multi source
- dimensionality reduction
- similarity measurement
- manhattan distance
- mahalanobis distance
- convex optimization
- dynamic time warping
- cosine distance
- high dimensional spaces
- fuzzy c means
- data sets
- color images
- geodesic distance
- pattern recognition
- neural network
- machine learning
- feature extraction
- nearest neighbor