Abstract
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representational approximation, which involves a simplified and suboptimal modeling for the original problem, and algorithmic approximation, which consists in using suboptimal algorithms to infer the assignment. Matching techniques in general have relied on the second approach: to keep a complete model of the original problem and use suboptimal techniques to solve it. In this paper, we show how a technique based on using exact inference in simple graphical models, which is an instance of the first class, can significantly outperform instances of techniques from the second class. We give theoretical insights of why this happens, and experimentally compare our approach with the well-known Shapiro and Brady and Christmas et al. methods, which are exemplars of the second class. We perform experiments with synthetic and real-world data sets, which reveal a significant accuracy improvement of the proposed technique both under point position jitter and size increasing of the point sets. The main conclusion is that techniques based on optimal algorithms with appropriate suboptimal representations may lead to better results than their counterparts which consist in using optimal representations, but approximate algorithms.
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
Wang, H., Hancock, E.R.: A kernel view of spectral point pattern matching. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 361–369. Springer, Heidelberg (2004)
Caetano, T.S., Caelli, T., Barone, D.A.C.: An optimal probabilistic graphical model for point set matching. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 162–170. Springer, Heidelberg (2004)
Akutsu, T., Kanaya, K., Ohyama, A., Fujiyama, A.: Point matching under non-uniform distortions. Discrete Applied Mathematics 127, 5–21 (2003)
Caetano, T.S.: Graphical models and point set matching. PhD. Thesis, Universidade Federal do Rio Grande do Sul, Brazil (2004)
Shapiro, L., Brady, J.M.: Feature-based Correspondence - An Eigenvector Approach. Image and Vision Computing 10, 283–288 (1992)
Carcassoni, M., Hancock, E.R.: Spectral correspondence for point pattern matching. Pattern Recognition 36, 193–204 (2003)
Rosenfeld, A., Kak, A.C.: Digital Picture Processing, vol. 1. Academic Press, New York (1982)
Christmas, W.J., Kittler, J., Petrou, M.: Structural Matching in Computer Vision Using Probabilistic Relaxation. IEEE Trans. PAMI 17(8), 749–764 (1995)
Caelli, T., Kosinov, S.: An eigenspace projection clustering method for inexact graph matching. IEEE Trans. PAMI 26(4), 515–519 (2004)
Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. PAMI 18(4), 377–388 (1996)
Jordan, M.I.: An Introduction to Probabilistic Graphical Models (in preparation)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)
Lauritzen, S.L.: Graphical Models. Oxford University Press, New York (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caetano, T.S., Caelli, T. (2005). Approximating the Problem, not the Solution: An Alternative View of Point Set Matching. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-31988-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25270-2
Online ISBN: 978-3-540-31988-7
eBook Packages: Computer ScienceComputer Science (R0)