메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Fast matching of planar shapes in sub-cubic runtime

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; COMPUTER VISION; GRAPH THEORY; IMAGE PROCESSING;

EID: 50649087784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2007.4409018     Document Type: Conference Paper
Times cited : (41)

References (13)
  • 2
    • 0031875453 scopus 로고    scopus 로고
    • Determining the similarity of deformable shapes
    • R. Basri, L. Costa, D. Geiger, and D. Jacobs. Determining the similarity of deformable shapes. Vision Research, 38:2365-2385, 1998.
    • (1998) Vision Research , vol.38 , pp. 2365-2385
    • Basri, R.1    Costa, L.2    Geiger, D.3    Jacobs, D.4
  • 3
    • 0003787146 scopus 로고
    • Princeton University Press, Princeton, New Jersey
    • R. E. Bellman. Dynamic Programming. Princeton University Press, Princeton, New Jersey, 1957.
    • (1957) Dynamic Programming
    • Bellman, R.E.1
  • 5
    • 0033325120 scopus 로고    scopus 로고
    • Flexible syntactic matching of curves and its application to automatic hierarchical classication of silhouettes
    • Y. Gdalyahu and D. Weinshall. Flexible syntactic matching of curves and its application to automatic hierarchical classication of silhouettes. IEEE PAMI, 21(12):1312-1328, 1999.
    • (1999) IEEE PAMI , vol.21 , Issue.12 , pp. 1312-1328
    • Gdalyahu, Y.1    Weinshall, D.2
  • 6
    • 0029276322 scopus 로고
    • Dynamic programming for detecting, tracking and matching deformable contours
    • D. Geiger, A. Gupta, L. Costa, and J. Vlontzos. Dynamic programming for detecting, tracking and matching deformable contours. IEEE PAMI, 17(3):294-302, 1995.
    • (1995) IEEE PAMI , vol.17 , Issue.3 , pp. 294-302
    • Geiger, D.1    Gupta, A.2    Costa, L.3    Vlontzos, J.4
  • 7
    • 0025437146 scopus 로고
    • On a cyclic string-to-string correction problem
    • M. Maes. On a cyclic string-to-string correction problem. Inf. Process. Lett., 35(2):73-78, 1990.
    • (1990) Inf. Process. Lett , vol.35 , Issue.2 , pp. 73-78
    • Maes, M.1
  • 8
    • 0025796537 scopus 로고
    • Polygonal shape recognition using string-matching techniques
    • M. Maes. Polygonal shape recognition using string-matching techniques. Pattern Recognition, 24(5):433-440, 1991.
    • (1991) Pattern Recognition , vol.24 , Issue.5 , pp. 433-440
    • Maes, M.1
  • 11
    • 38149064507 scopus 로고    scopus 로고
    • Efficient shape matching via graph cuts
    • EMMCVPR, of, Springer, August
    • F. R. Schmidt, E. Töppe, D. Cremers, and Y. Boykov. Efficient shape matching via graph cuts. In EMMCVPR, volume 4679 of LNCS, pages 39-54. Springer, August 2007.
    • (2007) LNCS , vol.4679 , pp. 39-54
    • Schmidt, F.R.1    Töppe, E.2    Cremers, D.3    Boykov, Y.4
  • 12


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