The Community for Technology Leaders
Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers (1994)
Pacific Grove, CA, USA
Oct. 31, 1994 to Nov. 2, 1994
ISSN: 1058-6393
ISBN: 0-8186-6405-3
pp: 980-984
J.C. McGaffigan , Worcester Polytech. Inst., MA, USA
J.A. Orr , Worcester Polytech. Inst., MA, USA
ABSTRACT
This paper addresses the general image point correspondence problem, with no a priori constraints on camera or object motion. The solution is cast as a cost minimization problem using the simulated annealing algorithm. This is achieved by using a cost function to evaluate the quality of match between pairs of points extracted from each image. Using edge detection and feature extraction techniques points from each image are found which possess strong local features, such as curvature, concavity, standard deviation, and gradient. These features are used to define the cost function for candidate correspondence. The overall algorithm was implemented and tested using a Unix workstation. Test image pairs that were used represented a wide range of relative motions.<>
INDEX TERMS
image matching, simulated annealing, edge detection, feature extraction, minimisation
CITATION

J. McGaffigan and J. Orr, "Application of simulated annealing to the general image point correspondence problem," Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers(ACSSC), Pacific Grove, CA, USA, 1995, pp. 980-984.
doi:10.1109/ACSSC.1994.471606
95 ms
(Ver 3.3 (11022016))