On shortest three-edge-connected Steiner networks with Euclidean distance.
D. Frank HsuXiao-Dong HuPublished in: Discret. Appl. Math. (2000)
Keyphrases
- euclidean distance
- distance measure
- image space
- similarity measurement
- distance metric
- distance function
- neighborhood graph
- similarity measure
- euclidean space
- data points
- mahalanobis distance
- feature vectors
- dimensionality reduction
- edge detection
- shortest path
- dynamic time warping
- angular error
- cosine distance
- manhattan distance
- complex networks
- geodesic distance
- weighted graph
- high dimensional spaces
- edge detector
- neural network
- pattern recognition
- kernel induced
- feature extraction
- face recognition