The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2013 vol.35)
pp: 755-762
Aveek S. Brahmachari , University of South Florida, Tampa
Sudeep Sarkar , University of South Florida, Tampa
ABSTRACT
We present a Monte Carlo approach for epipolar geometry estimation that efficiently searches for minimal sets of inlier correspondences in the presence of many outliers in the putative correspondence set, a condition that is prevalent when we have wide baselines, significant scale changes, rotations in depth, occlusion, and repeated patterns. The proposed Monte Carlo algorithm uses Balanced LOcal and Global Search (BLOGS) to find the best minimal set of correspondences. The local search is a diffusion process using Joint Feature Distributions that captures the dependencies among the correspondences. And, the global search is a hopping search process across the minimal set space controlled by photometric properties. Using a novel experimental protocol that involves computing errors for manually marked ground truth points and images with outlier rates as high as 90 percent, we find that BLOGS is better than related approaches such as MAPSAC [1], NAPSAC [2], and BEEM [3]. BLOGS results are of similar quality as other approaches, but BLOGS generate them in 10 times fewer iterations. The time per iteration for BLOGS is also the lowest among the ones we studied.
INDEX TERMS
Geometry, Proposals, Blogs, Joints, Estimation, Linear programming, Monte Carlo methods, Joint Feature Distribution (JFD), Epipolar geometry, Markov Chain Monte Carlo (MCMC)
CITATION
Aveek S. Brahmachari, Sudeep Sarkar, "Hop-Diffusion Monte Carlo for Epipolar Geometry Estimation between Very Wide-Baseline Images", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.35, no. 3, pp. 755-762, March 2013, doi:10.1109/TPAMI.2012.227
REFERENCES
[1] P. Torr, "Bayesian Model Estimation and Selection for Epipolar Geometry and Generic Manifold Fitting," Int'l J. Computer Vision, vol. 50, no. 1, pp. 35-61, 2002.
[2] D.R. Myatt, P. Torr, S. Nasuto, J. Bishop, and R. Craddock, "NAPSAC: High Noise, High Dimensional Robust Estimation—It's in the Bag," Proc. British Machine Vision Conf., vol. 2, pp. 458-467, 2002.
[3] L. Goshen and I. Shimshoni, "Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 7, pp. 1230-1242, July 2008.
[4] Z. Zhang, "Determining the Epipolar Geometry and Its Uncertainty: A Review," Int'l J. Computer Vision, vol. 27, no. 2, pp. 161-195, 1998.
[5] X. Armangue and J. Salvi, "Overall View Regarding Fundamental Matrix Estimation," Image and Vision Computing, vol. 21, no. 2, pp. 205-220, 2003.
[6] T. Chin, H. Wang, and D. Suter, "Robust Fitting of Multiple Structures: The Statistical Learning Approach," Proc. IEEE Int'l Conf. Computer Vision, pp. 413-420, 2009.
[7] S. Rozenfeld and I. Shimshoni, "The Modified PbM-Estimator Method and a Runtime Analysis Technique for the RANSAC Family," Proc IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 1113-1120, 2005.
[8] Y. Zheng, S. Sugimoto, and M. Okutomi, "A Branch and Contract Algorithm for Globally Optimal Fundamental Matrix Estimation," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2011.
[9] M. Fishler and R. Boles, "RANdom SAmple Concensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Pages Cartography," Comm. ACM, vol. 24, no. 6, pp. 381-395, 1981.
[10] O. Chum, J. Matas, and J. Kittler, "Locally Optimized RANSAC," Proc. DAGM Symp., pp. 236-243, 2003.
[11] O. Chum and J. Matas, "Matching with PROSAC—PROgressive SAmple Consensus," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 220-226, 2005.
[12] B. Tordoff and D.W. Murray, "Guided-MLESAC: Faster Image Transform Estimation by Using Matching Priors," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1523-1535, Oct. 2005.
[13] D.G. Lowe, "Distinctive Image Features from Scale-Invariant Keypoints," Int'l J. Computer Vision, vol. 60, pp. 91-110, 2004.
[14] K. Ni, H. Jin, and F. Dellaert, "GroupSAC: Efficient Consensus in the Presence of Groupings," Proc. IEEE Int'l Conf. Computer Vision, pp. 2193-2200, 2009.
[15] C. Stewart, "MINPRAN: A New Robust Operator for Computer Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 10, pp. 925-938, Oct. 1995.
[16] P. Meer, D. Mintz, A. Rosenfeld, and D. Kim, "Robust Regression Methods for Computer Vision: A Review," Int'l J. Computer Vision, vol. 6, no. 1, pp. 59-70, 1991.
[17] P. Torr and A. Zisserman, "MLESAC: A New Robust Estimator with Application to Estimating Image Geometry," Computer Vision and Image Understanding, vol. 78, no. 1, pp. 138-156, 2000.
[18] J. Frahm and M. Pollefeys, "RANSAC for (Quasi-) Degenerate Data (QDEGSAC)," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 453-460, 2006.
[19] O. Chum, T. Werner, and J. Matas, "Two-View Geometry Estimation Unaffected by a Dominant Plane," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 772-779, 2005.
[20] B. Triggs, "Joint Feature Distributions for Image Correspondence," Proc. IEEE Int'l Conf. Computer Vision, pp. 201-208, 2001.
[21] J. Domke and Y. Aloimonos, "A Probabilistic Framework for Correspondence and Egomotion," Proc. IEEE Int'l Conf. Computer Vision Workshop Dynamical Vision, pp. 232-242, 2005.
[22] P. Torr and C. Davidson, "IMPSAC: Synthesis of Importance Sampling and Random Sample Consensus," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 3, pp. 354-364, Mar. 2003.
[23] A. Welsh, "On M-Processes and M-Estimation," Ann. of Statistics, vol. 17, no. 1, pp. 337-361, 1989.
[24] A. Brahmachari and S. Sarkar, "BLOGS: Balanced LOcal and Global Search for Non-Degenerate Two View Epipolar Geometry," Proc. IEEE Int'l Conf. Computer Vision, 2009.
[25] H. Longuet-Higgins, "A Computer Program for Reconstructing a Scene from Two Projections," Nature, vol. 293, no. 11, pp. 133-135, 1981.
[26] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision. Cambridge Univ. Press, 2000.
[27] P. Torr and D. Murray, "The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix," Int'l J. Computer Vision, vol. 24, no. 3, pp. 271-300, 1997.
[28] A. Doucet, N. de Freitas, and N. Gordon, Sequential Monte Carlo Methods in Practice. Springer, 2001.
[29] L. Tierney, "Markov Chains for Exploring Posterior Distributions," Ann. of Statistics, vol. 22, pp. 1701-1728, 1994.
[30] P.J. Green, "Reversible Jump Markov Chain Monte Carlo Computation and Bayesian Model Determination," Biometrika, vol. 82, no. 4, pp. 711-732, 1995.
[31] Z.T. Feng Han and S.C. Zhu, "Range Image Segmentation by an Effective Jump-Diffusion Method," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1138-1153, Sept. 2004.
[32] S. Choi, T. Kim, and W. Yu, "Performance Evaluation of RANSAC Family," Proc. British Machine Vision Conf., pp. 1-12, 2009.
[33] R. Raguram, J. Frahm, and M. Pollefeys, "A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus," Proc. European Conf. Computer Vision, pp. 500-513, 2008.
[34] "WBS Image Matcher," http://cmp.felk.cvut.cz/wbsdemodemo/, 2012.
[35] "Nokia Challenge 2010: Where Was This Photo Taken, and How?" http://comminfo.rutgers.edu/conferences/ mmchallenge/2010/02/10nokia-challenge/, 2012.
[36] "Visual Geometry Group Home Page," http://www.robots.ox. ac.uk/vgg/datadata-aff.html , 2012.
[37] Y. Ke and R. Sukthankar, "PCA-SIFT: A More Distinctive Representation for Local Image Descriptors," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 506-513, 2004.
38 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool