English
Related papers

Related papers: Stable and robust sampling strategies for compress…

200 papers

Recently, it has been shown that incoherence is an unrealistic assumption for compressed sensing when applied to many inverse problems. Instead, the key property that permits efficient recovery in such problems is so-called local…

Information Theory · Computer Science 2015-07-09 Alex D. Jones , Ben Adcock , Anders C. Hansen

Recently it has been established that asymptotic incoherence can be used to facilitate subsampling, in order to optimize reconstruction quality, in a variety of continuous compressed sensing problems, and the coherence structure of certain…

Information Theory · Computer Science 2016-10-25 Alex Jones , Ben Adcock , Anders Hansen

We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on l1 minimization encompasses the case where (i) the measurements are block-structured samples in order…

Information Theory · Computer Science 2020-05-22 Ben Adcock , Claire Boyer , Simone Brugiapaglia

We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution…

Information Theory · Computer Science 2011-09-29 Gilles Puy , Pierre Vandergheynst , Yves Wiaux

In compressed sensing, it is often desirable to consider signals possessing additional structure beyond sparsity. One such structured signal model - which forms the focus of this paper - is the local sparsity in levels class. This class has…

Information Theory · Computer Science 2017-06-05 Chen Li , Ben Adcock

This note complements the paper "The quest for optimal sampling: Computationally efficient, structure-exploiting measurements for compressed sensing" [2]. Its purpose is to present a proof of a result stated therein concerning the recovery…

Functional Analysis · Mathematics 2014-06-17 Ben Adcock , Anders C. Hansen , Bogdan Roman

We give a new, very general, formulation of the compressed sensing problem in terms of coordinate projections of an analytic variety, and derive sufficient sampling rates for signal reconstruction. Our bounds are linear in the coherence of…

Machine Learning · Computer Science 2013-11-05 Franz J. Király , Louis Theran

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li

Compressed sensing provided a data-acquisition paradigm for sparse signals. Remarkably, it has been shown that practical algorithms provide robust recovery from noisy linear measurements acquired at a near optimal sampling rate. In many…

Information Theory · Computer Science 2017-08-03 Kiryung Lee , Yanjun Li , Kyong Hwan Jin , Jong Chul Ye

The structure of Magnetic Resonance Images (MRI) and especially their compressibility in an appropriate representation basis enables the application of the compressive sensing theory, which guarantees exact image recovery from incomplete…

Statistics Theory · Mathematics 2013-07-26 Nicolas Chauffert , Philippe Ciuciu , Pierre Weiss

This thesis consists of original contributions in the area of digital signal processing. The reconstruction of signals sparse (highly concentrated) in various transform domains is the primary problem analyzed in the thesis. The considered…

Signal Processing · Electrical Eng. & Systems 2019-09-19 Milos Brajovic

This paper presents an adaptive and intelligent sparse model for digital image sampling and recovery. In the proposed sampler, we adaptively determine the number of required samples for retrieving image based on space-frequency-gradient…

Computer Vision and Pattern Recognition · Computer Science 2017-11-27 Ali Taimori , Farokh Marvasti

Reducing acquisition time is a crucial challenge for many imaging techniques. Compressed Sensing (CS) theory offers an appealing framework to address this issue since it provides theoretical guarantees on the reconstruction of sparse…

Applications · Statistics 2014-07-17 Nicolas Chauffert , Philippe Ciuciu , Jonas Kahn , Pierre Weiss

This paper introduces a novel framework and corresponding methods for sampling and reconstruction of sparse signals in shift-invariant (SI) spaces. We reinterpret the random demodulator, a system that acquires sparse bandlimited signals, as…

Signal Processing · Electrical Eng. & Systems 2022-01-24 Tin Vlašić , Damir Seršić

The problem of recovering signals of high complexity from low quality sensing devices is analyzed via a combination of tools from signal processing and harmonic analysis. By using the rich structure offered by the recent development in…

Information Theory · Computer Science 2020-03-16 Roza Aceska , Jean-Luc Bouchot , Shidong Li

Compressed sensing is a theory which guarantees the exact recovery of sparse signals from a small number of linear projections. The sampling schemes suggested by current compressed sensing theories are often of little practical relevance…

Information Theory · Computer Science 2014-07-22 Jérémie Bigot , Claire Boyer , Pierre Weiss

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…

Information Theory · Computer Science 2015-10-28 Sohail Bahmani , Justin Romberg

We demonstrate that sub-wavelength optical images borne on partially-spatially-incoherent light can be recovered, from their far-field or from the blurred image, given the prior knowledge that the image is sparse, and only that. The…

Information Theory · Computer Science 2015-05-27 Yoav Shechtman , Yonina C. Eldar , Alexander Szameit , Mordechai Segev

Compressive Sensing (CS) theory shows that a signal can be decoded from many fewer measurements than suggested by the Nyquist sampling theory, when the signal is sparse in some domain. Most of conventional CS recovery approaches, however,…

Computer Vision and Pattern Recognition · Computer Science 2014-04-30 Jian Zhang , Debin Zhao , Feng Jiang , Wen Gao

A different compressive sensing framework, convolution with white noise waveform followed by subsampling at fixed (not randomly selected) locations, is studied in this paper. We show that its recoverability for sparse signals depends on the…

Optimization and Control · Mathematics 2009-09-30 Yin Xiang , Lianlin Li , Fang Li
‹ Prev 1 2 3 10 Next ›