Sciweavers

502 search results - page 34 / 101
» Sparse Subspace Clustering
Sort
View
CVPR
2004
IEEE
16 years 3 months ago
Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
Kun Huang, René Vidal, Yi Ma
CORR
2011
Springer
214views Education» more  CORR 2011»
14 years 5 months ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 11 months ago
An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors a...
Matthias Hein, Thomas Bühler
RSA
2011
124views more  RSA 2011»
14 years 8 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
CVPR
2004
IEEE
16 years 3 months ago
Efficient Tracking with the Bounded Hough Transform
The Bounded Hough Transform is introduced to track objects in a sequence of sparse range images. The method is based upon a variation of the General Hough Transform that exploits ...
Michael A. Greenspan, Limin Shang, Piotr Jasiobedz...