Euclidean matching problems and the metropolis algorithm.
Mats WeberThomas M. LieblingPublished in: Z. Oper. Research (1986)
Keyphrases
- benchmark problems
- matching algorithm
- simulated annealing
- learning algorithm
- times faster
- dynamic programming
- experimental evaluation
- test problems
- computational complexity
- recognition algorithm
- search space
- preprocessing
- cost function
- computational cost
- high accuracy
- euclidean distance
- optimal or near optimal
- matching scheme
- matching process
- neural network
- detection algorithm
- expectation maximization
- parameter estimation
- objective function
- stereo matching
- similarity measure
- np complete
- optimization problems
- np hard
- significant improvement
- evolutionary algorithm