메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Matching images under unstable segmentations

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER VISION; FEATURE EXTRACTION; IMAGE ENHANCEMENT; IMAGE PROCESSING; IMAGE SEGMENTATION; KETONES; MATRIX ALGEBRA; PATTERN RECOGNITION; STANDARDS;

EID: 51949094193     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587759     Document Type: Conference Paper
Times cited : (33)

References (20)
  • 1
    • 50649123565 scopus 로고    scopus 로고
    • Learning the taxonomy and models of categories present in arbitrary images
    • N. Ahuja and S. Todorovic. Learning the taxonomy and models of categories present in arbitrary images. In Proc. of IEEE Intl. Conf. on Comp. Vis, 2007.
    • (2007) Proc. of IEEE Intl. Conf. on Comp. Vis
    • Ahuja, N.1    Todorovic, S.2
  • 3
    • 84944391911 scopus 로고    scopus 로고
    • Robust computer vision through kernel density estimation
    • London, UK, Springer-Verlag
    • H. Chen and P. Meer. Robust computer vision through kernel density estimation. In Proc. of 7th Euro. Conf. on Comp. Vis., pages 236-250, London, UK, 2002. Springer-Verlag.
    • (2002) Proc. of 7th Euro. Conf. on Comp. Vis , pp. 236-250
    • Chen, H.1    Meer, P.2
  • 6
    • 0345377801 scopus 로고    scopus 로고
    • Robust registration of 2d and 3d point sets
    • A. W. Fitzgibbon. Robust registration of 2d and 3d point sets. Image Vision Comput., 21(13-14):1145-1153, 2003.
    • (2003) Image Vision Comput , vol.21 , Issue.13-14 , pp. 1145-1153
    • Fitzgibbon, A.W.1
  • 8
    • 0035481623 scopus 로고    scopus 로고
    • Symbol recognition by error-tolerant subgraph matching between region adjacency graphs
    • E. M. J Llados and J. Villanueva. Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. In IEEE Trans. Patt. Anal. and Machine Intell., pages 1137-1143, 2001.
    • (2001) IEEE Trans. Patt. Anal. and Machine Intell , pp. 1137-1143
    • Llados, E.M.J.1    Villanueva, J.2
  • 10
    • 84949969441 scopus 로고    scopus 로고
    • What energy functions can be minimized via graph cuts?
    • V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? In ECCV (3), pages 65-81, 2002.
    • (2002) ECCV , vol.3 , pp. 65-81
    • Kolmogorov, V.1    Zabih, R.2
  • 12
    • 0002425879 scopus 로고    scopus 로고
    • Loopy belief propagation for approximate inference: An empirical study
    • K. P. Murphy, Y. Weiss, and M. I. Jordan. Loopy belief propagation for approximate inference: An empirical study. In Proc. of Uncertainty in AI'99, pages 467-475, 2009.
    • (2009) Proc. of Uncertainty in AI'99 , pp. 467-475
    • Murphy, K.P.1    Weiss, Y.2    Jordan, M.I.3
  • 13
    • 84957585214 scopus 로고    scopus 로고
    • Many-to-many matching of attributed trees using association graphs and game dynamics
    • M. Pelillo, K. Siddiqi, and S. W. Zucker. Many-to-many matching of attributed trees using association graphs and game dynamics. In IWVF, pages 583-593, 2001.
    • (2001) IWVF , pp. 583-593
    • Pelillo, M.1    Siddiqi, K.2    Zucker, S.W.3
  • 15
    • 84932610882 scopus 로고    scopus 로고
    • Robust registration and tracking using kernel density correlation
    • M. Singh, H. Arora, and N. Ahuja. Robust registration and tracking using kernel density correlation. In Proc. of CVPRW'04, page 174, 2004.
    • (2004) Proc. of CVPRW'04 , pp. 174
    • Singh, M.1    Arora, H.2    Ahuja, N.3
  • 16
    • 0037408246 scopus 로고    scopus 로고
    • Computing approximate tree edit distance using relaxation labeling
    • A. Torsello and E. R. Hancock. Computing approximate tree edit distance using relaxation labeling. Pattern Recognition Letters, 24(8):1089-1097, 2003.
    • (2003) Pattern Recognition Letters , vol.24 , Issue.8 , pp. 1089-1097
    • Torsello, A.1    Hancock, E.R.2
  • 18
    • 0029215675 scopus 로고
    • Region correspondence by inexact attributed planar graph matching
    • C. Wang and K. Abe. Region correspondence by inexact attributed planar graph matching. In Proc. of Intl. Conf. on Comp. Vis., pages 440-447, 1995.
    • (1995) Proc. of Intl. Conf. on Comp. Vis , pp. 440-447
    • Wang, C.1    Abe, K.2
  • 19
    • 33745868744 scopus 로고    scopus 로고
    • Simultaneous nonrigid registration of multiple point sets and atlas construction
    • F. Wang, B. C. Vemuri, A. Rangarajan, I. M. Schmalfuss, and S. J. Eisenschenk. Simultaneous nonrigid registration of multiple point sets and atlas construction. In ECCV (3), pages 551-563, 2006.
    • (2006) ECCV , vol.3 , pp. 551-563
    • Wang, F.1    Vemuri, B.C.2    Rangarajan, A.3    Schmalfuss, I.M.4    Eisenschenk, S.J.5


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