English
Related papers

Related papers: Stable Cosparse Recovery via \ell_p-analysis Optim…

200 papers

When the signal does not have a sparse structure but has sparsity under a certain transformation domain, Nam et al. \cite{NS} introduced the cosparse analysis model, which provides a dual perspective on the sparse representation model. This…

Optimization and Control · Mathematics 2023-11-27 Zisheng Liu , Ting Zhang

Sparse learning is an important topic in many areas such as machine learning, statistical estimation, signal processing, etc. Recently, there emerges a growing interest on structured sparse learning. In this paper we focus on the…

Information Theory · Computer Science 2015-03-10 Shubao Zhang , Hui Qian , Zhihua Zhang

In this paper we address the recovery conditions of weighted $\ell_p$ minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that weighted $\ell_p$ minimization…

Information Theory · Computer Science 2013-11-18 Navid Ghadermarzy , Hassan Mansour , Ozgur Yilmaz

This work addresses the robust reconstruction problem of a sparse signal from compressed measurements. We propose a robust formulation for sparse reconstruction which employs the $\ell_1$-norm as the loss function for the residual error and…

Information Theory · Computer Science 2017-03-30 Fei Wen , Yuan Yang , Ling Pei , Wenxian Yu , Peilin Liu

The constrained $\ell_p^p/\ell_q^p$ ratio model is scale invariant and is therefore attractive for sparse signal recovery. However, its nonconvex, nonsmooth, and fractional structure makes a unified theoretical and algorithmic analysis…

Optimization and Control · Mathematics 2026-05-26 Lang Yu , Nan-jing Huang

In this article, we introduce a minimization model via a non-convex transformed $\ell_p$ (TLp) penalty function with two parameters $a\in(0,\infty)$ and $p\in(0,1]$, where the case $p=1$ is known and was established by S. Zhang and J. Xin.…

Functional Analysis · Mathematics 2026-04-15 Ziwei Li , Wengu Chen , Huanmin Ge , Dachun Yang

In this note, we address the theoretical properties of $\Delta_p$, a class of compressed sensing decoders that rely on $\ell^p$ minimization with 0<p<1 to recover estimates of sparse and compressible signals from incomplete and inaccurate…

Information Theory · Computer Science 2009-08-10 Rayan Saab , Ozgur Yilmaz

This paper investigates the problem of signal estimation from undersampled noisy sub-Gaussian measurements under the assumption of a cosparse model. Based on generalized notions of sparsity, we derive novel recovery guarantees for the…

Information Theory · Computer Science 2021-02-23 Martin Genzel , Gitta Kutyniok , Maximilian März

We propose a method to reconstruct sparse signals degraded by a nonlinear distortion and acquired at a limited sampling rate. Our method formulates the reconstruction problem as a nonconvex minimization of the sum of a data fitting term and…

Optimization and Control · Mathematics 2023-01-19 Arthur Marmin , Marc Castella , Jean-Christophe Pesquet , Laurent Duval

We study a sample complexity vs. conditioning tradeoff in modern signal recovery problems (including sparse recovery, low-rank matrix sensing, covariance estimation, and abstract phase retrieval), where convex optimization problems are…

Optimization and Control · Mathematics 2024-07-19 Lijun Ding , Alex L. Wang

In the context of compressed sensing, the nonconvex $\ell_q$ minimization with $0<q<1$ has been studied in recent years. In this paper, by generalizing the sharp bound for $\ell_1$ minimization of Cai and Zhang, we show that the condition…

Information Theory · Computer Science 2015-06-17 Chao-Bing Song , Shu-Tao Xia

We propose a unified fractional regularization framework for sparse signal recovery based on the $\ell_1/\ell_p^q$ model. This model generalizes several widely used sparsity-promoting regularizers and provides additional flexibility through…

Information Theory · Computer Science 2026-05-28 Yinhao Zhao , Haoyu He , Chuanqi Ma , Hao Wang

Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as $\ell_1$-minimization find the sparsest solution to certain systems of equations. Random…

Information Theory · Computer Science 2011-08-17 Ulaş Ayaz , Holger Rauhut

The recovery of unknown signals from quadratic measurements finds extensive applications in fields such as phase retrieval, power system state estimation, and unlabeled distance geometry. This paper investigates the finite sample properties…

Statistics Theory · Mathematics 2026-04-15 Jun Fan , Jingyu Yang , Xinyu Zhang , Liqun Wang

Recent studies of under-determined linear systems of equations with sparse solutions showed a great practical and theoretical efficiency of a particular technique called $\ell_1$-optimization. Seminal works \cite{CRT,DOnoho06CS} rigorously…

Information Theory · Computer Science 2013-06-18 Mihailo Stojnic

This paper provides novel results for the recovery of signals from undersampled measurements based on analysis $\ell_1$-minimization, when the analysis operator is given by a frame. We both provide so-called uniform and nonuniform recovery…

Information Theory · Computer Science 2014-11-04 Holger Rauhut , Maryia Kabanava

This work addresses the recovery and demixing problem of signals that are sparse in some general dictionary. Involved applications include source separation, image inpainting, super-resolution, and restoration of signals corrupted by…

Information Theory · Computer Science 2017-03-24 Fei Wen , Lasith Adhikari , Ling Pei , Roummel F. Marcia , Peilin Liu , Robert C. Qiu

In this work, we consider the problem of recovering analysis-sparse signals from under-sampled measurements when some prior information about the support is available. We incorporate such information in the recovery stage by suitably tuning…

Information Theory · Computer Science 2019-01-30 Sajad Daei , Farzan Haddadi , Arash Amini

This article considers constrained $\ell_1$ minimization methods for the recovery of high dimensional sparse signals in three settings: noiseless, bounded error and Gaussian noise. A unified and elementary treatment is given in these noise…

Machine Learning · Computer Science 2008-05-05 T. Tony Cai , Guangwu Xu , Jun Zhang

In this effort, we propose a convex optimization approach based on weighted $\ell_1$-regularization for reconstructing objects of interest, such as signals or images, that are sparse or compressible in a wavelet basis. We recover the…

Image and Video Processing · Electrical Eng. & Systems 2019-09-17 Joseph Daws , Armenak Petrosyan , Hoang Tran , Clayton G. Webster
‹ Prev 1 2 3 10 Next ›