Image Compressive Sensing Recovery Using Adaptively Learned Sparsifying Basis via L0 Minimization
Jian Zhang, Chen Zhao, Debin Zhao, Wen Gao

TL;DR
This paper introduces an adaptive sparsifying basis learned from natural images for compressive sensing recovery, significantly improving reconstruction quality over fixed basis methods by using L0 minimization and split Bregman iteration.
Contribution
It proposes a novel adaptive basis learning framework combined with L0 minimization and split Bregman iteration for improved image compressive sensing recovery.
Findings
Achieves higher reconstruction quality than existing methods.
Reduces blocking artifacts in recovered images.
Demonstrates good convergence and robustness.
Abstract
From many fewer acquired measurements than suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that, a signal can be reconstructed with high probability when it exhibits sparsity in some domain. Most of the conventional CS recovery approaches, however, exploited a set of fixed bases (e.g. DCT, wavelet and gradient domain) for the entirety of a signal, which are irrespective of the non-stationarity of natural signals and cannot achieve high enough degree of sparsity, thus resulting in poor CS recovery performance. In this paper, we propose a new framework for image compressive sensing recovery using adaptively learned sparsifying basis via L0 minimization. The intrinsic sparsity of natural images is enforced substantially by sparsely representing overlapped image patches using the adaptively learned sparsifying basis in the form of L0 norm, greatly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
