Unified graph matching in Euclidean spaces

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 1871-1878

  McAuley, Julian J ^a   De Campos, Téofilo ^b   Caetano, Tibério S ^a  

^a CSIRO   (Australia)

^b UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PROBLEMS; DATA SETS; ESTIMATION METHODS; EUCLIDEAN SPACES; GRAPH MATCHINGS; LEARNING PROCESS; MACHINE-LEARNING; MATCHING PROBLEMS; NODE ATTRIBUTE;

SET THEORY;

COMPUTER VISION;

EID: 77956007160     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5539859     Document Type: Conference Paper

References (25)

1. P. F. Felzenszwalb and D. P. Huttenlocher. Pictorial structures for object recognition. International Journal of Computer Vision, 61(1):55-79, 2005.
2. J. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. IEEE Trans. on PAMI, 24(4):509-522, 2002. (Pubitemid 34448769)
3. R. I. Hartley and A. Zisserman. Multiple View Geometry in Computer Vision. Cambridge University Press, 2004.
4. J. Ullman. An algorithm for subgraph isomorphism. Journal of the ACM, 23(1):31-42, 1976.
5. A. S. LaPaugh and R. L. Rivest. The subgraph homeomorphism problem. In ACM Symposium on Theory of Computing, 1978.
6. J. J. McAuley, T. S. Caetano, and A. J. Smola. Robust nearisometric matching via structured learning of graphical models. NIPS, 2008.
7. H. Ling and D. Jacobs. Shape classification using the inner-distance. IEEE Trans. on PAMI, 29(2):286-299, 2007.
8. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
9. L. Shapiro and J. Brady. Feature-based correspondence - an eigenvector approach. Image and Vision Computing, 10:283-288, 1992.
10. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. In NIPS, 2006.
11. R. C. Wilson and E. R. Hancock. Structural matching by discrete relaxation. IEEE Trans. on PAMI, 19(6):634-648, 1997.
12. J. V. Kittler and E. R. Hancock. Combining evidence in probabilistic relaxation. Int. Journal of Pattern Recognition and Artificial Intelligence, 3:29-51, 1989.
13. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Trans. PAMI, 18(4):377-388, 1996.
14. J. J. McAuley, T. S. Caetano, and M. S. Barbosa. Graph rigidity, cyclic belief propagation and point pattern matching. IEEE Trans. on PAMI, 30(11):2047-2054, 2008.
15. T. S. Caetano and J. J. McAuley. Faster graphical models for point-pattern matching. Spatial Vision, 2009.
16. T. S. Caetano and T. Caelli. A unified formulation of invariant point pattern matching. In ICPR, 2006.
17. D. G. Lowe. Object recognition from local scale-invariant features. In ICCV, 1999.
18. I. Tsochantaridis, T. Hofmann, T. Joachims, and Y. Altun. Support vector machine learning for interdependent and structured output spaces. In ICML, 2004.
19. C. H. Teo, Q. Le, A. J. Smola, and S. V. N. Vishwanathan. A scalable modular convex solver for regularized risk minimization. In KDD, 2007.
20. T. S. Caetano, J. J. McAuley, L. Cheng, Q. V. Le, and A. J. Smola. Learning graph matching. IEEE Trans. on PAMI, 31(6):1048-1058, 2009.
21. A. M. Bronstein, M. M. Bronstein, A. M. Bruckstein, and R. Kimmel. Analysis of two-dimensional non-rigid shapes. International Journal of Computer Vision, 2007.
22. C. J. Yu and T. Joachims. Learning structural SVMs with latent variables. In ICML, 2009.
23. K. Mikolajczyk, B. Leibe, and B. Schiele. Multiple object class detection with a generative model. In CVPR, 2006.
24. F. Vikstén, P. Forssén, B. Johansson, and A. Moe. Comparison of local image descriptors for full 6 degree-of-freedom pose estimation. In ICRA, 2009.
25. Implementation of our method: http://users.cecs.anu.edu.au/~julianm/ Dataset sources: http://sampl.ece.ohio-state.edu/database.htm http://tosca.cs.technion.ac.il http://vasc.ri.cmu.edu/idb/html/motion/ http://www.cvl.isy.liu.se/research/objrec/posedb/.