메뉴 건너뛰기




Volumn , Issue , 2009, Pages 864-871

Unsupervised learning for graph matching

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; GRAPH ALGORITHMS; PATTERN MATCHING; UNSUPERVISED LEARNING;

EID: 70450202680     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2009.5206533     Document Type: Conference Paper
Times cited : (35)

References (18)
  • 1
    • 21944432091 scopus 로고    scopus 로고
    • Learning spectral clustering
    • F. Bach and M. Jordan. Learning spectral clustering. In NIPS, 2003.
    • (2003) NIPS
    • Bach, F.1    Jordan, M.2
  • 2
    • 0036538619 scopus 로고    scopus 로고
    • Shape matching and object recognition using shape context
    • April
    • S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape context. PAMI, 24(4):509- 522, April 2002.
    • (2002) PAMI , vol.24 , Issue.4 , pp. 509-522
    • Belongie, S.1    Malik, J.2    Puzicha., J.3
  • 3
    • 34948843661 scopus 로고    scopus 로고
    • Shape matching and object recognition using low distortion correspondences
    • A. Berg, T. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. In ECCV, 2006.
    • (2006) ECCV
    • Berg, A.1    Berg, T.2    Malik, J.3
  • 8
    • 0030125842 scopus 로고    scopus 로고
    • A graduated assignment algorithm for graph matching
    • S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. In PAMI, 1996.
    • (1996) PAMI
    • Gold, S.1    Rangarajan, A.2
  • 9
    • 51949105707 scopus 로고    scopus 로고
    • Unsupervised modeling of object categories using link analysis techniques
    • G. Kim, C. Faloutsos, and M. Hebert. Unsupervised modeling of object categories using link analysis techniques. In CVPR, 2008.
    • (2008) CVPR
    • Kim, G.1    Faloutsos, C.2    Hebert, M.3
  • 10
    • 33745886518 scopus 로고    scopus 로고
    • A spectral technique for correspondence problems using pairwise constraints
    • M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, 2005.
    • (2005) ICCV
    • Leordeanu, M.1    Hebert, M.2
  • 11
    • 51949119460 scopus 로고    scopus 로고
    • Smoothing-based optimization
    • M. Leordeanu and M. Hebert. Smoothing-based optimization. In CVPR, 2008.
    • (2008) CVPR
    • Leordeanu, M.1    Hebert, M.2
  • 12
    • 34948887733 scopus 로고    scopus 로고
    • Beyond local appearance: Category recognition from pairwise interactions of simple features
    • M. Leordeanu, M. Hebert, and R. Sukthankar. Beyond local appearance: Category recognition from pairwise interactions of simple features. In CVPR, 2007.
    • (2007) CVPR
    • Leordeanu, M.1    Hebert, M.2    Sukthankar, R.3
  • 13
    • 34948894982 scopus 로고    scopus 로고
    • Unsupervised learning of hierarchical semantics of objects
    • D. Parikh and T. Chen. Unsupervised learning of hierarchical semantics of objects. In CVPR, 2007.
    • (2007) CVPR
    • Parikh, D.1    Chen, T.2
  • 14
    • 34948832124 scopus 로고    scopus 로고
    • Learning and matching line aspects for articulated objects
    • X. Ren. Learning and matching line aspects for articulated objects. In CVPR, 2007.
    • (2007) CVPR
    • Ren, X.1
  • 15
    • 58049210354 scopus 로고    scopus 로고
    • Probabilistic subgraph matching based on convex relaxation
    • C. Schellewald and C. Schnorr. Probabilistic subgraph matching based on convex relaxation. In EMMCVPR, 2005.
    • (2005) EMMCVPR
    • Schellewald, C.1    Schnorr, C.2
  • 16
    • 45149116218 scopus 로고    scopus 로고
    • Solving markov random fields using semi definite programming
    • P. Torr. Solving markov random fields using semi definite programming. In AIS, 2003.
    • (2003) AIS
    • Torr, P.1
  • 18
    • 51949115377 scopus 로고    scopus 로고
    • Probabilistic graph and hypergraph matching
    • R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. In CVPR, 2008.
    • (2008) CVPR
    • Zass, R.1    Shashua, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.