Sciweavers

756 search results - page 144 / 152
» Quantization of Sparse Representations
Sort
View
NIPS
2001
13 years 9 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
PAMI
2008
220views more  PAMI 2008»
13 years 7 months ago
Pedestrian Detection via Classification on Riemannian Manifolds
Detecting different categories of objects in image and video content is one of the fundamental tasks in computer vision research. The success of many applications such as visual s...
Oncel Tuzel, Fatih Porikli, Peter Meer
COMGEO
1999
ACM
13 years 7 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
TSP
2010
13 years 2 months ago
Recursive least squares dictionary learning algorithm
We present the Recursive Least Squares Dictionary Learning Algorithm, RLSDLA, which can be used for learning overcomplete dictionaries for sparse signal representation. Most Dicti...
Karl Skretting, Kjersti Engan
CVPR
2011
IEEE
12 years 11 months ago
Topologically-Robust 3D Shape Matching Based on Diffusion Geometry and Seed Growing
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
Avinash Sharma, Radu Horaud, Jan Cech, Edmond Boye...