English
Related papers

Related papers: Sparse Phase Retrieval with Redundant Dictionary v…

200 papers

The recovery of signals that are sparse not in a basis, but rather sparse with respect to an over-complete dictionary is one of the most flexible settings in the field of compressed sensing with numerous applications. As in the standard…

Information Theory · Computer Science 2021-10-01 Pedro Abdalla , Christian Kümmerle

The sparsity of natural signals and images in a transform domain or dictionary has been extensively exploited in several applications such as compression, denoising and inverse problems. More recently, data-driven adaptation of synthesis…

Machine Learning · Computer Science 2017-04-24 Saiprasad Ravishankar , Raj Rao Nadakuditi , Jeffrey A. Fessler

Given a linear system in a real or complex domain, linear regression aims to recover the model parameters from a set of observations. Recent studies in compressive sensing have successfully shown that under certain conditions, a linear…

Statistics Theory · Mathematics 2016-11-15 Henrik Ohlsson , Allen Y. Yang , Roy Dong , S. Shankar Sastry

High-dimensional data often lie in low-dimensional subspaces corresponding to different classes they belong to. Finding sparse representations of data points in a dictionary built using the collection of data helps to uncover…

Machine Learning · Statistics 2016-02-16 Ehsan Elhamifar , Mahdi Soltanolkotabi , Shankar Sastry

Classical results in sparse recovery guarantee the exact reconstruction of $s$-sparse signals under assumptions on the dictionary that are either too strong or NP-hard to check. Moreover, such results may be pessimistic in practice since…

Information Theory · Computer Science 2019-04-04 Mengnan Zhao , M. Devrim Kaba , René Vidal , Daniel P. Robinson , Enrique Mallada

In this paper, we discuss the statistical properties of the $\ell_q$ optimization methods $(0<q\leq 1)$, including the $\ell_q$ minimization method and the $\ell_q$ regularization method, for estimating a sparse parameter from noisy…

Machine Learning · Statistics 2019-11-14 Xin Li , Yaohua Hu , Chong Li , Xiaoqi Yang , Tianzi Jiang

Conventional sparse phase retrieval schemes can recover sparse signals from the magnitude of linear measurements only up to a global phase ambiguity. This work proposes a novel approach that instead utilizes the magnitude of affine…

Information Theory · Computer Science 2021-05-25 Ming-Hsun Yang , Y. -W. Peter Hong , Jwo-Yuh Wu

Phase retrieval (PR) is a popular research topic in signal processing and machine learning. However, its performance degrades significantly when the measurements are corrupted by noise or outliers. To address this limitation, we propose a…

Optimization and Control · Mathematics 2025-05-30 Jun Fan , Ailing Yan , Xianchao Xiu , Wanquan Liu

This paper develops a novel algorithm, termed \emph{SPARse Truncated Amplitude flow} (SPARTA), to reconstruct a sparse signal from a small number of magnitude-only measurements. It deals with what is also known as sparse phase retrieval…

Information Theory · Computer Science 2017-10-31 Gang Wang , Liang Zhang , Georgios B. Giannakis , Mehmet Akcakaya , Jie Chen

We consider the problem of learning sparsely used dictionaries with an arbitrary square dictionary and a random, sparse coefficient matrix. We prove that $O (n \log n)$ samples are sufficient to uniquely determine the coefficient matrix.…

Machine Learning · Computer Science 2012-06-27 Daniel A. Spielman , Huan Wang , John Wright

Periodic signals composed of periodic mixtures admit sparse representations in nested periodic dictionaries (NPDs). Therefore, their underlying hidden periods can be estimated by recovering the exact support of said representations. In this…

Information Theory · Computer Science 2024-06-05 Pouria Saidi , George K. Atia

Sparse phase retrieval aims to recover a $k$-sparse signal from $m$ phaseless measurements. While the theoretically optimal sample complexity for successful recovery is $\Omega(k \log n)$, existing algorithms can only achieve this bound for…

Information Theory · Computer Science 2026-03-30 Mengchu Xu , Yuxuan Zhang , Jian Wang

In many areas of imaging science, it is difficult to measure the phase of linear measurements. As such, one often wishes to reconstruct a signal from intensity measurements, that is, perform phase retrieval. In several applications the…

Information Theory · Computer Science 2015-06-16 Afonso S. Bandeira , Dustin G. Mixon

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse…

Information Theory · Computer Science 2009-10-18 Robert Calderbank , Stephen Howard , Sina Jafarpour

The phase retrieval problem asks to recover a natural signal $y_0 \in \mathbb{R}^n$ from $m$ quadratic observations, where $m$ is to be minimized. As is common in many imaging problems, natural signals are considered sparse with respect to…

Information Theory · Computer Science 2018-07-12 Paul Hand , Oscar Leong , Vladislav Voroninski

Sparse modeling is one of the efficient techniques for imaging that allows recovering lost information. In this paper, we present a novel iterative phase-retrieval algorithm using a sparse representation of the object amplitude and phase.…

Computer Vision and Pattern Recognition · Computer Science 2011-08-17 Artem Migukin , Vladimir Katkovnik , Jaakko Astola

We address the exact recovery of a k-sparse vector in the noiseless setting when some partial information on the support is available. This partial information takes the form of either a subset of the true support or an approximate subset…

Information Theory · Computer Science 2013-05-20 C. Herzet , C. Soussen , J. Idier , R. Gribonval

In sparse recovery, the unique sparsest solution to an under-determined system of linear equations is of main interest. This scheme is commonly proposed to be applied to signal acquisition. In most cases, the signals are not sparse…

Information Theory · Computer Science 2013-07-16 Henning Zörlein , Faisal Akram , Martin Bossert

This paper considers the noisy sparse phase retrieval problem: recovering a sparse signal $x \in \mathbb{R}^p$ from noisy quadratic measurements $y_j = (a_j' x )^2 + \epsilon_j$, $j=1, \ldots, m$, with independent sub-exponential noise…

Statistics Theory · Mathematics 2015-06-11 T. Tony Cai , Xiaodong Li , Zongming Ma

We study the stable recovery of complex $k$-sparse signals from as few phaseless measurements as possible. The main result is to show that one can employ $\ell_1$ minimization to stably recover complex $k$-sparse signals from $m\geq O(k\log…

Functional Analysis · Mathematics 2019-11-27 Yu Xia , Zhiqiang Xu