Abstract
We present the use of a multi-resolution, coarse-and-fine, pyramid image architecture to solve correspondence problems in various computer vision modules including shape recognition through contour matching, stereovision, and motion estimation. The algorithm works with a grid matching and an inter-grid correspondence model by message passing in a Bayesian belief propagation (BBP) network. The local smoothness and other constraints are expressed within each resolution scale grid and also between grids in a single paradigm. Top-down and bottom-up matching are concurrently performed for each pair of adjacent levels of the image pyramid level in order to find the best matched features at each level simultaneously. The coarse-and-fine algorithm uses matching results in each layer to constrain the process in its 2 adjacent upper and lower layers by measuring the consistency between corresponding points among adjacent layers so that good matches at different resolution scales constrain one another. The coarse-and-fine method helps avoid the local minimum problem by bringing features closer at the coarse level and yet providing a complete solution at the finer level. The method is used to constrain the solution with examples in shape retrieval, stereovision, and motion estimation to demonstrate its desirable properties such as rapid convergence, the ability to obtain near optimal solution while avoiding local minima, and immunity to error propagation found in the coarse-to-fine approach. ...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Horn, K.B.P, Schunck, B.: Determining Optical Flow. Artificial Intelligence 17, 185–203 (1981)
Besag, J.: On the Statistical Analysis of Dirty Pictures. Journal of Royal Statistical Society Series B. Methodological 48(3), 259–302 (1986)
Geman, S., Geman, D.: Stochastic Relaxation, Gibbs Distribution, and the Bayes-ian Restoration of Images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6(6), 721–741 (1984)
Bilbro, G.L., Snyder, W.E: Optimization of Functions with Many Minima. IEEE Transactions on Systems 21(4), 840–849 (1991)
Amini, A., Weymouth, T., Jain, R.: Using Dynamic Programming for Solving Variational Problems. IEEE Transactions on Pattern Analysis and Machine Intelli-gence 12(9), 855–867 (1990)
Boykov, Y., Veksler, O., Zabih, R.: Fast Approximate Energy Minimization via Graph Cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Network of Plausible Inference, pp. 77–286. Morgan Kaufmann Publisher, California (1988)
Weiss, Y.: Belief Propagation and Revision in Networks with Loops. MIT AI Memo. Vol. AIM-, No. CBCL-155, 1616 (1997) 1-14
Weiss, Y.: Interpreting Images by Propagating Bayesian Beliefs. Advance in Neu-ral Information Processing Systems 9(1), 908–915 (1997)
Shental, N., Zomet, A., Hertz, T., Weiss, Y.: Learning and Inferring Image Seg-mentations Using the GBP Typical Cuts Algorithm. In: Proceedings of IEEE International Conference on Computer Vision, vol. 2, pp. 1243–1250. IEEE Computer Society Press, Los Alamitos (2003)
Komogorov, V.: Convergent Tree-reweighed Message Passing for Energy Minimi-zation. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(10), 1568–1583 (2006)
Sun, J., Shum, H.-Y., Zheng, N.-N.: Stereo Matching Using Belief Propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(7), 1–14 (2003)
Coughlan, J.M., Ferreira, S.J.: Finding Deformable Shapes Using Loopy Belief Propagation. In: Proceedings of European Conference on Computer Vision-Part III, pp. 453–468 (2003)
Gao, J., Shi, J.: Multiple frame motion inference using belief propagatio. In: Proceedings of IEEE International Conference on Automatic Face and Gesture Recognition, pp. 875–880. IEEE Computer Society Press, Los Alamitos (2004)
Marapane, S.B., Trivedi, M.M.: Multi-Primitive Hierarchical (MPH) Stereo Analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(3), 227–240 (1994)
Jain, A.K., Zhong, Y., Lakshmanan, S.: Object Matching Using Deformable Templates. IEEE Transaction on Pattern Analysis and Machine Intelligence 18(3), 267–278 (1996)
Felzenwalb, P., HuttenLocker, D.: Efficient Belief Propagation for Early Visio. IEEE Conference of Computer Vision and Pattern Recognition 1, I261–I268 (2004)
Tipwai, P.: Ph.D. Dissertation. King Monkut’s University of Technology Thonburi (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tipwai, P., Madarasmi, S. (2007). A Coarse-and-Fine Bayesian Belief Propagation for Correspondence Problems in Computer Vision. In: Gelbukh, A., Kuri Morales, Á.F. (eds) MICAI 2007: Advances in Artificial Intelligence. MICAI 2007. Lecture Notes in Computer Science(), vol 4827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76631-5_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-76631-5_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76630-8
Online ISBN: 978-3-540-76631-5
eBook Packages: Computer ScienceComputer Science (R0)