Denoising by Sparse Approximation: Error Bounds Based on Rate-Distortion Theory
If a signal is known to have a sparse representation with respect to a frame, it can be estimated from a noise-corrupted observation by finding the best sparse approximation to . Removing noise in this manner depends on the frame efficiently representing the signal while it inefficiently represents...
Үндсэн зохиолчид: | Goyal, Vivek K., Fletcher, Alyson K., Rangan, Sundeep, Ramchandran, Kannan |
---|---|
Бусад зохиолчид: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Формат: | Өгүүллэг |
Хэл сонгох: | English |
Хэвлэсэн: |
Hindawi Publishing Corporation
2011
|
Онлайн хандалт: | http://hdl.handle.net/1721.1/67336 |
Ижил төстэй зүйлс
-
A Sparsity Detection Framework for On–Off Random Access Channels
-н: Fletcher, Alyson K., зэрэг
Хэвлэсэн: (2010) -
Necessary and Sufficient Conditions for Sparsity Pattern Recovery
-н: Fletcher, Alyson K., зэрэг
Хэвлэсэн: (2010) -
Extension of replica analysis to MAP estimation with applications to compressed sensing
-н: Rangan, Sundeep, зэрэг
Хэвлэсэн: (2012) -
Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing
-н: Goyal, Vivek K., зэрэг
Хэвлэсэн: (2012) -
Denoising sparse images from GRAPPA using the nullspace method (DESIGN)
-н: Weller, Daniel S., зэрэг
Хэвлэсэн: (2014)