메뉴 건너뛰기




Volumn 115, Issue 7, 2011, Pages 962-975

Graph attribute embedding via Riemannian submersion learning

Author keywords

Graph embedding; Relational matching; Riemannian geometry

Indexed keywords

DATA SETS; DIGIT CLASSIFICATION; EMBEDDED GRAPHS; GRAPH EMBEDDINGS; GRAPH MATCHINGS; L2-NORM; METRIC SPACES; MPEG-7 DATABASE; NODE COORDINATES; POSTERIOR PROBABILITY; PROBABILITY DENSITY ESTIMATION; RELATIONAL MATCHING; RELATIONAL STRUCTURES; RIEMANNIAN GEOMETRY; SYNTHETIC DATA; TRUST-REGION METHODS;

EID: 79956101050     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2010.12.005     Document Type: Article
Times cited : (14)

References (66)
  • 1
    • 77954025716 scopus 로고    scopus 로고
    • Fundamentals of spherical parameterization for 3D meshes
    • C. Gotsman, X. Gu, and A. Sheffer Fundamentals of spherical parameterization for 3D meshes ACM Transactions on Graphics 22 3 2003 358 363
    • (2003) ACM Transactions on Graphics , vol.22 , Issue.3 , pp. 358-363
    • Gotsman, C.1    Gu, X.2    Sheffer, A.3
  • 2
    • 0003562364 scopus 로고    scopus 로고
    • Modern Multidimensional Scaling, Theory and Applications
    • Springer
    • I. Borg, and P. Groenen Modern Multidimensional Scaling, Theory and Applications Springer Series in Statistics 1997 Springer
    • (1997) Springer Series in Statistics
    • Borg, I.1    Groenen, P.2
  • 4
  • 7
    • 0034704229 scopus 로고    scopus 로고
    • A global geometric framework for nonlinear dimensionality reduction
    • DOI 10.1126/science.290.5500.2319
    • J.B. Tenenbaum, V. de Silva, and J.C. Langford A global geometric framework for nonlinear dimensionality reduction Science 290 5500 2000 2319 2323 (Pubitemid 32041577)
    • (2000) Science , vol.290 , Issue.5500 , pp. 2319-2323
    • Tenenbaum, J.B.1    De Silva, V.2    Langford, J.C.3
  • 8
    • 0034704222 scopus 로고    scopus 로고
    • Nonlinear dimensionality reduction by locally linear embedding
    • DOI 10.1126/science.290.5500.2323
    • S.T. Roweis, and L.K. Saul Nonlinear dimensionality reduction by locally linear embedding Science 290 2000 2323 2326 (Pubitemid 32041578)
    • (2000) Science , vol.290 , Issue.5500 , pp. 2323-2326
    • Roweis, S.T.1    Saul, L.K.2
  • 9
    • 84880203756 scopus 로고    scopus 로고
    • Laplacian eigenmaps and spectral techniques for embedding and clustering
    • M. Belkin, and P. Niyogi Laplacian eigenmaps and spectral techniques for embedding and clustering Neural Information Processing Systems 14 2002 634 640
    • (2002) Neural Information Processing Systems , Issue.14 , pp. 634-640
    • Belkin, M.1    Niyogi, P.2
  • 11
    • 0031233843 scopus 로고    scopus 로고
    • The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix
    • P. Torr, and D.W. Murray The development and comparison of robust methods for estimating the fundamental matrix International Journal of Computer Vision 24 1997 271 300 (Pubitemid 127506557)
    • (1997) International Journal of Computer Vision , vol.24 , Issue.3 , pp. 271-300
    • Torr, P.H.S.1    Murray, D.W.2
  • 12
    • 34548752768 scopus 로고
    • Feature-based correspondance-an eigenvector approach
    • L. Shapiro, and J.M. Brady Feature-based correspondance-an eigenvector approach Image and Vision Computing 10 1992 283 288
    • (1992) Image and Vision Computing , vol.10 , pp. 283-288
    • Shapiro, L.1    Brady, J.M.2
  • 13
    • 0017369438 scopus 로고
    • Filling in the gaps: The shape of subjective contours and a model for their generation
    • S. Ullman Filling in the gaps: the shape of subjective contours and a model for their generation Biological Cybernetics 25 1976 1 6
    • (1976) Biological Cybernetics , vol.25 , pp. 1-6
    • Ullman, S.1
  • 20
    • 0024069925 scopus 로고
    • An eigen decomposition approach to weighted graph matching problems
    • S. Umeyama An eigen decomposition approach to weighted graph matching problems PAMI 10 5 1988 695 703
    • (1988) PAMI , vol.10 , Issue.5 , pp. 695-703
    • Umeyama, S.1
  • 22
    • 0035481405 scopus 로고    scopus 로고
    • Structural graph matching using the em algorithm and singular value decomposition
    • DOI 10.1109/34.954602
    • Bin Luo, and E.R. Hancock Structural graph matching using the EM algorithm and singular value decomposition IEEE Transactions on Pattern Analysis and Machine Intelligence 23 10 2001 1120 1136 (Pubitemid 33047950)
    • (2001) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.23 , Issue.10 , pp. 1120-1136
    • Luo, B.1    Hancock, E.R.2
  • 23
    • 1842426385 scopus 로고    scopus 로고
    • An eigenspace projection clustering method for inexact graph matching
    • T.M. Caelli, and S. Kosinov An eigenspace projection clustering method for inexact graph matching PAMI 26 4 2004 515 519
    • (2004) PAMI , vol.26 , Issue.4 , pp. 515-519
    • Caelli, T.M.1    Kosinov, S.2
  • 24
    • 33751031562 scopus 로고    scopus 로고
    • A Riemannian approach to graph embedding
    • DOI 10.1016/j.patcog.2006.05.031, PII S0031320306002421
    • A. Robles-Kelly, and E.R. Hancock A riemannian approach to graph embedding Pattern Recognition 40 3 2007 1042 1056 (Pubitemid 44755293)
    • (2007) Pattern Recognition , vol.40 , Issue.3 , pp. 1042-1056
    • Robles-Kelly, A.1    Hancock, E.R.2
  • 25
    • 0020752197 scopus 로고
    • Distance measure between attributed relational graphs for pattern recognition
    • A. Sanfeliu, and K.S. Fu A distance measure between attributed relational graphs for pattern recognition IEEE Transactions on Systems, Man and Cybernetics 13 1983 353 362 (Pubitemid 13591176)
    • (1983) IEEE Transactions on Systems, Man and Cybernetics , vol.SMC-13 , Issue.3 , pp. 353-362
    • Alberto, S.1    King-Sun, F.2
  • 28
    • 0034205923 scopus 로고    scopus 로고
    • Bayesian graph edit distance
    • R. Myers, R.C. Wilson, and E.R. Hancock Bayesian graph edit distance PAMI 22 6 2000 628 635
    • (2000) PAMI , vol.22 , Issue.6 , pp. 628-635
    • Myers, R.1    Wilson, R.C.2    Hancock, E.R.3
  • 29
    • 0004734437 scopus 로고    scopus 로고
    • Classes of Cost Functions for String Edit Distance
    • S.V. Rice, H. Bunke, and T.A. Nartker Classes of cost functions for string edit distance Algorithmica 18 1997 271 280 (Pubitemid 128434446)
    • (1998) Algorithmica (New York) , vol.18 , Issue.2 , pp. 271-280
    • Rice, S.V.1    Bunke, H.2    Nartker, T.A.3
  • 31
    • 0024771949 scopus 로고
    • Stereo correspondence through feature grouping and maximal cliques
    • DOI 10.1109/34.42855
    • R. Horaud, and T. Skordas Stereo correspondence through feature grouping and maximal cliques IEEE Transactions on Pattern Analysis and Machine Intelligence 11 11 1989 1168 1180 (Pubitemid 20630607)
    • (1989) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.11 , Issue.11 , pp. 1168-1180
    • Radu, H.1    Thomas, S.2
  • 32
    • 34548805769 scopus 로고
    • Pattern associativity and the retrieval of semantic networks
    • R. Levinson Pattern associativity and the retrieval of semantic networks Computers & Mathematics with Applications 23 1992 573 600
    • (1992) Computers & Mathematics with Applications , vol.23 , pp. 573-600
    • Levinson, R.1
  • 33
    • 51249191195 scopus 로고
    • A note on the derivation of maximal common subgraphs of two directed or undirected graphs
    • G. Levi A note on the derivation of maximal common subgraphs of two directed or undirected graphs Calcols 9 1972 341 354
    • (1972) Calcols , vol.9 , pp. 341-354
    • Levi, G.1
  • 34
    • 0019909679 scopus 로고
    • Backtrack search algorithms and the maximal common subgraph problem
    • J.J. McGregor Backtrack search algorithms and the maximal common subgraph problem Software Practice and Experience 12 1982 23 34
    • (1982) Software Practice and Experience , vol.12 , pp. 23-34
    • McGregor, J.J.1
  • 35
    • 0032708360 scopus 로고    scopus 로고
    • A decision tree approach to graph and subgraph isomorphism detection
    • B.T. Messmer, and H. Bunke A decision tree approach to graph and subgraph isomorphism detection Pattern Recognition 32 12 1999 1979 1998
    • (1999) Pattern Recognition , vol.32 , Issue.12 , pp. 1979-1998
    • Messmer, B.T.1    Bunke, H.2
  • 42
    • 0000169232 scopus 로고
    • An algorithm for least-squares estimation of nonlinear parameters
    • D. Marquardt An algorithm for least-squares estimation of nonlinear parameters SIAM Journal on Applied Mathematics 11 1963 431 441
    • (1963) SIAM Journal on Applied Mathematics , vol.11 , pp. 431-441
    • Marquardt, D.1
  • 44
    • 0000873069 scopus 로고
    • A method for the solution of certain non-linear problems in least squares
    • Kenneth Levenberg A method for the solution of certain non-linear problems in least squares The Quarterly of Applied Mathematics 2 1944 164 168
    • (1944) The Quarterly of Applied Mathematics , Issue.2 , pp. 164-168
    • Levenberg, K.1
  • 48
    • 84898431324 scopus 로고
    • Variable kernel estimates of multivariate densities
    • L. Breiman, W. Meisel, and E. Purcell Variable kernel estimates of multivariate densities Technometrics 19 1977 353 360
    • (1977) Technometrics , vol.19 , pp. 353-360
    • Breiman, L.1    Meisel, W.2    Purcell, E.3
  • 55
    • 0025920334 scopus 로고
    • Relative sensitivity of a family of closest-point graphs in computer vision applications
    • M. Tuceryan, and T. Chorzempa Relative sensitivity of a family of closest-point graphs in computer vision applications Pattern Recognition 24 5 1991 361 373
    • (1991) Pattern Recognition , vol.24 , Issue.5 , pp. 361-373
    • Tuceryan, M.1    Chorzempa, T.2
  • 58
    • 0018306059 scopus 로고
    • Thresholding selection method from gray-level histobrams
    • N. Otsu A thresholding selection method from gray-level histobrams IEEE Transactions on Systems, Man, and Cybernetics 9 1 1979 62 66 (Pubitemid 9413341)
    • (1979) IEEE Trans Syst Man Cybern , vol.SMC-9 , Issue.1 , pp. 62-66
    • Nobuyuki, O.1
  • 59
  • 60
    • 34547984757 scopus 로고    scopus 로고
    • On the relation between multi-instance learning and semi-supervised learning
    • Z-H. Zhou and J-M. Xu. On the relation between multi-instance learning and semi-supervised learning, in: Intl. Conf. Machine Learning, 2007, pp. 1167-1174.
    • (2007) Intl. Conf. Machine Learning , pp. 1167-1174
    • Zhou, Z.-H.1    Xu, J.-M.2
  • 62
    • 33745155436 scopus 로고    scopus 로고
    • A bayesian hierarchical model for learning natural scene categories
    • L. Fei-Fei, P. Perona, A bayesian hierarchical model for learning natural scene categories, in: Comp. Vision and Pattern Recognition, 2005. pp. II: 524-531.
    • (2005) Comp. Vision and Pattern Recognition , pp. 524-531
    • Fei-Fei, L.1    Perona, P.2
  • 63
    • 0036682916 scopus 로고    scopus 로고
    • An expectation-maximisation framework for segmentation and grouping
    • DOI 10.1016/S0262-8856(02)00062-8, PII S0262885602000628
    • A. Robles-Kelly, and E.R. Hancock An expectation-maximisation framework for segmentation and grouping Image and Vision Computing 20 9-10 2002 725 738 (Pubitemid 34862742)
    • (2002) Image and Vision Computing , vol.20 , Issue.9-10 , pp. 725-738
    • Robles-Kelly, A.1    Hancock, E.R.2
  • 64
    • 0031211090 scopus 로고    scopus 로고
    • A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
    • Y. Freund, and R.E. Schapire A decision-theoretic generalization of on-line learning and an application to boosting Journal of Computer and System Sciences 55 1 1997 119 139 (Pubitemid 127433398)
    • (1997) Journal of Computer and System Sciences , vol.55 , Issue.1 , pp. 119-139
    • Freund, Y.1    Schapire, R.E.2
  • 66
    • 38349088398 scopus 로고    scopus 로고
    • Shape matching and modeling using skeletal context
    • J. Xie, M. Shah, and P. Heng Shape matching and modeling using skeletal context Pattern Recognition 41 5 2008 756 1767
    • (2008) Pattern Recognition , vol.41 , Issue.5 , pp. 756-1767
    • Xie, J.1    Shah, M.2    Heng, P.3


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