Sciweavers

160 search results - page 9 / 32
» Sparse decompositions in
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 5 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
CVPR
2009
IEEE
15 years 5 months ago
Contextual decomposition of multi-label images
Most research on image decomposition, e.g. image segmentation and image parsing, has predominantly focused on the low-level visual clues within single image and neglected the cont...
Teng Li, Tao Mei, Shuicheng Yan, In-So Kweon, Chil...
89
Voted
ICIP
2008
IEEE
15 years 4 months ago
Atomic decomposition dedicated to AVC and spatial SVC prediction
In this work, we propose the use of sparse signal representation techniques to solve the problem of closed-loop spatial image prediction. The reconstruction of signal in the block...
Aurelie Martin, Jean-Jacques Fuchs, Christine Guil...
SIAMJO
2011
14 years 1 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
ICCV
2007
IEEE
16 years 11 days ago
pLSA for Sparse Arrays With Tsallis Pseudo-Additive Divergence: Noise Robustness and Algorithm
We introduce the Tsallis divergence error measure in the context of pLSA matrix and tensor decompositions showing much improved performance in the presence of noise. The focus of ...
Tamir Hazan, Roee Hardoon, Amnon Shashua