메뉴 건너뛰기




Volumn 3115, Issue , 2004, Pages 464-472

A Graph Edit Distance Based on Node Merging

Author keywords

[No Author keywords available]

Indexed keywords

MERGING;

EID: 35048858964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27814-6_55     Document Type: Article
Times cited : (15)

References (13)
  • 1
    • 84949879723 scopus 로고    scopus 로고
    • Recent Developments in Graph Matching
    • Barcelona, Spain, Sep.3-7
    • H. Bunke. "Recent Developments in Graph Matching". In Proc. 15th Int. Conference on Pattern Recognition (Barcelona, Spain, Sep.3-7), vol. 2, 2000, 117-124.
    • (2000) Proc. 15th Int. Conference on Pattern Recognition , vol.2 , pp. 117-124
    • Bunke, H.1
  • 2
    • 0016870630 scopus 로고
    • An Algorithm for Subgraph Isomorphism
    • N.I
    • J. Ullman. "An Algorithm for Subgraph Isomorphism". Journal of the ACM. Vol.23, N.I, pp.31-42, 1976.
    • (1976) Journal of the ACM. , vol.23 , pp. 31-42
    • Ullman, J.1
  • 3
    • 35248891629 scopus 로고    scopus 로고
    • Graph Edit Distance with Node Splitting and Merging and its Application to Diatom Identification
    • GbRPR-03, LNCS 2726, York, UK, June 30 - July 2
    • R. Ambauen, S. Fischer, H. Bunke. "Graph Edit Distance with Node Splitting and Merging and its Application to Diatom Identification", In Proc. of Int. Workshop on Graph based Representations in Pattern Recognition, GbRPR-03, LNCS 2726, York, UK, June 30 - July 2, 2003, pp.95-106.
    • (2003) Proc. of Int. Workshop on Graph Based Representations in Pattern Recognition , pp. 95-106
    • Ambauen, R.1    Fischer, S.2    Bunke, H.3
  • 5
    • 0037408051 scopus 로고    scopus 로고
    • Matching graphs by pivoting
    • A. Massaro, M. Pelillo. "Matching graphs by pivoting". Pattern Recognition Letters, vol. 24, no. 8, pp.1099-1106, 2003.
    • (2003) Pattern Recognition Letters , vol.24 , Issue.8 , pp. 1099-1106
    • Massaro, A.1    Pelillo, M.2
  • 6
    • 35048896737 scopus 로고    scopus 로고
    • A New Algorithm for Inexact Graph Matching
    • August 11-15, 2002, Quebec City, Canada
    • A. Hlaoui, S. Wang. "A New Algorithm for Inexact Graph Matching". In Proc. 16th International Conference on Pattern Recognition (August 11-15, 2002, Quebec City, Canada), Vol.2, pp.465-468, 2002.
    • (2002) Proc. 16th International Conference on Pattern Recognition , vol.2 , pp. 465-468
    • Hlaoui S Wang, A.1
  • 9
    • 10044279924 scopus 로고    scopus 로고
    • Inexact Graph Matching Using Stochastic Optimization Techniques for Facial Feature Recognition
    • August 11-15,2002, Quebec City, Canada
    • R. Cesar, E. Bengoetxea, I. Bloch. "Inexact Graph Matching Using Stochastic Optimization Techniques for Facial Feature Recognition". In Proc. 16th International Conference on Pattern Recognition (August 11-15,2002, Quebec City, Canada), Vol.2, pp.465-468, 2002.
    • (2002) Proc. 16th International Conference on Pattern Recognition , vol.2 , pp. 465-468
    • Cesar, R.1    Bengoetxea, E.2    Bloch, I.3
  • 12
    • 0032167014 scopus 로고    scopus 로고
    • Visual Querying by Color Perceptive Regions
    • A. Del Bimbo, M. Mugnaini, P. Pala, and F. Turco. "Visual Querying by Color Perceptive Regions", Pattern Recognition, vol.31, n.9 pp.1241-1253, 1998.
    • (1998) Pattern Recognition , vol.31 , Issue.9 , pp. 1241-1253
    • Del Bimbo, A.1    Mugnaini, M.2    Pala, P.3    Turco, F.4


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