中文
相关论文

相关论文: Sparse Phase Retrieval with Redundant Dictionary v…

200 篇论文

The support recovery problem consists of determining a sparse subset of variables that is relevant in generating a set of observations. In this paper, we study the support recovery problem in the phase retrieval model consisting of noisy…

信息论 · 计算机科学 2020-09-29 Lan V. Truong , Jonathan Scarlett

Over the past decade, learning a dictionary from input images for sparse modeling has been one of the topics which receive most research attention in image processing and compressed sensing. Most existing dictionary learning methods…

图像与视频处理 · 电气工程与系统科学 2021-04-27 Kai Liu , Yongjian Zhao , Hua Wang

We develop a dictionary learning algorithm by minimizing the $\ell_1$ distortion metric on the data term, which is known to be robust for non-Gaussian noise contamination. The proposed algorithm exploits the idea of iterative minimization…

计算机视觉与模式识别 · 计算机科学 2015-03-04 Subhadip Mukherjee , Rupam Basu , Chandra Sekhar Seelamantula

Audio inpainting refers to signal processing techniques that aim at restoring missing or corrupted consecutive samples in audio signals. Prior works have shown that $\ell_1$- minimization with appropriate weighting is capable of solving…

声音 · 计算机科学 2022-02-16 Shristi Rajbamshi , Georg Tauböck , Peter Balazs , Nicki Holighaus

Sparse coding, which refers to modeling a signal as sparse linear combinations of the elements of a learned dictionary, has proven to be a successful (and interpretable) approach in applications such as signal processing, computer vision,…

机器学习 · 计算机科学 2023-06-02 Muthu Chidambaram , Chenwei Wu , Yu Cheng , Rong Ge

In this paper, we show that, under the assumption that $\|\e\|_2\leq \epsilon$, every $k-$sparse signal $\x\in \mathbb{R}^n$ can be stably ($\epsilon\neq0$) or exactly recovered ($\epsilon=0$) from $\y=\A\x+\e$ via $l_p-$mnimization with…

信息论 · 计算机科学 2014-06-18 Jinming Wen , Dongfang Li , Fumin Zhu

We consider the Orthogonal Least-Squares (OLS) algorithm for the recovery of a $m$-dimensional $k$-sparse signal from a low number of noisy linear measurements. The Exact Recovery Condition (ERC) in bounded noisy scenario is established for…

机器学习 · 统计学 2016-08-09 Abolfazl Hashemi , Haris Vikalo

We consider the problem of recovering sparse vectors from underdetermined linear measurements via $\ell_p$-constrained basis pursuit. Previous analyses of this problem based on generalized restricted isometry properties have suggested that…

信息论 · 计算机科学 2015-04-21 Sjoerd Dirksen , Guillaume Lecué , Holger Rauhut

This contribution proposes a two stage strategy to allow for phase retrieval in state of the art sub-Nyquist sampling schemes for sparse multiband signals. The proposed strategy is based on data acquisition via modulated wideband converters…

信息论 · 计算机科学 2015-09-29 Çağkan Yapar , Volker Pohl , Holger Boche

Compressive phase retrieval is a popular variant of the standard compressive sensing problem in which the measurements only contain magnitude information. In this paper, motivated by recent advances in deep generative models, we provide…

机器学习 · 统计学 2021-10-19 Zhaoqiang Liu , Subhroshekhar Ghosh , Jonathan Scarlett

This paper proposes a sparse regression strategy for discovery of ordinary differential equations from incomplete and noisy data. Inference is performed over both equation parameters and state variables using a statistically motivated…

动力系统 · 数学 2026-02-18 Teddy Meissner , Karl Glasner

This article considers recovery of signals that are sparse or approximately sparse in terms of a (possibly) highly overcomplete and coherent tight frame from undersampled data corrupted with additive noise. We show that the properly…

信息论 · 计算机科学 2013-09-10 Junhong Lin , Song Li

We study the support recovery problem for compressed sensing, where the goal is to reconstruct the a high-dimensional $K$-sparse signal $\mathbf{x}\in\mathbb{R}^N$, from low-dimensional linear measurements with and without noise. Our key…

信息论 · 计算机科学 2018-02-27 Xiao Li , Dong Yin , Sameer Pawar , Ramtin Pedarsani , Kannan Ramchandran

The problem of signal recovery from its Fourier transform magnitude is of paramount importance in various fields of engineering and has been around for over 100 years. Due to the absence of phase information, some form of additional…

信息论 · 计算机科学 2015-07-02 Kishore Jaganathan , Samet Oymak , Babak Hassibi

We study the sparse phase retrieval problem, which seeks to recover a sparse signal from a limited set of magnitude-only measurements. In contrast to prevalent sparse phase retrieval algorithms that primarily use first-order methods, we…

信息论 · 计算机科学 2024-03-20 Jian-Feng Cai , Yu Long , Ruixue Wen , Jiaxi Ying

In phase retrieval, the goal is to recover a signal $\mathbf{x}\in\mathbb{C}^N$ from the magnitudes of linear measurements $\mathbf{Ax}\in\mathbb{C}^M$. While recent theory has established that $M\approx 4N$ intensity measurements are…

信息论 · 计算机科学 2015-06-19 Philip Schniter , Sundeep Rangan

We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admitting a sparse representation in another general dictionary.…

信息论 · 计算机科学 2011-12-08 Christoph Studer , Patrick Kuppinger , Graeme Pope , Helmut Bölcskei

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied in the literature. In this paper, we show that for any $K$-sparse signal $\x$, if the sensing matrix $\A$…

信息论 · 计算机科学 2018-07-13 JInming Wen , Zhengchun Zhou , Jian Wang , Xiaohu Tang , Qun Mo

We propose a robust and efficient approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on…

信息论 · 计算机科学 2015-10-28 Sohail Bahmani , Justin Romberg

Dictionary learning is a popular approach for inferring a hidden basis or dictionary in which data has a sparse representation. Data generated from the dictionary A (an n by m matrix, with m > n in the over-complete setting) is given by Y =…

机器学习 · 计算机科学 2018-05-09 Pranjal Awasthi , Aravindan Vijayaraghavan