Joseph Woodworth
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Joseph Woodworth has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Rick Chartrand
Descartes Labs, 1925 Trinity Drive, Los Alamos, NM 87544, USA
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 18 May 2016
- Published by IOP Publishing in Inverse Problems
- Vol. 32 (7) , 075004
Compressed sensing recovery via nonconvex shrinkage penalties
The ℓ 0 minimization of compressed sensing is often relaxed to ℓ 1 , which yields easy computation using the shrinkage mapping known as soft thresholding, and can be shown to recover the original solution under certain hypotheses. Recent work has derived a general class of shrinkages and associated nonconvex penalties that better approximate the original ℓ 0 penalty and empirically can recover the original solution from fewer measurements. We specifically examine p-shrinkage and firm thresholding . In this work, we prove that given data and a measurement matrix from a broad class of matrices, one can choose parameters for these classes of shrinkages to guarantee exact recovery of the sparsest solution. We further prove convergence of the algorithm iterative p-shrinkage (IPS) for solving one such relaxed problem.
- 18 May 2016
- Published by IOP Publishing in Inverse Problems
- Vol. 32 (7) , 075004
Top Cited PapersOpen AccessCompressed sensing recovery via nonconvex shrinkage penalties
The ℓ 0 minimization of compressed sensing is often relaxed to ℓ 1 , which yields easy computation using the shrinkage mapping known as soft thresholding, and can be shown to recover the original solution under certain hypotheses. Recent work has derived a general class of shrinkages and associated nonconvex penalties that better approximate the original ℓ 0 penalty and empirically can recover the original solution from fewer measurements. We specifically examine p-shrinkage and firm thresholding . In this work, we prove that given data and a measurement matrix from a broad class of matrices, one can choose parameters for these classes of shrinkages to guarantee exact recovery of the sparsest solution. We further prove convergence of the algorithm iterative p-shrinkage (IPS) for solving one such relaxed problem.