作者: J.P. Pascual Starink , Eric Backer
DOI: 10.1016/0031-3203(94)00087-3
关键词:
摘要: Abstract Identifying corresponding points between two recordings of a point set has always been an important problem in stereo vision applications. We describe this matching terms cost minimization and present algorithm to approach the minimal mapping using simulated annealing. The calculates costs match all possible pairs tries minimize sum matched points. Starting from initial mapping, it uses random rearrangement scheme alter towards optimal (minimal cost) mapping.