Image reconstruction from Fourier data using sparsity of edges
From MaRDI portal
Publication:898494
DOI10.1007/s10915-014-9973-3zbMath1355.94010OpenAlexW2001382057WikidataQ60151378 ScholiaQ60151378MaRDI QIDQ898494
Gabriel Wasserman, Anne Gelb, Rick Archibald
Publication date: 9 December 2015
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-014-9973-3
Ill-posedness and regularization problems in numerical linear algebra (65F22) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
Image reconstruction from undersampled Fourier data using the polynomial annihilation transform, Sequential edge detection using joint hierarchical Bayesian learning, High Order Edge Sensors with $\ell^1$ Regularization for Enhanced Discontinuous Galerkin Methods, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Adaptive solution of partial differential equations in multiwavelet bases
- A sparse multiresolution stochastic approximation for uncertainty quantification
- Graph Implementations for Nonsmooth Convex Programs
- Improved Total Variation-Type Regularization Using Higher Order Edge Detectors
- A Class of Bases in $L^2$ for the Sparse Representation of Integral Operators
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Polynomial Fitting for Edge Detection in Irregularly Sampled Signals and Images
