28,086 research outputs found
Efficient high-dimensional entanglement imaging with a compressive sensing, double-pixel camera
We implement a double-pixel, compressive sensing camera to efficiently
characterize, at high resolution, the spatially entangled fields produced by
spontaneous parametric downconversion. This technique leverages sparsity in
spatial correlations between entangled photons to improve acquisition times
over raster-scanning by a scaling factor up to n^2/log(n) for n-dimensional
images. We image at resolutions up to 1024 dimensions per detector and
demonstrate a channel capacity of 8.4 bits per photon. By comparing the
classical mutual information in conjugate bases, we violate an entropic
Einstein-Podolsky-Rosen separability criterion for all measured resolutions.
More broadly, our result indicates compressive sensing can be especially
effective for higher-order measurements on correlated systems.Comment: 10 pages, 7 figure
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed
sensing and sparse binomial regression. We show that a single convex program
gives an accurate estimate of the signal, or coefficient vector, for both of
these models. We demonstrate that an s-sparse signal in R^n can be accurately
estimated from m = O(slog(n/s)) single-bit measurements using a simple convex
program. This remains true even if each measurement bit is flipped with
probability nearly 1/2. Worst-case (adversarial) noise can also be accounted
for, and uniform results that hold for all sparse inputs are derived as well.
In the terminology of sparse logistic regression, we show that O(slog(n/s))
Bernoulli trials are sufficient to estimate a coefficient vector in R^n which
is approximately s-sparse. Moreover, the same convex program works for
virtually all generalized linear models, in which the link function may be
unknown. To our knowledge, these are the first results that tie together the
theory of sparse logistic regression to 1-bit compressed sensing. Our results
apply to general signal structures aside from sparsity; one only needs to know
the size of the set K where signals reside. The size is given by the mean width
of K, a computable quantity whose square serves as a robust extension of the
dimension.Comment: 25 pages, 1 figure, error fixed in Lemma 4.
Accelerated Cardiac Diffusion Tensor Imaging Using Joint Low-Rank and Sparsity Constraints
Objective: The purpose of this manuscript is to accelerate cardiac diffusion
tensor imaging (CDTI) by integrating low-rankness and compressed sensing.
Methods: Diffusion-weighted images exhibit both transform sparsity and
low-rankness. These properties can jointly be exploited to accelerate CDTI,
especially when a phase map is applied to correct for the phase inconsistency
across diffusion directions, thereby enhancing low-rankness. The proposed
method is evaluated both ex vivo and in vivo, and is compared to methods using
either a low-rank or sparsity constraint alone. Results: Compared to using a
low-rank or sparsity constraint alone, the proposed method preserves more
accurate helix angle features, the transmural continuum across the myocardium
wall, and mean diffusivity at higher acceleration, while yielding significantly
lower bias and higher intraclass correlation coefficient. Conclusion:
Low-rankness and compressed sensing together facilitate acceleration for both
ex vivo and in vivo CDTI, improving reconstruction accuracy compared to
employing either constraint alone. Significance: Compared to previous methods
for accelerating CDTI, the proposed method has the potential to reach higher
acceleration while preserving myofiber architecture features which may allow
more spatial coverage, higher spatial resolution and shorter temporal footprint
in the future.Comment: 11 pages, 16 figures, published on IEEE Transactions on Biomedical
Engineerin
Exact Performance Analysis of the Oracle Receiver for Compressed Sensing Reconstruction
A sparse or compressible signal can be recovered from a certain number of
noisy random projections, smaller than what dictated by classic Shannon/Nyquist
theory. In this paper, we derive the closed-form expression of the mean square
error performance of the oracle receiver, knowing the sparsity pattern of the
signal. With respect to existing bounds, our result is exact and does not
depend on a particular realization of the sensing matrix. Moreover, our result
holds irrespective of whether the noise affecting the measurements is white or
correlated. Numerical results show a perfect match between equations and
simulations, confirming the validity of the result.Comment: To be published in ICASSP 2014 proceeding
Joint recovery algorithms using difference of innovations for distributed compressed sensing
Distributed compressed sensing is concerned with representing an ensemble of
jointly sparse signals using as few linear measurements as possible. Two novel
joint reconstruction algorithms for distributed compressed sensing are
presented in this paper. These algorithms are based on the idea of using one of
the signals as side information; this allows to exploit joint sparsity in a
more effective way with respect to existing schemes. They provide gains in
reconstruction quality, especially when the nodes acquire few measurements, so
that the system is able to operate with fewer measurements than is required by
other existing schemes. We show that the algorithms achieve better performance
with respect to the state-of-the-art.Comment: Conference Record of the Forty Seventh Asilomar Conference on
Signals, Systems and Computers (ASILOMAR), 201
- …