메뉴 건너뛰기




Volumn 4538 LNCS, Issue , 2007, Pages 114-125

Comparing sets of 3D digital shapes through topological structures

Author keywords

Graph matching; Scene comparison; Shape retrieval; Structural descriptor

Indexed keywords

GRAPH THEORY; SET THEORY; THREE DIMENSIONAL; VIRTUAL REALITY;

EID: 38149137335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72903-7_11     Document Type: Conference Paper
Times cited : (4)

References (19)
  • 2
    • 84905856685 scopus 로고    scopus 로고
    • A shape abstraction paradigm for modeling geometry and semantics
    • Falcidieno, B., Spagnuolo, M.: A shape abstraction paradigm for modeling geometry and semantics. In: Computer Graphics International, pp. 646-657 (1998)
    • (1998) Computer Graphics International , pp. 646-657
    • Falcidieno, B.1    Spagnuolo, M.2
  • 4
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19, 255-259 (1998)
    • (1998) Pattern Recognition Letters , vol.19 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 5
    • 0035339250 scopus 로고    scopus 로고
    • A graph distance metric combining maximum common subgraph and minimum common supergraph
    • Fernández, M.L., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters 22, 753-758 (2001)
    • (2001) Pattern Recognition Letters , vol.22 , pp. 753-758
    • Fernández, M.L.1    Valiente, G.2
  • 6
    • 24644438781 scopus 로고    scopus 로고
    • Marini, S., Spagnuolo, M., Falcidieno, B.: From exact to approximate maximum common subgraph. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, 3434, pp. 263-272. Springer, Heidelberg (2005)
    • Marini, S., Spagnuolo, M., Falcidieno, B.: From exact to approximate maximum common subgraph. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 263-272. Springer, Heidelberg (2005)
  • 8
    • 38149016273 scopus 로고    scopus 로고
    • Graph matching using adjacency matrix Markov chains
    • University of Manchester, Manchester, UK, pp
    • Robles-Kelly, A., Hancock, E.R.: Graph matching using adjacency matrix Markov chains. In: The British Machine Vision Conference, University of Manchester, Manchester, UK, pp. 383-390 (2001)
    • (2001) The British Machine Vision Conference , pp. 383-390
    • Robles-Kelly, A.1    Hancock, E.R.2
  • 10
    • 27644585928 scopus 로고    scopus 로고
    • Distance matrix and Laplacian of a tree with attached graphs
    • Bapat, R.B.: Distance matrix and Laplacian of a tree with attached graphs. Linear Algebra and its Applications 411, 295-308 (2005)
    • (2005) Linear Algebra and its Applications , vol.411 , pp. 295-308
    • Bapat, R.B.1
  • 14
    • 0029537981 scopus 로고
    • Polyhedral object recognition by indexing
    • Horaud, R., Sossa, H.: Polyhedral object recognition by indexing. Pattern Recognition 28(12), 1855-1870 (1995)
    • (1995) Pattern Recognition , vol.28 , Issue.12 , pp. 1855-1870
    • Horaud, R.1    Sossa, H.2
  • 16
    • 0004132473 scopus 로고
    • Dover Publications, Mineola, NY
    • Franklin, J.N.: Matrix theory. Dover Publications, Mineola, NY (1993)
    • (1993) Matrix theory
    • Franklin, J.N.1


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