메뉴 건너뛰기




Volumn 72, Issue 3, 2007, Pages 259-285

Discovering shape classes using tree edit-distance and pairwise clustering

Author keywords

Edit distance; Pairwise clustering; Shape recognition; Shock trees

Indexed keywords

DATA STRUCTURES; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; MATRIX ALGEBRA; STATISTICS; TREES (MATHEMATICS);

EID: 33846221964     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-006-8929-y     Document Type: Article
Times cited : (39)

References (52)
  • 2
    • 3142669879 scopus 로고
    • Subgraph isomorphism, matching relational structures and maximal cliques
    • Barrow, H.G. and Burstall, R.M. 1976. Subgraph isomorphism, matching relational structures and maximal cliques. Inf. Proc. Letter, 4:83-84.
    • (1976) Inf. Proc. Letter , vol.4 , pp. 83-84
    • Barrow, H.G.1    Burstall, R.M.2
  • 3
    • 0015581337 scopus 로고
    • Biological shape and visual science (Part I)
    • Blum, H. 1973. Biological shape and visual science (Part I). Journal of theoretical Biology, 38:205-287.
    • (1973) Journal of theoretical Biology , vol.38 , pp. 205-287
    • Blum, H.1
  • 4
    • 0000263874 scopus 로고    scopus 로고
    • Approximating the maximum weight clique using replicator dynamics
    • Bomze, I.M., Pelillo, M., and Stix, V. 2000. Approximating the maximum weight clique using replicator dynamics. IEEE Trans. on Neural Networks, vol. 11.
    • (2000) IEEE Trans. on Neural Networks , vol.11
    • Bomze, I.M.1    Pelillo, M.2    Stix, V.3
  • 5
    • 84944254235 scopus 로고    scopus 로고
    • Divergence-based medial surfaces
    • Computer Vision ECCV 2000, Springer
    • Bouix, S. and Siddiqi, K. 2000. Divergence-based medial surfaces. In Computer Vision ECCV 2000, Springer, LNCS 1842, pp. 603-618.
    • (2000) LNCS 1842 , pp. 603-618
    • Bouix, S.1    Siddiqi, K.2
  • 6
    • 0001699291 scopus 로고
    • Training stochastic model recognition algorithms as networks can lead to maximum mutual information estimation of parameters
    • San Mateo, CA: Morgan Kaufmann, pp
    • Bridle, J. S. 1990. Training stochastic model recognition algorithms as networks can lead to maximum mutual information estimation of parameters. In Advances in Neural Information Processing Systems 2, San Mateo, CA: Morgan Kaufmann, pp. 211-217.
    • (1990) Advances in Neural Information Processing Systems 2 , pp. 211-217
    • Bridle, J.S.1
  • 7
    • 0033893388 scopus 로고    scopus 로고
    • Mean and maximum common subgraph of two graphs
    • Bunke, H. and Kandel, A. 2000. Mean and maximum common subgraph of two graphs. Pattern Recognition Letters, 21:163-168.
    • (2000) Pattern Recognition Letters , vol.21 , pp. 163-168
    • Bunke, H.1    Kandel, A.2
  • 10
    • 1842506156 scopus 로고    scopus 로고
    • A similarity-based aspect-graph approach to 3D object recognition
    • Cyr, C.M. and Kimia, B.B. 2004. A similarity-based aspect-graph approach to 3D object recognition. International Journal of Computer Vision, 57(1):5-22.
    • (2004) International Journal of Computer Vision , vol.57 , Issue.1 , pp. 5-22
    • Cyr, C.M.1    Kimia, B.B.2
  • 14
    • 84939326991 scopus 로고
    • An image understanding system using attributed symbolic representation and inexact graph-matching
    • Eshera, M.A. and Fu, K.-S. 1986. An image understanding system using attributed symbolic representation and inexact graph-matching. IEEE Trans. Pattern Anal. Machine Intell., 8:604-618.
    • (1986) IEEE Trans. Pattern Anal. Machine Intell , vol.8 , pp. 604-618
    • Eshera, M.A.1    Fu, K.-S.2
  • 15
    • 0031268341 scopus 로고    scopus 로고
    • Factorial hidden markov models
    • Ghahramani, Z. and Jordan, M.I. 1997. Factorial hidden markov models. Machine Learning, 29:245-273.
    • (1997) Machine Learning , vol.29 , pp. 245-273
    • Ghahramani, Z.1    Jordan, M.I.2
  • 16
    • 0000966995 scopus 로고    scopus 로고
    • Continuous characterizations of the maximum clique problem
    • Gibbons, L.E. et al. 1997. Continuous characterizations of the maximum clique problem. Math. Oper. Res., 22:754-768.
    • (1997) Math. Oper. Res , vol.22 , pp. 754-768
    • Gibbons, L.E.1
  • 17
    • 0033285178 scopus 로고    scopus 로고
    • On the local form and transitions of symmetiy sets, medial axes, and shocks
    • Giblin, P.J. and Kimia, B.B. 1999. On the local form and transitions of symmetiy sets, medial axes, and shocks. In Proc. Int. Conf. Computer Vision, pp. 385-391.
    • (1999) Proc. Int. Conf. Computer Vision , pp. 385-391
    • Giblin, P.J.1    Kimia, B.B.2
  • 21
    • 0042418434 scopus 로고    scopus 로고
    • A tree-edit-distance algorithm for comparing simple, closed shapes
    • Klein, P. et al. 1999. A tree-edit-distance algorithm for comparing simple, closed shapes. In ACM-SIAM Symp. on Disc.e Alg.
    • (1999) ACM-SIAM Symp. on Disc.e Alg
    • Klein, P.1
  • 22
    • 35248834550 scopus 로고    scopus 로고
    • EM Algorithm for Clustering and ensemble of graphs with comb matching
    • Lozano, M. and Escolano, F. 2003. EM Algorithm for Clustering and ensemble of graphs with comb matching. EMMVCPR, Lecture Notes in Computer Science, vol. 2683, pp. 52-67.
    • (2003) EMMVCPR, Lecture Notes in Computer Science , vol.2683 , pp. 52-67
    • Lozano, M.1    Escolano, F.2
  • 24
    • 0000230999 scopus 로고
    • Maxima for graphs and a new proof of a theorem of Turán
    • Motzkin, T.S. and Straus, E.G. 1965. Maxima for graphs and a new proof of a theorem of Turán. Canadian Journal of Mathematics, 17:533-540.
    • (1965) Canadian Journal of Mathematics , vol.17 , pp. 533-540
    • Motzkin, T.S.1    Straus, E.G.2
  • 25
    • 0342973213 scopus 로고    scopus 로고
    • Combinatorial search vs. genetic algorithms: A case study based on the generalized median graph problem
    • Munger, A., Bunke, H., and Jiang, X. 1999. Combinatorial search vs. genetic algorithms: A case study based on the generalized median graph problem. Pattern Recognition Letters, 20(11-13):1271-1279.
    • (1999) Pattern Recognition Letters , vol.20 , Issue.11-13 , pp. 1271-1279
    • Munger, A.1    Bunke, H.2    Jiang, X.3
  • 26
    • 0042418430 scopus 로고
    • A multiscale mat from voronoi diagrams: The skeleton-space and its application to shape description and decomposition
    • Ogniewicz, R.L. 1994. A multiscale mat from voronoi diagrams: the skeleton-space and its application to shape description and decomposition. In Aspects of Visual Form Processing, pp. 430-439.
    • (1994) Aspects of Visual Form Processing , pp. 430-439
    • Ogniewicz, R.L.1
  • 29
    • 0345414100 scopus 로고    scopus 로고
    • Dominant sets and hierarchical clustering
    • Pavan, M. and Pelillo, M. 2003. Dominant sets and hierarchical clustering. In Proc. Int. Conf. Computer Vision, vol. I, pp. 362-369.
    • (2003) Proc. Int. Conf. Computer Vision , vol.1 , pp. 362-369
    • Pavan, M.1    Pelillo, M.2
  • 30
    • 0031246228 scopus 로고    scopus 로고
    • The dynamics of relaxation labeling process
    • Pelillo, M. 1997. The dynamics of relaxation labeling process, J. Math. Imaging Vision, 7:309-323.
    • (1997) J. Math. Imaging Vision , vol.7 , pp. 309-323
    • Pelillo, M.1
  • 31
    • 0033570815 scopus 로고    scopus 로고
    • Replicator equations, maximal cliques, and graph isomorphism
    • Pelillo, M. 1999. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11:1935-1955.
    • (1999) Neural Computation , vol.11 , pp. 1935-1955
    • Pelillo, M.1
  • 33
    • 33646399997 scopus 로고    scopus 로고
    • Payoff-monotonic game dynamics and the maximum clique problem
    • Pelillo, M. and Torsello, A. 2006. Payoff-monotonic game dynamics and the maximum clique problem. Neural Computation, 18:1215-1258.
    • (2006) Neural Computation , vol.18 , pp. 1215-1258
    • Pelillo, M.1    Torsello, A.2
  • 35
    • 0000826845 scopus 로고
    • An analysis of a good algorithm for the subtree problem
    • Reyner, S.W. 1977. An analysis of a good algorithm for the subtree problem. SIAM Journal on Computing, 6:730-732.
    • (1977) SIAM Journal on Computing , vol.6 , pp. 730-732
    • Reyner, S.W.1
  • 36
    • 0032309007 scopus 로고    scopus 로고
    • Genetic operators for hierarchical graph clustering
    • Rizzi, S. 1998. Genetic operators for hierarchical graph clustering. Pattern Recognition Letters, 19:1293-1300.
    • (1998) Pattern Recognition Letters , vol.19 , pp. 1293-1300
    • Rizzi, S.1
  • 37
    • 0032121920 scopus 로고    scopus 로고
    • Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors
    • Sarkar, S. and Boyer, K.L. 1998. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. Computer Vision and Image Understanding, 71(1):110-136.
    • (1998) Computer Vision and Image Understanding , vol.71 , Issue.1 , pp. 110-136
    • Sarkar, S.1    Boyer, K.L.2
  • 48
    • 0037408246 scopus 로고    scopus 로고
    • Computing approximate tree edit distance using relaxation labelling
    • Torsello, A. and Hancock, E.R. 2003. Computing approximate tree edit distance using relaxation labelling. Pattern Recognition Letters, 24:1089-1097.
    • (2003) Pattern Recognition Letters , vol.24 , pp. 1089-1097
    • Torsello, A.1    Hancock, E.R.2
  • 52
    • 0018732476 scopus 로고
    • Error-correcting isomorphism of attributed relational graphs for pattern analysis
    • Tsai, W.H. and Fu, K.S. 1979. Error-correcting isomorphism of attributed relational graphs for pattern analysis. IEEE Transactions on Systems, Man and Cybernetics, 9:757-768.
    • (1979) IEEE Transactions on Systems, Man and Cybernetics , vol.9 , pp. 757-768
    • Tsai, W.H.1    Fu, K.S.2


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