Results 241 to 250 of about 136,882 (282)
Some of the next articles are maybe not open access.
IEEE Transactions on Signal Processing, 2009
Compressive sensing (CS) is a framework whereby one performs N nonadaptive measurements to constitute a vector v isin RN used to recover an approximation u isin RM desired signal u isin RM with N 1 sets of compressive measurements {vi}i=1,L are performed, each of the associated {ui}i=1,Lare recovered one at a time, independently. In many applications
Shihao Ji 0001 +2 more
openaire +1 more source
Compressive sensing (CS) is a framework whereby one performs N nonadaptive measurements to constitute a vector v isin RN used to recover an approximation u isin RM desired signal u isin RM with N 1 sets of compressive measurements {vi}i=1,L are performed, each of the associated {ui}i=1,Lare recovered one at a time, independently. In many applications
Shihao Ji 0001 +2 more
openaire +1 more source
Decentralized compressive sensing
2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010Motivated by sensor network applications, in this paper we study the problem of a decentralized network of J sensors, in which each sensor observes either all or some components of an underlying sparse signal ensemble. Sensors operate with no collaboration with each other or the fusion center.
Delaram Motamedvaziri +2 more
openaire +1 more source
IEEE Transactions on Information Theory, 2006
Summary: Suppose \(x\) is an unknown vector in \(\mathbb R^m\) (a digital image or signal); we plan to measure \(n\) general linear functionals of \(x\) and then reconstruct. If \(x\) is known to be compressible by transform coding with a known transform, and we reconstruct via the nonlinear procedure defined here, the number of measurements \(n\) can ...
openaire +1 more source
Summary: Suppose \(x\) is an unknown vector in \(\mathbb R^m\) (a digital image or signal); we plan to measure \(n\) general linear functionals of \(x\) and then reconstruct. If \(x\) is known to be compressible by transform coding with a known transform, and we reconstruct via the nonlinear procedure defined here, the number of measurements \(n\) can ...
openaire +1 more source
IEEE Signal Processing Magazine, 2008
This article reviews the requirements for successful compressed sensing (CS), describes their natural fit to MRI, and gives examples of four interesting applications of CS in MRI. The authors emphasize on an intuitive understanding of CS by describing the CS reconstruction as a process of interference cancellation.
Michael Lustig +3 more
openaire +1 more source
This article reviews the requirements for successful compressed sensing (CS), describes their natural fit to MRI, and gives examples of four interesting applications of CS in MRI. The authors emphasize on an intuitive understanding of CS by describing the CS reconstruction as a process of interference cancellation.
Michael Lustig +3 more
openaire +1 more source
Circuits, Systems, and Signal Processing, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2013 IEEE International Conference on Image Processing, 2013
Compressive sensing allows us to recover signals that are linearly sparse in some basis from a smaller number of measurements than traditionally required. However, it has been shown that many classes of images or video can be more efficiently modeled as lying on a nonlinear manifold, and hence described as a non-linear function of a few underlying ...
Farhad Pourkamali-Anaraki +1 more
openaire +1 more source
Compressive sensing allows us to recover signals that are linearly sparse in some basis from a smaller number of measurements than traditionally required. However, it has been shown that many classes of images or video can be more efficiently modeled as lying on a nonlinear manifold, and hence described as a non-linear function of a few underlying ...
Farhad Pourkamali-Anaraki +1 more
openaire +1 more source
2017
We consider the problem of sparse signal recovery in dynamic sensing scenarios. Specifically, we study the recovery of a sparse time-varying signal from linear measurements of a single static sensor that are taken at two different points in time. This setup can be modelled as observing a single signal using two different sensors – a real one and a ...
Dalitz, Robert +2 more
openaire +1 more source
We consider the problem of sparse signal recovery in dynamic sensing scenarios. Specifically, we study the recovery of a sparse time-varying signal from linear measurements of a single static sensor that are taken at two different points in time. This setup can be modelled as observing a single signal using two different sensors – a real one and a ...
Dalitz, Robert +2 more
openaire +1 more source
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008
A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N by N grid. Assuming that the number of targets K is small (i.e. KLtN2), then we can transmit a sufficiently ldquoincoherentrdquo pulse and employ the techniques of compressed sensing to reconstruct the target scene.
Matthew A. Herman, Thomas Strohmer
openaire +1 more source
A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N by N grid. Assuming that the number of targets K is small (i.e. KLtN2), then we can transmit a sufficiently ldquoincoherentrdquo pulse and employ the techniques of compressed sensing to reconstruct the target scene.
Matthew A. Herman, Thomas Strohmer
openaire +1 more source
2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2014
The effect of off-grid atoms has become the prominent problem in application of the Compressed Sensing (CS) techniques to the cases where there is an underlying continuous parametrization. In this work, we develop a generalizing CS framework which shows that sampling to a finite grid is not necessary toward compressive estimation.
Ashkan Panahi, Mats Viberg
openaire +1 more source
The effect of off-grid atoms has become the prominent problem in application of the Compressed Sensing (CS) techniques to the cases where there is an underlying continuous parametrization. In this work, we develop a generalizing CS framework which shows that sampling to a finite grid is not necessary toward compressive estimation.
Ashkan Panahi, Mats Viberg
openaire +1 more source
2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012
In this paper we present a novel compressed sensing (CS) algorithm for the recovery of compressible, possibly time-varying, signal from a sequence of noisy observations. The newly derived scheme is based on the acclaimed unscented Kalman filter (UKF), and is essentially self reliant in the sense that no peripheral optimization or CS algorithm is ...
Avishy Carmi +2 more
openaire +2 more sources
In this paper we present a novel compressed sensing (CS) algorithm for the recovery of compressible, possibly time-varying, signal from a sequence of noisy observations. The newly derived scheme is based on the acclaimed unscented Kalman filter (UKF), and is essentially self reliant in the sense that no peripheral optimization or CS algorithm is ...
Avishy Carmi +2 more
openaire +2 more sources