메뉴 건너뛰기




Volumn , Issue , 2007, Pages 775-780

Matching relational structures using the edge-association graph

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; IMAGE ANALYSIS; IMAGE PROCESSING; PATTERN RECOGNITION;

EID: 48149101237     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIAP.2007.4362870     Document Type: Conference Paper
Times cited : (4)

References (17)
  • 1
    • 0016522062 scopus 로고
    • A versatile computer-controlled assembly system
    • Stanford, CA
    • A. R Ambler et al. "A versatile computer-controlled assembly system." In Proc. 3rd IJCAI, Stanford, CA, 1973.
    • (1973) Proc. 3rd IJCAI
    • Ambler, A.R.1
  • 2
    • 3142669879 scopus 로고
    • Subgraph isomorphism, matching relational structures and maximal cliques
    • H. G. Barrow and R. M. Burstall, "Subgraph isomorphism, matching relational structures and maximal cliques." Information Processing Letters, 4:83-84, 1976.
    • (1976) Information Processing Letters , vol.4 , pp. 83-84
    • Barrow, H.G.1    Burstall, R.M.2
  • 3
    • 0141668007 scopus 로고    scopus 로고
    • Reactive local search for the maximum clique problem
    • R. Battiti and M. Protasi, "Reactive local search for the maximum clique problem." Algorithmica, 29(4):610-637, 2001.
    • (2001) Algorithmica , vol.29 , Issue.4 , pp. 610-637
    • Battiti, R.1    Protasi, M.2
  • 8
    • 0029344326 scopus 로고
    • Shapes, shocks, and deformations I: The components of shape and the reaction-diffusion space
    • B. B. Kimia, A. R. Tannenbaum, and S. W. Zucker, "Shapes, shocks, and deformations I: the components of shape and the reaction-diffusion space." Int. J. Computer Vision. 15(3): 189-224, 1995.
    • (1995) Int. J. Computer Vision , vol.15 , Issue.3 , pp. 189-224
    • Kimia, B.B.1    Tannenbaum, A.R.2    Zucker, S.W.3
  • 10
    • 0033570815 scopus 로고    scopus 로고
    • Replicator equations, maximal cliques, and graph isomorphism
    • M. Pelillo, "Replicator equations, maximal cliques, and graph isomorphism." Neural Computation, 11:1935-1955, 1999.
    • (1999) Neural Computation , vol.11 , pp. 1935-1955
    • Pelillo, M.1
  • 17
    • 0001858630 scopus 로고    scopus 로고
    • A constrained edit-distance between unordered labeled trees
    • K. Zhang. "A constrained edit-distance between unordered labeled trees," Algorithmica, 15(3):205-222, 1996.
    • (1996) Algorithmica , vol.15 , Issue.3 , pp. 205-222
    • Zhang, K.1


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