CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2005 vol.27 Issue No.10 - October
Issue No.10 - October (2005 vol.27)
David W. Murray , IEEE
MLESAC is an established algorithm for maximum-likelihood estimation by random sampling consensus, devised for computing multiview entities like the fundamental matrix from correspondences between image features. A shortcoming of the method is that it assumes that little is known about the prior probabilities of the validities of the correspondences. This paper explains the consequences of that omission and describes how the algorithm's theoretical standing and practical performance can be enhanced by deriving estimates of these prior probabilities. Using the priors in guided-MLESAC is found to give an order of magnitude speed increase for problems where the correspondences are described by one image transformation and clutter. This paper describes two further modifications to guided-MLESAC. The first shows how all putative matches, rather than just the best, from a particular feature can be taken forward into the sampling stage, albeit at the expense of additional computation. The second suggests how to propagate the output from one frame forward to successive frames. The additional information makes guided-MLESAC computationally realistic at video-rates for correspondence sets modeled by two transformations and clutter.
Index Terms- Random sampling, correspondence, image transformation, maximum-likelihood estimation.
Ben J. Tordoff, David W. Murray, "Guided-MLESAC: Faster Image Transform Estimation by Using Matching Priors", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.27, no. 10, pp. 1523-1535, October 2005, doi:10.1109/TPAMI.2005.199