Sciweavers

Share
CVPR
2013
IEEE
6 years 7 months ago
The Generalized Laplacian Distane and its Applications for Visual Matching
The graph Laplacian operator, which originated in spectral graph theory, is commonly used for learning applications such as spectral clustering and embedding. In this paper we expl...
Elhanan Elboher, Michael Werman, Yacov Hel-Or
TIP
2010
155views more  TIP 2010»
8 years 11 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
8 years 11 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
PR
2007
141views more  PR 2007»
9 years 25 days ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
TIP
2008
124views more  TIP 2008»
9 years 1 months ago
Graph Laplacian Tomography From Unknown Random Projections
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigwor...
CORR
2006
Springer
151views Education» more  CORR 2006»
9 years 1 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
NIPS
2008
9 years 2 months ago
Spectral Hashing
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
Yair Weiss, Antonio Torralba, Robert Fergus
NIPS
2008
9 years 2 months ago
Fast Prediction on a Tree
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
Mark Herbster, Massimiliano Pontil, Sergio Rojas G...
COLT
2006
Springer
9 years 5 months ago
Uniform Convergence of Adaptive Graph-Based Regularization
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
Matthias Hein
COLT
2004
Springer
9 years 6 months ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
books