Utilizing the Structure of the Curvelet Transform with Compressed Sensing

24 Jul 2021  ·  Nicholas Dwork, Peder E. Z. Larson ·

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.

PDF Abstract

Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods


No methods listed for this paper. Add relevant methods here