Logarithmic function minimization to compressed sensing with application to magnetic resonance imaging

DOI10.1007/S11075-025-02078-WMaRDI QIDQ6848755zbMATH OpenFDO

Authors Angang Cui, Qingyong Zhu, Lijun Zhang, Shengli Xue

Publication date 5 March 2026

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11075-025-02078-W

zbMATH Keywords

compressed sensingiterative logarithmic thresholding algorithmlogarithmic functionlogarithmic minimization problemmagnetic resonance imaging

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites work

• \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A mathematical introduction to compressive sensing
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Atomic Decomposition by Basis Pursuit
• Compressed sensing
• Decoding by Linear Programming
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
• Iterative difference hard-thresholding algorithm for sparse signal recovery
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• Lasso-type recovery of sparse representations for high-dimensional data
• New bounds for RIC in compressed sensing
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Restricted isometry properties and nonconvex compressive sensing
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Shifting Inequality and Recovery of Sparse Signals
• Sparse Approximate Solutions to Linear Systems
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Sparse Signal Estimation by Maximally Sparse Convex Optimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• The restricted isometry property and its implications for compressed sensing

This page was built for publication: Logarithmic function minimization to compressed sensing with application to magnetic resonance imaging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848755)