Image reconstruction from undersampled Fourier data using the polynomial annihilation transform

DOI10.1007/s10915-015-0088-2zbMath1339.65026OpenAlexW2162116083WikidataQ60151364 ScholiaQ60151364MaRDI QIDQ292541

Rodrigo B. Platte, Anne Gelb, Rick Archibald

Publication date: 8 June 2016

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-015-0088-2

zbMATH Keywords

algorithmnumerical exampleconvex optimizationregularizationmagnetic resonance imagingimage reconstructionedge detectionsynthetic aperture radarsplit BregmanFourier datapolynomial annihilation

Mathematics Subject Classification ID

Convex programming (90C25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

Estimation and Uncertainty Quantification for Piecewise Smooth Signal Recovery, Sampling-based Spotlight SAR Image Reconstruction from Phase History Data for Speckle Reduction and Uncertainty Quantification, Fast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform mesh, Sequential image recovery from noisy and under-sampled Fourier data, Empirical Bayesian Inference Using a Support Informed Prior, Sub-aperture SAR imaging with uncertainty quantification, Generalized Sparse Bayesian Learning and Application to Image Reconstruction, Sequential edge detection using joint hierarchical Bayesian learning, Inhomogeneous regularization with limited and indirect data, Composite SAR imaging using sequential joint sparsity, Sequential image recovery using joint hierarchical Bayesian learning, High Order Edge Sensors with $\ell^1$ Regularization for Enhanced Discontinuous Galerkin Methods, Reducing effects of bad data using variance based joint sparsity recovery, A domain decomposition Fourier continuation method for enhanced \(L_1\) regularization using sparsity of edges in reconstructing Fourier data, Using \(\ell _1\) regularization to improve numerical partial differential equation solvers, Edge Detection of Piecewise Smooth Functions from UnderSampled Fourier Data Using Variance Signatures, PCM-TV-TFV: A Novel Two-Stage Framework for Image Reconstruction from Fourier Data, Numerical analysis for conservation laws using \(l_1\) minimization, Joint image formation and two-dimensional autofocusing for synthetic aperture radar data, Detecting edges from non-uniform Fourier data via sparse Bayesian learning

Uses Software

• CVX

Cites Work

• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Image reconstruction from Fourier data using sparsity of edges
• A wavelet regularization method for diffusion radar-target imaging and speckle noise reduction
• A sparse multiresolution stochastic approximation for uncertainty quantification
• A New Detail-Preserving Regularization Scheme
• Graph Implementations for Nonsmooth Convex Programs
• The Split Bregman Method for L1-Regularized Problems
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
• Improved Total Variation-Type Regularization Using Higher Order Edge Detectors
• Reconstruction of Wavelet Coefficients Using Total Variation Minimization
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Polynomial Fitting for Edge Detection in Irregularly Sampled Signals and Images
• Total Generalized Variation
• Compressed sensing