English
Related papers

Related papers: Lipschitz Learning for Signal Recovery

200 papers

In many applications, the observations can be represented as a signal defined over the vertices of a graph. The analysis of such signals requires the extension of standard signal processing tools. In this work, first, we provide a class of…

Discrete Mathematics · Computer Science 2016-08-24 Mikhail Tsitsvero , Sergio Barbarossa , Paolo Di Lorenzo

Compressed Sensing (CS) is an effective approach to reduce the required number of samples for reconstructing a sparse signal in an a priori basis, but may suffer severely from the issue of basis mismatch. In this paper we study the problem…

Information Theory · Computer Science 2014-02-04 Yuejie Chi

Compressive sensing (CS) is a technique for estimating a sparse signal from the random measurements and the measurement matrix. Traditional sparse signal recovery methods have seriously degeneration with the measurement matrix uncertainty…

Information Theory · Computer Science 2011-06-21 Yipeng Liu , Qun Wan , Fei Wen , Jia Xu , Yingning Peng

In applications ranging from communications to genetics, signals can be modeled as lying in a union of subspaces. Under this model, signal coefficients that lie in certain subspaces are active or inactive together. The potential subspaces…

Machine Learning · Statistics 2012-09-17 Nikhil Rao , Benjamin Recht , Robert Nowak

Sparse modeling has been widely and successfully used in many applications such as computer vision, machine learning, and pattern recognition. Accompanied with those applications, significant research has studied the theoretical limits and…

Information Theory · Computer Science 2016-10-04 Yuki Itoh , Marco F. Duarte , Mario Parente

Compressed sensing has demonstrated that a general signal $\boldsymbol{x} \in \mathbb{F}^n$ ($\mathbb{F}\in \{\mathbb{R},\mathbb{C}\}$) can be estimated from few linear measurements with an error {proportional to} the best $k$-term…

Functional Analysis · Mathematics 2025-10-28 Yu Xia , Zhiqiang Xu

We consider finite frames with high redundancy so that if half the terms transmitted from the sender are randomly deleted during transmission, then on average, the receiver can still recover the signal to within a high level of accuracy.…

Functional Analysis · Mathematics 2013-12-10 Enrico Au-Yeung

In many data acquisition systems it is common to observe signals whose amplitudes have been clipped. We present two new algorithms for recovering a clipped signal by leveraging the model assumption that the underlying signal is sparse in…

Information Theory · Computer Science 2011-10-25 Alejandro J. Weinstein , Michael B. Wakin

Orthogonal least square (OLS) is an important sparse signal recovery algorithm for compressive sensing, which enjoys superior probability of success over other well-known recovery algorithms under conditions of correlated measurement…

Information Theory · Computer Science 2018-08-02 Samrat Mukhopadhyay , Siddhartha Satpathi , Mrityunjoy Chakraborty

We demonstrate that a sparse signal can be estimated from the phase of complex random measurements, in a "phase-only compressive sensing" (PO-CS) scenario. With high probability and up to a global unknown amplitude, we can perfectly recover…

Information Theory · Computer Science 2020-11-13 Laurent Jacques , Thomas Feuillen

This letter is focused on quantized Compressed Sensing, assuming that Lasso is used for signal estimation. Leveraging recent work, we provide a framework to optimize the quantization function and show that the recovered signal converges to…

Information Theory · Computer Science 2016-06-10 Xiaoyi Gu , Shenyinying Tu , Hao-Jun Michael Shi , Mindy Case , Deanna Needell , Yaniv Plan

From many fewer acquired measurements than suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that, a signal can be reconstructed with high probability when it exhibits sparsity in some domain. Most of…

Computer Vision and Pattern Recognition · Computer Science 2014-05-01 Jian Zhang , Chen Zhao , Debin Zhao , Wen Gao

Recovering an unknown but structured signal from its measurements is a challenging problem with significant applications in fields such as imaging restoration, wireless communications, and signal processing. In this paper, we consider the…

Information Theory · Computer Science 2026-01-09 Yijun Zhong , Yi Shen

In this paper, we consider the block-sparse signals recovery problem in the context of multiple measurement vectors (MMV) with common row sparsity patterns. We develop a new method for recovery of common row sparsity MMV signals, where a…

Machine Learning · Computer Science 2017-11-07 Hang Xiao , Zhengli Xing , Linxiao Yang , Jun Fang , Yanlun Wu

As technology grows, higher frequency signals are required to be processed in various applications. In order to digitize such signals, conventional analog to digital convertors are facing implementation challenges due to the higher sampling…

Information Theory · Computer Science 2014-11-27 Amir Zandieh , Alireza Zareian , Masoumeh Azghani , Farokh Marvasti

Multilinear Compressive Learning (MCL) is an efficient signal acquisition and learning paradigm for multidimensional signals. The level of signal compression affects the detection or classification performance of a MCL model, with higher…

Computer Vision and Pattern Recognition · Computer Science 2021-09-06 Dat Thanh Tran , Moncef Gabbouj , Alexandros Iosifidis

Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is…

Information Theory · Computer Science 2015-07-24 Yuanxin Li , Yuejie Chi

The problem of recovering a signal from its low frequency components occurs often in practical applications due to the lowpass behavior of many physical systems. Here we study in detail conditions under which a signal can be determined from…

Information Theory · Computer Science 2013-02-20 Yonina C. Eldar , Volker Pohl

This work considers recovery of signals that are sparse over two bases. For instance, a signal might be sparse in both time and frequency, or a matrix can be low rank and sparse simultaneously. To facilitate recovery, we consider minimizing…

Information Theory · Computer Science 2012-02-17 Samet Oymak , Babak Hassibi

Compressive sensing has been receiving a great deal of interest from researchers in many areas because of its ability in speeding up data acquisition. This framework allows fast signal acquisition and compression when signals are sparse in…

Information Theory · Computer Science 2020-03-17 Fatima Salahdine , Elias Ghribi , Naima Kaabouch