메뉴 건너뛰기




Volumn 5807 LNCS, Issue , 2009, Pages 89-99

Attributed graph matching using local descriptions

Author keywords

[No Author keywords available]

Indexed keywords

AS GRAPH; ASSIGNMENT PROBLEMS; ATTRIBUTED GRAPH MATCHING; ATTRIBUTED GRAPHS; DISTANCE FORMULA; HUNGARIAN METHOD; LOCAL DESCRIPTION; OBJECTS RECOGNITION; OPTIMAL ASSIGNMENT;

EID: 70549098344     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04697-1_9     Document Type: Conference Paper
Times cited : (38)

References (22)
  • 2
    • 33745360257 scopus 로고    scopus 로고
    • Edit distance-based kernel functions for structural pattern classification
    • Neuhaus, M., Bunke, H.: Edit distance-based kernel functions for structural pattern classification. Pattern Recognition 39(10), 1852-1863 (2006)
    • (2006) Pattern Recognition , vol.39 , Issue.10 , pp. 1852-1863
    • Neuhaus, M.1    Bunke, H.2
  • 3
    • 64849091214 scopus 로고    scopus 로고
    • Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. (2008), doi:10.1016/j.imavis.2008.04.004
    • Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. (2008), doi:10.1016/j.imavis.2008.04.004
  • 4
    • 58349097731 scopus 로고    scopus 로고
    • IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
    • Riesen, K., Bunke, H.: IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning. In: IAPR Workshop SSPR & SPR, pp. 287-297 (2008)
    • (2008) IAPR Workshop SSPR & SPR , pp. 287-297
    • Riesen, K.1    Bunke, H.2
  • 6
    • 33745126452 scopus 로고    scopus 로고
    • A fast technique for comparing graph representations with applications to performance evaluation
    • Lopresti, D., Wilfong, G.: A fast technique for comparing graph representations with applications to performance evaluation. International Journal on Document Analysis and Recognition 6(4), 219-229 (2004)
    • (2004) International Journal on Document Analysis and Recognition , vol.6 , Issue.4 , pp. 219-229
    • Lopresti, D.1    Wilfong, G.2
  • 7
    • 22044453862 scopus 로고    scopus 로고
    • Shi, J., Malik, J.: Self Inducing Relational Distance and Its Application to Image Segmentation. In: Burkhardt, H.-J., Neumann, B. (eds.) ECCV 1998. LNCS, 1406, pp. 528-543. Springer, Heidelberg (1998)
    • Shi, J., Malik, J.: Self Inducing Relational Distance and Its Application to Image Segmentation. In: Burkhardt, H.-J., Neumann, B. (eds.) ECCV 1998. LNCS, vol. 1406, pp. 528-543. Springer, Heidelberg (1998)
  • 9
    • 70349317704 scopus 로고    scopus 로고
    • Jouili, S., Tabbone, S.: Graph matching using node signatures. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, 5534, pp. 154-163. Springer, Heidelberg (2009)
    • Jouili, S., Tabbone, S.: Graph matching using node signatures. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol. 5534, pp. 154-163. Springer, Heidelberg (2009)
  • 10
    • 0020752197 scopus 로고
    • A Distance Measure between Attributed Relational Graphs for Pattern Recognition
    • Sanfeliu, A., Fu, K.-S.: A Distance Measure between Attributed Relational Graphs for Pattern Recognition. IEEE Transactions on Systems, Man and Cybernetics 13, 353-362 (1983)
    • (1983) IEEE Transactions on Systems, Man and Cybernetics , vol.13 , pp. 353-362
    • Sanfeliu, A.1    Fu, K.-S.2
  • 11
    • 10044225470 scopus 로고    scopus 로고
    • A New Attributed Relational Graph Matching Algorithm Using the Nested Structure of Earth Mover's Distance
    • Kim, D.H., Yun, I.D., Lee, S.U.: A New Attributed Relational Graph Matching Algorithm Using the Nested Structure of Earth Mover's Distance. In: 17th International Conference on Pattern Recognition, pp. 48-51 (2004)
    • (2004) 17th International Conference on Pattern Recognition , pp. 48-51
    • Kim, D.H.1    Yun, I.D.2    Lee, S.U.3
  • 12
    • 0024069925 scopus 로고
    • An eigendecomposition approach to weighted graph matching problems
    • Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10(5), 695-703 (1988)
    • (1988) IEEE Trans. Pattern Anal. Mach. Intell , vol.10 , Issue.5 , pp. 695-703
    • Umeyama, S.1
  • 14
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2, 83-97 (1955)
    • (1955) Naval Research Logistic Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 17
    • 22944432498 scopus 로고    scopus 로고
    • Exact and Approximate graph matching using random walks
    • Gori, M., Maggini, M., Sarti, L.: Exact and Approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell. 27(7), 1100-1111 (2005)
    • (2005) IEEE Trans. Pattern Anal. Mach. Intell , vol.27 , Issue.7 , pp. 1100-1111
    • Gori, M.1    Maggini, M.2    Sarti, L.3
  • 18
    • 0030125842 scopus 로고    scopus 로고
    • A graduated assignment algorithm for graph matching
    • Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377-388 (1996)
    • (1996) IEEE Trans. Pattern Anal. Mach. Intell , vol.18 , Issue.4 , pp. 377-388
    • Gold, S.1    Rangarajan, A.2
  • 20
    • 0021432552 scopus 로고
    • A graph distance measure for image analysis
    • Eshera, M.A., Fu, K.S.: A graph distance measure for image analysis. IEEE Trans. Syst. Man Cybern. 14, 398-408 (1984)
    • (1984) IEEE Trans. Syst. Man Cybern , vol.14 , pp. 398-408
    • Eshera, M.A.1    Fu, K.S.2
  • 21
    • 0003840341 scopus 로고    scopus 로고
    • Columbia Object Image Library (COIL-100)
    • Technical report, Columbia Univ
    • Nene, S.A., Nayar, S.K., Murase, H.: Columbia Object Image Library (COIL-100), Technical report, Columbia Univ. (1996)
    • (1996)
    • Nene, S.A.1    Nayar, S.K.2    Murase, H.3


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