English
Related papers

Related papers: Improving Noise Robustness in Subspace-based Joint…

200 papers

We propose robust and efficient algorithms for the joint sparse recovery problem in compressed sensing, which simultaneously recover the supports of jointly sparse signals from their multiple measurement vectors obtained through a common…

Information Theory · Computer Science 2016-11-17 Kiryung Lee , Yoram Bresler , Marius Junge

Sparse representation of a single measurement vector (SMV) has been explored in a variety of compressive sensing applications. Recently, SMV models have been extended to solve multiple measurement vectors (MMV) problems, where the…

Optimization and Control · Mathematics 2020-08-25 Jing Qin , Shuang Li , Deanna Needell , Anna Ma , Rachel Grotheer , Chenxi Huang , Natalie Durgin

In this paper, we address the sparse multiple measurement vector (MMV) problem where the objective is to recover a set of sparse nonzero row vectors or indices of a signal matrix from incomplete measurements. Ideally, regardless of the…

Information Theory · Computer Science 2016-01-27 Kyung Su Kim , Sae-Young Chung

Multiple measurement vector (MMV) problem addresses the identification of unknown input vectors that share common sparse support. The MMV problems had been traditionally addressed either by sensor array signal processing or compressive…

Information Theory · Computer Science 2011-06-02 Jong Min Kim , Ok Kyun Lee , Jong Chul Ye

The multiple measurement vector problem (MMV) is a generalization of the compressed sensing problem that addresses the recovery of a set of jointly sparse signal vectors. One of the important contributions of this paper is to reveal that…

Information Theory · Computer Science 2016-01-20 Jong Chul Ye , Jong Min Kim , Yoram Bresler

In this paper we revisit the sparse multiple measurement vector (MMV) problem where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurements. This problem has received increasing interest as an…

Information Theory · Computer Science 2015-03-14 Mike E. Davies , Yonina C. Eldar

Discrete multiple signal classification (MUSIC) with its low computational cost and mild condition requirement becomes a significant noniterative algorithm for joint sparse recovery (JSR). However, it fails in rank defective problem caused…

Information Theory · Computer Science 2017-05-29 Zaidao Wen , Biao Hou , Licheng Jiao

In this report, a novel efficient algorithm for recovery of jointly sparse signals (sparse matrix) from multiple incomplete measurements has been presented, in particular, the NESTA-based MMV optimization method. In a nutshell, the jointly…

Information Theory · Computer Science 2009-05-21 Lianlin Li , Fang Li

The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an extension of the single-measurement-vector (SMV) problem widely…

Information Theory · Computer Science 2018-08-23 Ewout van den Berg , Michael P. Friedlander

This paper proposes a new algorithm for multiple sparse regression in high dimensions, where the task is to estimate the support and values of several (typically related) sparse vectors from a few noisy linear measurements. Our algorithm is…

Machine Learning · Statistics 2012-06-08 Ali Jalali , Sujay Sanghavi

We consider multichannel sparse recovery problem where the objective is to find good recovery of jointly sparse unknown signal vectors from the given multiple measurement vectors which are different linear combinations of the same known…

Information Theory · Computer Science 2015-06-11 Esa Ollila

Sparse signal recoveries from multiple measurement vectors (MMV) with joint sparsity property have many applications in signal, image, and video processing. The problem becomes much more involved when snapshots of the signal matrix are…

Information Theory · Computer Science 2021-01-25 Ningning Han , Shidong Li , Jian Lu

Greedy algorithms are popular in compressive sensing for their high computational efficiency. But the performance of current greedy algorithms can be degenerated seriously by noise (both multiplicative noise and additive noise). A robust…

Information Theory · Computer Science 2014-02-10 Yurrit Avonds , Yipeng Liu , Sabine Van Huffel

This paper studies the joint support recovery of similar sparse vectors on the basis of a limited number of noisy linear measurements, i.e., in a multiple measurement vector (MMV) model. The additive noise signals on each measurement vector…

Information Theory · Computer Science 2015-06-18 J. F. Determe , J. Louveaux , L. Jacques , F. Horlin

We consider a generalization of the multiple measurement vector (MMV) problem, where the measurement matrices are allowed to differ across measurements. This problem arises naturally when multiple measurements are taken over time, e.g., and…

Information Theory · Computer Science 2012-10-09 Reinhard Heckel , Helmut Bölcskei

Greedy Pursuits are very popular in Compressed Sensing for sparse signal recovery. Though many of the Greedy Pursuits possess elegant theoretical guarantees for performance, it is well known that their performance depends on the statistical…

Applications · Statistics 2012-06-20 Sooraj K. Ambat , Saikat Chatterjee , K. V. S. Hari

The multiple measurement vector (MMV) problem addresses the identification of unknown input vectors that share common sparse support. Even though MMV problems had been traditionally addressed within the context of sensor array signal…

Information Theory · Computer Science 2011-04-05 Jong Min Kim , Ok Kyun Lee , Jong Chul Ye

Frequency recovery/estimation from discrete samples of superimposed sinusoidal signals is a classic yet important problem in statistical signal processing. Its research has recently been advanced by atomic norm techniques which exploit…

Information Theory · Computer Science 2016-05-31 Zai Yang , Lihua Xie

We consider the recovery of sparse signals that share a common support from multiple measurement vectors. The performance of several algorithms developed for this task depends on parameters like dimension of the sparse signal, dimension of…

Methodology · Statistics 2015-04-08 Deepa K. G. , Sooraj K. Ambat , K. V. S. Hari

This paper considers a recently emerged hyperspectral unmixing formulation based on sparse regression of a self-dictionary multiple measurement vector (SD-MMV) model, wherein the measured hyperspectral pixels are used as the dictionary.…

Machine Learning · Statistics 2015-10-28 Xiao Fu , Wing-Kin Ma , Tsung-Han Chan , José M. Bioucas-Dias
‹ Prev 1 2 3 10 Next ›