<title>Matching of road segments using probabilistic relaxation: reducing the computational requirements</title>
Lists
Only you see this
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.
BibTeX
@inproceedings{christmas1994lt,
author = {William Christmas and Josef Kittler and Maria Petrou},
title = {{\<title\>Matching of road segments using probabilistic relaxation: reducing the computational requirements\</title\>}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {1994},
doi = {10.1117/12.179601},
}Loading related content...