Abstract
This paper addresses the problem of finding correspondences between two sets of features by using multiple order constraints all together. First, we build a high-order supersymmetric tensor, called multiple order tensor, to incorporate the constraints of different orders (e.g., unary, pairwise, third order, etc.). The multiple order tensor naturally merges multi-granularity geometric affinities, thus it presents stronger descriptive power of consistent constraints than the individual order based methods. Second, to achieve the optimal matching, we present an efficient computational approach for the power iteration of the multiple order tensor. It only needs sparse tensor elements and reduces the sampling size of feature tuples, due to the supersymmetry of the multiple order tensor. The experiments on both synthetic and real image data show that our approach improves the matching performance compared to state-of-the-art 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
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18, 265–298 (2004)
Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24, 509–522 (2002)
Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision 60, 91–110 (2004)
Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2008), pp. 1–8 (2008)
Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2009), pp. 1980–1987 (2009)
Chertok, M., Keller, Y.: Efficient high order matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 99, 32(12), 2205–2215 (2010)
Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: International Conference of Computer Vision (ICCV 2005), pp. 1482–1489 (2005)
Lathauwer, L.D., Moor, B.D., Vandewalle, J.: On the best rank-1 and rank-(r1,r2,.,rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21, 1324–1342 (2000)
Kofidis, E., Regalia, P.A.: On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl. 23, 863–884 (2002)
Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: Advanced in Neural Information Processing Systems (NIPS 2006) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, A., Li, S., Zeng, L. (2011). Multiple Order Graph Matching. In: Kimmel, R., Klette, R., Sugimoto, A. (eds) Computer Vision – ACCV 2010. ACCV 2010. Lecture Notes in Computer Science, vol 6494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19318-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-19318-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19317-0
Online ISBN: 978-3-642-19318-7
eBook Packages: Computer ScienceComputer Science (R0)