Sciweavers

160 search results - page 11 / 32
» Sparse decompositions in
Sort
View
105
Voted
ECCV
2010
Springer
15 years 26 days ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
ICASSP
2011
IEEE
14 years 2 months ago
An unsupervised algorithm for hybrid/morphological signal decomposition
The main contribution presented here is an adaptive/unsupervised iterative thresholding algorithm for sparse representation of signals which can be modeled as the sum of two compo...
Matthieu Kowalski, Thomas Rodet
105
Voted
NIPS
2004
14 years 11 months ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...
KDD
2012
ACM
183views Data Mining» more  KDD 2012»
13 years 27 days ago
Mining discriminative components with low-rank and sparsity constraints for face recognition
This paper introduces a novel image decomposition approach for an ensemble of correlated images, using low-rank and sparsity constraints. Each image is decomposed as a combination...
Qiang Zhang, Baoxin Li
SCALESPACE
2007
Springer
15 years 4 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré