메뉴 건너뛰기




Volumn 2396, Issue , 2002, Pages 263-271

Successive projection graph matching

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; GRAPH ALGORITHMS; IMAGE ENHANCEMENT; SET THEORY; SYNTACTICS;

EID: 84951801656     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70659-3_27     Document Type: Conference Paper
Times cited : (5)

References (23)
  • 2
    • 0021599330 scopus 로고
    • An Algorithm for Graph Optimal Isomorphism
    • You, M., Wong, K. C.: An Algorithm for Graph Optimal Isomorphism, Proc. ICPR. (1984) 316-319
    • (1984) Proc. ICPR , pp. 316-319
    • You, M.1    Wong, K.C.2
  • 3
    • 0018732476 scopus 로고    scopus 로고
    • Error-Correcting Isomorphisms of Attributed Relation Graphs for Pattern Recognition
    • Tsai, W.-H., Fu, K.-S.: Error-Correcting Isomorphisms of Attributed Relation Graphs for Pattern Recognition, IEEE Trans. Syst. Man Cybern., Vol. 9 (1997) 757-768
    • (1997) IEEE Trans. Syst. Man Cybern , vol.9 , pp. 757-768
    • Tsai, W.-H.1    Fu, K.-S.2
  • 4
    • 0020497981 scopus 로고
    • Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition
    • Tsai, W.-H., Fu, K.-S.: Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition, IEEE Trans. Systems, Man, Cybernetics, Vol. 13 (1983) 48-62
    • (1983) IEEE Trans. Systems, Man, Cybernetics , vol.13 , pp. 48-62
    • Tsai, W.-H.1    Fu, K.-S.2
  • 5
    • 0030165138 scopus 로고    scopus 로고
    • Graph Matching using a Direct Classification of Node Attendance
    • Depiero, F., Trived, M., Serbin, S.: Graph Matching using a Direct Classification of Node Attendance, Pattern Recognition, Vol. 29, No. 6, (1996) 1031-1048
    • (1996) Pattern Recognition , vol.29 , Issue.6 , pp. 1031-1048
    • Depiero, F.1    Trived, M.2    Serbin, S.3
  • 7
    • 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, Vol. 19 (1998) 255-259
    • (1998) Pattern Recognition Letters , vol.19 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 10
    • 0026137105 scopus 로고
    • Polynomial Transform for Matching Pairs of Weighted Graphs
    • Almohamad, H. A. L.: Polynomial Transform for Matching Pairs of Weighted Graphs, Appl. Math. Modelling, Vol. 15, No. 4 (1991) 216-222
    • (1991) Appl. Math. Modelling , vol.15 , Issue.4 , pp. 216-222
    • Almohamad, H.1
  • 11
    • 0024069925 scopus 로고
    • An Eigendecomposition Approach to Weighted Graph Matching Problems
    • Umeyama, S.: An Eigendecomposition Approach to Weighted Graph Matching Problems, IEEE Trans. Patt. Anal. Machine Intell., Vol. 10, No. 5 (1988) 695-703
    • (1988) IEEE Trans. Patt. Anal. Machine Intell , vol.10 , Issue.5 , pp. 695-703
    • Umeyama, S.1
  • 12
    • 0031170384 scopus 로고    scopus 로고
    • Inexact Matching Using Genetic Search
    • Cross, A. D. J., Wilson, C., Hancock, E. R.: Inexact Matching Using Genetic Search, Pattern Recognition, Vol. 30, No. 6 (1997) 953-970
    • (1997) Pattern Recognition , vol.30 , Issue.6 , pp. 953-970
    • Cross, A.1    Wilson, C.2    Hancock, E.R.3
  • 13
    • 0032210116 scopus 로고    scopus 로고
    • Symbolic Matching with the EM Algorithm
    • Finch, A. M., Wilson, R. C., Hancock, R.: Symbolic Matching with the EM Algorithm, Pattern Recognition, Vol. 31, No. 11 (1998) 1777-1790
    • (1998) Pattern Recognition , vol.31 , Issue.11 , pp. 1777-1790
    • Finch, A.M.1    Wilson, R.C.2    Hancock, R.3
  • 15
    • 0032205635 scopus 로고    scopus 로고
    • Graph Matching with a Dual Step EM Algorithm
    • Cross, A. D. J., Hancock, E. R.: Graph Matching with a Dual Step EM Algorithm, IEEE Trans. Patt. Anal. Machine Intell., Vol. 20, No. 11 (1998) 1236-1253
    • (1998) IEEE Trans. Patt. Anal. Machine Intell , vol.20 , Issue.11 , pp. 1236-1253
    • Cross, A.1    Hancock, E.R.2
  • 16
    • 0029668281 scopus 로고    scopus 로고
    • A Bayesian Compatibility Model for Graph Matching
    • Wilson, R. C., Hancock, E. R.: A Bayesian Compatibility Model for Graph Matching, Pattern Recognition Letters, Vol. 17 (1996) 263-276.
    • (1996) Pattern Recognition Letters , vol.17 , pp. 263-276
    • Wilson, R.C.1    Hancock, E.R.2
  • 17
    • 0020750605 scopus 로고
    • On the Foundations of Relaxation Labelling Processes
    • Hummel, R. A., Zucker, S. W.: On the Foundations of Relaxation Labelling Processes, IEEE Trans. Patt. Anal. Machine Intell., Vol. 5, No. 3 (1983) 267-286
    • (1983) IEEE Trans. Patt. Anal. Machine Intell , vol.5 , Issue.3 , pp. 267-286
    • Hummel, R.A.1    Zucker, S.W.2
  • 18
    • 0019688549 scopus 로고
    • Semantic Description of Aerial Images Using Stochastic Labeling
    • Faugeras, O. D., Price, K. E.: Semantic Description of Aerial Images Using Stochastic Labeling, IEEE Trans. Patt. Anal. Machine Intell., Vol. 3, No. 6 (1981) 633-642
    • (1981) IEEE Trans. Patt. Anal. Machine Intell , vol.3 , Issue.6 , pp. 633-642
    • Faugeras, O.D.1    Price, K.E.2
  • 19
    • 0003386794 scopus 로고    scopus 로고
    • An Algorithm for Approximate Least-Squares Attributed Graph Matching
    • N. Mastorakis (ed.), World Science and Engineering Society Press
    • van Wyk, M. A., Clark, J.: An Algorithm for Approximate Least-Squares Attributed Graph Matching, in Problems in Applied Mathematics and Computational Intelligence, N. Mastorakis (ed.), World Science and Engineering Society Press, (2001) 67-72
    • (2001) Problems in Applied Mathematics and Computational Intelligence , pp. 67-72
    • van Wyk, M.A.1    Clark, J.2
  • 22
    • 0002605032 scopus 로고
    • Mathematical theory of image restoration by the method of convex projections, Chapter 2
    • H. Stark (ed.), Academic Press, Orlando, FL
    • Youla, D. C.: Mathematical theory of image restoration by the method of convex projections, Chapter 2, in Image Recovery: Theory and Applications, H. Stark (ed.), Academic Press, Orlando, FL (1987)
    • (1987) Image Recovery: Theory and Applications
    • Youla, D.C.1


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