메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 19-

Robust 3D shape correspondence in the spectral domain

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; INVARIANCE; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 33845422122     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2006.31     Document Type: Conference Paper
Times cited : (149)

References (35)
  • 1
    • 0036610881 scopus 로고    scopus 로고
    • Recent advances in mesh morphing
    • M. Alexa, "Recent Advances in Mesh Morphing," Computer Graphics Forum, Vol. 21, No. 2, pp. 173-196, 2002.
    • (2002) Computer Graphics Forum , vol.21 , Issue.2 , pp. 173-196
    • Alexa, M.1
  • 3
    • 0036538619 scopus 로고    scopus 로고
    • Shape matching and object recognition using shape contexts
    • S. Belongie, J. Malik, and J. Puzicha, "Shape Matching and Object Recognition Using Shape Contexts," IEEE Trans. on PAMI, Vol. 24, No. 24, pp. 509-523, 2002.
    • (2002) IEEE Trans. on PAMI , vol.24 , Issue.24 , pp. 509-523
    • Belongie, S.1    Malik, J.2    Puzicha, J.3
  • 4
    • 0026821209 scopus 로고
    • A method for registration of 3-D shapes
    • P. J. Besl and N. D. Mckay, "A Method for Registration of 3-D Shapes," IEEE Trans. on PAMI, Vol. 14, No. 2, pp. 239-256, 1992.
    • (1992) IEEE Trans. on PAMI , vol.14 , Issue.2 , pp. 239-256
    • Besl, P.J.1    Mckay, N.D.2
  • 5
    • 1842426385 scopus 로고    scopus 로고
    • An eigenspace projection clustering method for inexact graph matching
    • T. Caelli and S. Kosinov, "An Eigenspace Projection Clustering Method for Inexact Graph Matching," IEEE Trans. on PAMI, Vol. 26, No. 4, pp. 515-519, 2004.
    • (2004) IEEE Trans. on PAMI , vol.26 , Issue.4 , pp. 515-519
    • Caelli, T.1    Kosinov, S.2
  • 6
  • 7
    • 0037209409 scopus 로고    scopus 로고
    • Spectral correspondence for point pattern matching
    • M. Carcassoni and E. R. Hancock, "Spectral Correspondence for Point Pattern Matching," Pattern Recognition, Vol. 36, pp. 193-204, 2003.
    • (2003) Pattern Recognition , vol.36 , pp. 193-204
    • Carcassoni, M.1    Hancock, E.R.2
  • 8
    • 0348011366 scopus 로고    scopus 로고
    • Correspondence matching with modal clusters
    • M. Carcassoni and E. R. Hancock, "Correspondence Matching with Modal Clusters," IEEE Trans. on PAMI, Vol. 25, No. 12, pp. 1609-1615, 2003.
    • (2003) IEEE Trans. on PAMI , vol.25 , Issue.12 , pp. 1609-1615
    • Carcassoni, M.1    Hancock, E.R.2
  • 9
    • 0000802374 scopus 로고
    • The approximation of one matrix by another of lower rank
    • C. Eckart and G. Young, "The Approximation of One Matrix by Another of Lower Rank," Psychometrika, Vol. 1, pp. 211-218, 1936.
    • (1936) Psychometrika , vol.1 , pp. 211-218
    • Eckart, C.1    Young, G.2
  • 10
    • 0142103254 scopus 로고    scopus 로고
    • On bending invariant signatures for surfaces
    • A. Elad and R. Kimmel, "On Bending Invariant Signatures for Surfaces," IEEE Trans. on PAMI, Vol. 25, No. 10, pp. 1285-1295, 2003.
    • (2003) IEEE Trans. on PAMI , vol.25 , Issue.10 , pp. 1285-1295
    • Elad, A.1    Kimmel, R.2
  • 11
    • 0742286179 scopus 로고    scopus 로고
    • Spectral grouping using the nyström method
    • C. Fowlkes, S. Belongie, F. Chung, and J. Malik, "Spectral Grouping Using the Nyström Method," IEEE Trans. on PAMI, Vol. 26, No. 2, pp. 214-225, 2004.
    • (2004) IEEE Trans. on PAMI , vol.26 , Issue.2 , pp. 214-225
    • Fowlkes, C.1    Belongie, S.2    Chung, F.3    Malik, J.4
  • 16
    • 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 Transaction on Graphics, Vol. 22, No. 3, pp. 358-363, 2003.
    • (2003) ACM Transaction on Graphics , vol.22 , Issue.3 , pp. 358-363
    • Gotsman, C.1    Gu, X.2    Sheffer, A.3
  • 17
    • 0032685832 scopus 로고    scopus 로고
    • Using spin-images for efficient multiple model recognition in cluttered 3-D scenes
    • A. Johnson and M. Hebert, "Using Spin-Images for Efficient Multiple Model Recognition in Cluttered 3-D Scenes," IEEE Trans. on PAMI, pp. 433-449, 1999.
    • (1999) IEEE Trans. on PAMI , pp. 433-449
    • Johnson, A.1    Hebert, M.2
  • 20
    • 33646027624 scopus 로고    scopus 로고
    • Matchmaker: Constructing constrained texture maps
    • V. Kraevoy, A. Sheffer, and C. Gotsman, "Matchmaker: Constructing Constrained Texture Maps," ACM SIGGRAPH, pp. 326-333, 2003.
    • (2003) ACM SIGGRAPH , pp. 326-333
    • Kraevoy, V.1    Sheffer, A.2    Gotsman, C.3
  • 21
    • 84877621437 scopus 로고    scopus 로고
    • Cross-parameterization and compatible remeshing of 3D models
    • V. Kraevoy and A. Sheffer, "Cross-Parameterization and Compatible Remeshing of 3D Models," ACM SIGGRAPH, 2004.
    • (2004) ACM SIGGRAPH
    • Kraevoy, V.1    Sheffer, A.2
  • 22
    • 17444414621 scopus 로고    scopus 로고
    • Segmentation of 3D meshes through spectral clustering
    • R. Liu and H. Zhang, "Segmentation of 3D Meshes through Spectral Clustering," Proc. of Pacific Graphics, pp. 298-305, 2004.
    • (2004) Proc. of Pacific Graphics , pp. 298-305
    • Liu, R.1    Zhang, H.2
  • 24
    • 33845448582 scopus 로고    scopus 로고
    • Subsampling for efficient spectral mesh processing
    • June, (to appear)
    • R. Liu, V. Jain, and H. Zhang, "Subsampling for Efficient Spectral Mesh Processing," Computer Graphics International June, 2006 (to appear).
    • (2006) Computer Graphics International
    • Liu, R.1    Jain, V.2    Zhang, H.3
  • 30
    • 0026288231 scopus 로고
    • An algorithm for associating the features of two patterns
    • G. Scott and H. Longuet-Higgins, "An Algorithm for Associating the Features of Two Patterns," Proc. Royal Soc. London, Vol. B244, 1991.
    • (1991) Proc. Royal Soc. London , vol.B244
    • Scott, G.1    Longuet-Higgins, H.2
  • 31
    • 34548752768 scopus 로고
    • Feature based correspondence: An eigenvector approach
    • L. S. Shapiro and J. M. Brady, "Feature Based Correspondence: An Eigenvector Approach," Image and Vision Computing, Vol. 10, No. 5, pp. 283-288, 1992.
    • (1992) Image and Vision Computing , vol.10 , Issue.5 , pp. 283-288
    • Shapiro, L.S.1    Brady, J.M.2
  • 32
  • 33
    • 0024069925 scopus 로고
    • An eigen decomposition approach to weighted graph matching problems
    • S. Umeyama, "An Eigen Decomposition Approach to Weighted Graph Matching Problems," IEEE Trans. on PAMI, Vol. 10, pp. 695-703, 1988.
    • (1988) IEEE Trans. on PAMI , vol.10 , pp. 695-703
    • Umeyama, S.1


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