Sciweavers

17 search results - page 1 / 4
» Clustering disjoint subspaces via sparse representation
Sort
View
ICASSP
2010
IEEE
13 years 5 months ago
Clustering disjoint subspaces via sparse representation
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
Ehsan Elhamifar, René Vidal
CVPR
2010
IEEE
13 years 8 months ago
Classification and Clustering via Dictionary Learning with Structured Incoherence
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
Pablo Sprechmann, Ignacio Ramirez, Guillermo Sapir...
JMLR
2012
11 years 7 months ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao
CISS
2008
IEEE
13 years 6 months ago
Portfolio diversification using subspace factorizations
Abstract-- Successful investment management relies on allocating assets so as to beat the stock market. Asset classes are affected by different market dynamics or latent trends. Th...
Ruairi de Frein, Konstantinos Drakakis, Scott Rick...
ICIP
2008
IEEE
14 years 6 months ago
Face hallucination VIA sparse coding
In this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the fa...
Jianchao Yang, Hao Tang, Yi Ma, Thomas S. Huang