
...in this paper we describe a graphspectral method for 3d surface segmentation from 2d imagery. the...matrix using the change in surface normal directions to estimate the normal curvature. the second approach uses the raw image brightness...

...this paper, we explore how graphspectral methods can be used to develop a new shapefromshading algorithm...the weight matrix as distinct surface patches, we use a graph seriation method to find a surface integration path that maximizes the...

...this paper, we explore how graphspectral methods can be used to develop a new shapefromshading algorithm...the weight matrix as distinct surface patches, we use a graph seriation method to find a surface integration path that maximizes the...

...eigenvectors of an appropriately deflned anity matrix, forming a spectral embedding which achieves normalization against...retrieval is performed in the spectral domain using global shape descrip tors. on the mcgill database of articulated 3d shapes, the spectral approach leads to absolute improvement in retrieval performance...

...the paper describes a graphspectral method for 3d surface integration. the algorithm takes as its input a 2d field of surface normal estimates, delivered, for instance, by a shapefromshading or shape...

a new method for smoothing both...the heat diffusion equation on a graph.
we represent the image pixel lattice using a weighted undirected graph. the edge weights of the graph are determined by the
gaussian...

...by using the isomap algorithm to embed the nodes of a graph in a lowdimensional euclidean space. with the nodes in the graph transformed to points in a metric space, we can recast the problem of graphmatching into that of aligning...

...by using the isomap algorithm to embed the nodes of a graph in a lowdimensional euclidean space. with the nodes in the graph transformed to points in a metric space, we can recast the problem of graph matching into that of aligning...

...we propose a robust and imperceptible spectral watermark ing method for high rate embedding of a watermark into 3d polygonal meshes. our approach consists of four main steps...extraction algorithms are ap plied to each submesh, (2) the mesh laplacian spectral com pression is applied to the submeshes, (3) the...

...in the formu lation. our approach is based on the discretization of the inviscid flow equations through a collocation form of the discontinuous galerkin spectral element method. an isoparametric representation...geometry is used in order to take full advan tage of the spectral accuracy of the method. large scale computations are made possible by a parallel implementation based on message...