Translator Disclaimer
Paper
13 July 1994 Matching of road segments using probabilistic relaxation: reducing the computational requirements
Author Affiliations +
Abstract
In previous work we presented an algorithm for matching features extracted from an image with those extracted from a model, using a probabilistic relaxation method. Because the algorithm compares each possible match with all other possible matches, the main obstacle to its use on large data sets is that both the computation time and the memory usage are proportional to the square of the number of possible matches. This paper describes some improvements to the algorithm to alleviate these problems. The key sections of the algorithm are the generation, storage, and use of the compatibility coefficients. We describe three different schemes that reduce the number of these coefficients. The execution time is improved in each case, even when the number of iterations required for convergence is greater than in the unmodified algorithm. We show that the new methods also perform well, generating good matches in all cases.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
William J. Christmas, Josef Kittler, and Maria Petrou "Matching of road segments using probabilistic relaxation: reducing the computational requirements", Proc. SPIE 2220, Sensing, Imaging, and Vision for Control and Guidance of Aerospace Vehicles, (13 July 1994); https://doi.org/10.1117/12.179601
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Highway 3D model from image and lidar data
Proceedings of SPIE (May 22 2014)
Color scene recognition using relational distance measurement
Proceedings of SPIE (February 27 1996)
Model-based matching using elliptical features
Proceedings of SPIE (May 24 1996)
Building detection from LIDAR and images in urban areas
Proceedings of SPIE (November 15 2007)
Knowleuye-Baseu Seyentation Of Road Scenes
Proceedings of SPIE (December 10 1986)

Back to Top