autumnmastermengmin.pptVIP

Mesh Segmentationvia Spectral Embeddingand Contour Analysis Speaker: Min Meng 2007.11.22 Background knowledge Spectrum of matrix Given an nxn matrix M Eigenvalues Eigenvectors By definition The spectrum of matrix M The Spectral Theorem Let S be a real symmetric matrix of dimension n, the eigendecomposition of S Where are diagonal matrix of eigenvalues are eigenvectors are real, V are orthogonal Spectral method Solve the problem by manipulating Eigenvalues Eigenvectors Eigenspace projections Combination of these quantities Which derived from an appropriately defined linear operator Use of spectral method Use of eigenvalues Global shape descriptors Graph and shape matching Use of spectral method Use of eigenvectors Spectral embedding K-D embedding Use of spectral method Use of eigenprojections Project the signal into a different domain Mesh compression Remove high-frequency Spectral watermark Remove low-frequency Mesh laplacians Mesh laplacian operators Linear operators Act on functions defined on a mesh Mesh laplacians Mesh laplacians Combinatorial mesh laplacians Defined by the graph associated with mesh Adjacency matrix W Graph : Normalized graph: Geometric mesh laplacians Overview Outline 2D Spectral embedding - vertices 2D Contour analysis 1D Spectral embedding - faces line search with salience 2D Spectral projections-point Graph laplacian L Structural segmentability Geometric laplacian M Geometrical segmentability Graph laplacian L Adjacency matrix W, graph laplacian L L is positive semi-definite and symmetric Its smallest eigenvalue Corresponding eigenvector v is constant vector Choose k=3 to spectral 2D embedding Graph laplacian L Spectral projection Branch is retained Capture structural segmentability Geometric laplacian M Geometric matrix W For edge e=(i, j) Others Geometric laplacian M Geometric laplacian M If an edge e=(i, j) Takes a large weight Mesh vertices from concave region Pulled c