Restoration by Compression
Yehuda Dar, Michael Elad, and Alfred M. Bruckstein

TL;DR
This paper develops practical methods for signal restoration using complexity regularization, leveraging compression techniques and ADMM, with theoretical analysis and successful experiments on image deblurring and inpainting.
Contribution
It introduces a novel iterative ADMM-based approach for complexity-regularized restoration accommodating arbitrary linear degradations, integrating compression techniques and shift-invariant regularization.
Findings
Effective restoration of images via JPEG2000 and HEVC compression standards.
Theoretical analysis of Gaussian signals shows optimal filters depend on degradation energy distribution.
Practical methods achieve good results in deblurring and inpainting tasks.
Abstract
In this paper we study the topic of signal restoration using complexity regularization, quantifying the compression bit-cost of the signal estimate. While complexity-regularized restoration is an established concept, solid practical methods were suggested only for the Gaussian denoising task, leaving more complicated restoration problems without a generally constructive approach. Here we present practical methods for complexity-regularized restoration of signals, accommodating degradations caused by a known linear operator of an arbitrary form. Our iterative procedure, obtained using the alternating direction method of multipliers (ADMM) approach, addresses the restoration task as a sequence of simpler problems involving L2-regularized estimations and rate-distortion optimizations (considering the squared-error criterion). Further, we replace the rate-distortion optimizations with an…
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.
