Subscribe
Issue No.02 - Feb. (2013 vol.35)
pp: 411-424
Hongsheng Li , Comput. Sci. Dept., Southwestern Univ. of Finance & Econ., Chengdu, China
Xiaolei Huang , Dept. of Comput. Sci. & Eng., Lehigh Univ., Bethlehem, PA, USA
Lei He , Digital Conversion Service, Libr. of Congress, Potomac, MD, USA
ABSTRACT
In this paper, we introduce a new matching method based on a novel locally affine-invariant geometric constraint and linear programming techniques. To model and solve the matching problem in a linear programming formulation, all geometric constraints should be able to be exactly or approximately reformulated into a linear form. This is a major difficulty for this kind of matching algorithm. We propose a novel locally affine-invariant constraint which can be exactly linearized and requires a lot fewer auxiliary variables than other linear programming-based methods do. The key idea behind it is that each point in the template point set can be exactly represented by an affine combination of its neighboring points, whose weights can be solved easily by least squares. Errors of reconstructing each matched point using such weights are used to penalize the disagreement of geometric relationships between the template points and the matched points. The resulting overall objective function can be solved efficiently by linear programming techniques. Our experimental results on both rigid and nonrigid object matching show the effectiveness of the proposed algorithm.
INDEX TERMS
Linear programming, Mathematical model, Pattern matching, Least squares approximation, Probabilistic logic, Vectors, USA Councils,linear programming, Feature matching, object matching, locally affine invariant
CITATION
Hongsheng Li, Xiaolei Huang, Lei He, "Object Matching Using a Locally Affine Invariant and Linear Programming Techniques", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.35, no. 2, pp. 411-424, Feb. 2013, doi:10.1109/TPAMI.2012.99
REFERENCES
 [1] lpsolve: sourceforge.net/projects/lpsolve, 2012. [2] CMU "hotel" Data Set, http://vasc.ri.cmu.edu/idb/html/ motion/ hotelindex.html, 2006. [3] CMU "house" Data Set, http://vasc.ri.cmu.edu/idb/html/ motion/ houseindex.html, 2006. [4] Mythological Creatures 2D Database, http:/tosca.cs.technion. ac.il, 2009. [5] S. Belongie, J. Malik, and J. Puzicha, "Shape Matching and Object Recognition Using Shape Contexts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509-522, Apr. 2002. [6] A.C. Berg, T.L. Berg, and J. Malik, "Shape Matching and Object Recognition Using Low Distortion Correspondences," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 26-33, 2005. [7] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004. [8] T. Caelli and S. Kosinov, "An Eigenspace Projection Clustering Method for Inexact Graph Matching," IEEE Trans. Pattern Analayis and Machine Intelligence, vol. 26, no. 4, pp. 515-519, Apr. 2004. [9] T.S. Caetano, T. Caelli, D. Schuurmans, and D.A.C. Barone, "Graphical Models and Point Pattern Matching," IEEE Trans. Pattern Analayis and Machine Intelligence, vol. 28, no. 10, pp. 1646-1662, Oct. 2006. [10] T.S. Caetano, J.J. McAuley, L. Cheng, Q.V. Le, and A.J. Smola, "Learning Graph Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 6, pp. 2349-2374, June 2009. [11] M. Carcassoni and E. Hancock, "Spectral Correspondence for Point Pattern Matching," Pattern Recognition, vol. 36, pp. 193-204, 2003. [12] W.J. Christmas, J. Kittler, and M. Petrou, "Structural Matching in Computer Vision Using Probabilistic Relaxation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749-764, Aug. 1995. [13] H. Chui and A. Rangarajan, "A New Point Matching Algorithm for Non-Rigid Registration," Computer Vision and Image Understanding, vol. 89, pp. 114-141, 2003. [14] T. Cour, P. Srinivasan, and J. Shi, "Balanced Graph Matching," Proc. Neural Information Processing Systems, pp. 313-320, 2006. [15] A.D.J. Cross and E.R. Hancock, "Graph Matching with a Dual-Step EM Algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 11, pp. 1236-1253, Aug. 1998. [16] O. Duchenne, F. Bach, I. Kweon, and J. Ponce, "A Tensor-Based Algorithm for High-Order Graph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2009. [17] M.A. Fischler and R.C. Bolles, "Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography," Comm. ACM, vol. 24, pp. 381-395, 1981. [18] S. Gold and A. Rangarajan, "A Graduated Assignment Algorithm for Graph Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, Apr. 1996. [19] H. Jiang, T.-P. Tian, "Scale and Rotation Invariant Matching Using Linearly Augmented Tree," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2011. [20] H. Jiang, M.S. Drew, and Z. Li, "Matching by Linear Programming and Successive Convexification," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 6, pp. 959-975, June 2007. [21] H. Jiang and S.X. Yu, "Linear Solution to Scale and Rotation Invariant Object Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2009. [22] J.V. Kittler and E.R. Hancock, "Combining Evidence in Probabilistic Relaxation," Int'l J. Pattern Recognition and Artificial Intelligence, vol. 3, pp. 29-51, 1989. [23] M. Leordeanu and M. Hebert, "A Spectral Technique for Correspondence Problems Using Pairwise Constraints," Proc. IEEE Int'l Conf. Computer Vision, pp. 1482-1489, 2005. [24] M. Leordeanu and M. Hebert, "Unsupervised Learning for Graph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2009. [25] S.Z. Li, "A Markov Random Field Model for Object Matching Under Contextual Constraints," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 866-869, 1994. [26] H. Liu and S. Yan, "Common Visual Pattern Discovery via Spatially Coherent Correspondences," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010. [27] D.G. Lowe, "Distinctive Image Features from Scale-Invariant Keypoints," Int'l J. Computer Vision, vol. 60, pp. 91-110, 2004. [28] J. Matas, O. Chum, M. Urba, and T. Pajdla, "Robust Wide Baseline Stereo from Maximally Stable Extremal Regions," Proc. British Machine Vision Conf., pp. 384-396, 2002. [29] B.T. Messmer and H. Bunke, "A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 5, pp. 493-503, May 1998. [30] K. Mikolajczyk and C. Schmid, "Scale and Affine Invariant Interest Point Detectors," Int'l J. Computer Vision, vol. 60, pp. 63-86, 2004. [31] M. Pelillo, "Replicator Equations, Maximal Cliques, and Graph Isomorphism," Neural Computation, vol. 11, pp. 1933-1955, 1999. [32] 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, vol. 2, pp. 500-513, 2008. [33] A. Rosenfeld and A.C. Kak, Digital Picture Processing. Academic Press, 1982. [34] S. Roweis and L. Saul, "Nonlinear Dimensionality Reduction by Locally Linear Embedding," Science, vol. 290, no. 5500, pp. 2323-2326, 2000. [35] C. Schellewald, "Convex Mathematical Programs for Relational Matching of Object Views," PhD dissertation, Univ. of Mannhein, 2004. [36] C. Schmid and R. Mohr, "Local Grayvalue Invariants for Image Retrieval," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 5, pp. 530-535, May 1997. [37] L. Shapiro and J. Brady, "Feature-Based Correspondence—An Eigenvector Approach," Image and Vision Computing, vol. 10, pp. 283-288, 1992. [38] M. Torki and A. Elgammal, "One-Shot Multi-Set Non-Rigid Feature-Spatial Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010. [39] L. Torresani, V. Kolmogorov, and C. Rother, "Feature Correspondence via Graph Matching: Models and Global Optimization," Proc. European Conf. Computer Vision, 2008. [40] M. van Wyk, T. Durrani, and B. van Wyk, "A RKHS Interpolator-Based Graph Matching Algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 988-995, July 2002. [41] H. Wang and E.R. Hancock, "A Kernel View of Spectral Point Pattern Matching," Proc. Int'l Workshop Advances in Structural and Syntactic Pattern Recognition and Statistical Techniques in Pattern Recognition, 2004. [42] R.C. Wilson and E.R. Hancock, "Structural Matching by Discrete Relaxation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 6, pp. 634-648, June 1997. [43] R. Zass and A. Shashua, "Probabilistic Graph and Hypergraph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2008. [44] Y. Zheng, A.A. Hunter, J. Wu, H. Wang, J. Gao, M.G. Maguire, and J.C. Gee, "Landmark Matching Based Automatic Retinal Image Registration with Linear Programming And Self-Similarities," Proc. Int'l Conf. Information Processing Medical Imaging, 2011.