160 search results - page 11 / 32 » Sparse decompositions in |
117
click to vote
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
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...
107
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
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...
115
click to vote
NIPS
2004
15 years 1 months ago
2004
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...
130
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
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...
132
Voted
SCALESPACE
2007
Springer
15 years 6 months ago
2007
Springer
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...