Pith. sign in

REVIEW

Utilizing the Structure of the Curvelet Transform with Compressed Sensing

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 2107.11664 v2 pith:UYBPTLO5 submitted 2021-07-24 eess.IV

Utilizing the Structure of the Curvelet Transform with Compressed Sensing

classification eess.IV
keywords curveletcompressedlow-frequencysensingsparsifyingtransformationadvantageestimate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The discrete curvelet transform decomposes an image into a set of fundamental components that are distinguished by direction and size as well as a low-frequency representation. The curvelet representation is approximately sparse; thus, it is a useful sparsifying transformation to be used with compressed sensing. However, the low-frequency portion is seldom sparse. This manuscript presents a method to modify the redundant sparsifying transformation comprised of the wavelet and curvelet transforms to take advantage of this fact with compressed sensing image reconstruction. Instead of relying on sparsity for this low-frequency estimate, the Nyquist-Shannon theorem specifies a square region centered on the $0$ frequency to be collected, which is used to generate a blurry estimate. A Basis Pursuit Denoising problem is solved to determine the missing details after modifying the sparsifying transformation to take advantage of the known fully sampled region. Improvements in quality are shown on magnetic resonance and optical images.

discussion (0)

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