|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2010 Canadian Conference on Computer and Robot Vision
Probabilistic Framework for Feature-Point Matching
Ottawa, Ontario, Canada
May 31-June 02
ISBN: 978-0-7695-4040-5
| ASCII Text | x | ||
| Ron Tal, Minas E. Spetsakis, "Probabilistic Framework for Feature-Point Matching," Computer and Robot Vision, Canadian Conference, pp. 1-8, 2010 Canadian Conference on Computer and Robot Vision, 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/CRV.2010.8, author = {Ron Tal and Minas E. Spetsakis}, title = {Probabilistic Framework for Feature-Point Matching}, journal ={Computer and Robot Vision, Canadian Conference}, volume = {0}, year = {2010}, isbn = {978-0-7695-4040-5}, pages = {1-8}, doi = {http://doi.ieeecomputersociety.org/10.1109/CRV.2010.8}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer and Robot Vision, Canadian Conference TI - Probabilistic Framework for Feature-Point Matching SN - 978-0-7695-4040-5 SP1 EP8 A1 - Ron Tal, A1 - Minas E. Spetsakis, PY - 2010 KW - Monte-Carlo KW - Correspondence VL - 0 JA - Computer and Robot Vision, Canadian Conference ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CRV.2010.8
In this report we introduce a novel approach for determining correspondence in a sequence of images. We formulate a probabilistic framework that relates a feature's appearance and its position under relaxed statistical assumptions. We employ a Monte-Carlo approximation for the joint probability density of the feature position and its appearance that uses a flexible noise and motion model to generate random samples. The joint probability density is modeled by a Gaussian Mixture. The feature's position given its appearance is then determined by maximizing its posterior. We evaluate our method using real and synthetic sequences and compare its performance with leading or popular algorithms from the literature. The noise robustness of our algorithm is superior under a wide variety of conditions. The method can be applied in the context of optical flow, tracking and any application that needs feature point matching.
Index Terms:
Monte-Carlo, Correspondence
Citation:
Ron Tal, Minas E. Spetsakis, "Probabilistic Framework for Feature-Point Matching," crv, pp.1-8, 2010 Canadian Conference on Computer and Robot Vision, 2010
Usage of this product signifies your acceptance of the Terms of Use.
