Sparse Reconstruction Using Hyperbolic Tangent as Smooth l1-Norm Approximation

نویسندگان

چکیده

In the Compressed Sensing (CS) framework, underdetermined system of linear equation (USLE) can have infinitely many possible solutions. However, we intend to find sparsest solution, which is l0-norm minimization. finding an l0 norm solution out solutions NP-hard problem that becomes non-convex optimization problem. It has been a practically proven fact penalty be adequately estimated by l1 norm, recasts minimization convex non-differentiable and gradient-based algorithms are not applicable, due this very reason there need approximate its smooth approximation. Iterative shrinkage provide efficient method numerically minimize l1-regularized least square These required induce sparsity in their meet CS recovery requirement. research article, developed novel uses hyperbolic tangent function recover undersampled signal/images framework. our work, soft thresholding both approximated with functions. We also proposed criteria tune parameters get optimal results. The error bounds for approximation evaluated. To evaluate performance method, utilized dataset comprised 1-D sparse signal, compressively sampled MR image cardiac cine MRI. MRI important imaging modality assessing vascular function. provides ejection fraction output heart. advantage comes at cost slow acquisition process. Hence, it essential speed up process take full benefits Numerical results based on metrics, such as Structural Similarity (SSIM), Peak Signal Noise Ratio (PSNR) Root Mean Square Error (RMSE) show offers much better compared traditional Soft Thresholding (IST) methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian L1-Norm Sparse Learning

We propose a Bayesian framework for learning the optimal regularization parameter in the L1-norm penalized least-mean-square (LMS) problem, also known as LASSO [1] or basis pursuit [2]. The setting of the regularization parameter is critical for deriving a correct solution. In most existing methods, the scalar regularization parameter is often determined in a heuristic manner; in contrast, our ...

متن کامل

Respiratory Motion Correction for Compressively Sampled Free Breathing Cardiac MRI Using Smooth l1-Norm Approximation

Transformed domain sparsity of Magnetic Resonance Imaging (MRI) has recently been used to reduce the acquisition time in conjunction with compressed sensing (CS) theory. Respiratory motion during MR scan results in strong blurring and ghosting artifacts in recovered MR images. To improve the quality of the recovered images, motion needs to be estimated and corrected. In this article, a two-step...

متن کامل

Optimal sparse L1-norm principal-component analysis

We present an algorithm that computes exactly (optimally) the S-sparse (1≤S<D) maximum-L1-norm-projection principal component of a real-valued data matrix X ∈ RD×N that contains N samples of dimension D. For fixed sample support N , the optimal L1-sparse algorithm has linear complexity in data dimension, O (D). For fixed dimension D (thus, fixed sparsity S), the optimal L1-sparse algorithm has ...

متن کامل

Robust model reduction by L1-norm minimization and approximation via dictionaries: application to nonlinear hyperbolic problems

We propose a novel model reduction approach for the approximation of non linear hyperbolic equations in the scalar and the system cases. The approach relies on an offline computation of a dictionary of solutions together with an online L1norm minimization of the residual. It is shown why this is a natural framework for hyperbolic problems and tested on nonlinear problems such as Burgers’ equati...

متن کامل

A l1-norm preserving motion-compensated transform for sparse approximation of image sequences

This paper discusses an adaptive non-linear transform for image sequences that aims to generate a l1-norm preserving sparse approximation for efficient coding. Most sparse approximation problems employ a linear model where images are represented by a basis and a sparse set of coefficients. In this work, however, we consider image sequences where linear measurements are of limited use due to mot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computation (Basel)

سال: 2023

ISSN: ['2079-3197']

DOI: https://doi.org/10.3390/computation11010007