Pith. sign in

REVIEW

Two Stage Continuous Domain Regularization for Piecewise Constant Image Restoration

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.04678 v1 pith:FVQBHW7X submitted 2022-08-09 math.NA cs.NA

Two Stage Continuous Domain Regularization for Piecewise Constant Image Restoration

classification math.NA cs.NA
keywords imageregularizationapproachlow-rankmatrixsparsestageapproaches
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The finite-rate-of-innovation (FRI) framework which corresponds a signal/image to a structured low-rank matrix is emerging as an alternative to the traditional sparse regularization. This is because such an off-the-grid approach is able to alleviate the basis mismatch between the true support in the continuous domain and the discrete grid. In this paper, we propose a two-stage off-the-grid regularization model for the image restoration. Given that the discontinuities/edges of the image lie in the zero level set of a band-limited periodic function, we can derive that the Fourier samples of the gradient of the image satisfy an annihilation relation, resulting in a low-rank two-fold Hankel matrix. In addition, since the singular value decomposition of a low-rank Hankel matrix corresponds to an adaptive tight frame system which can represent the image with sparse canonical coefficients, our approach consists of the following two stages. The first stage learns the tight wavelet frame system from a given measurement, and the second stage restores the image via the analysis approach based sparse regularization. The numerical results are presented to demonstrate that the proposed approach is compared favorably against several popular discrete regularization approaches and structured low-rank matrix approaches.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.