363 research outputs found
TV-min and Greedy Pursuit for Constrained Joint Sparsity and Application to Inverse Scattering
This paper proposes a general framework for compressed sensing of constrained
joint sparsity (CJS) which includes total variation minimization (TV-min) as an
example. TV- and 2-norm error bounds, independent of the ambient dimension, are
derived for the CJS version of Basis Pursuit and Orthogonal Matching Pursuit.
As an application the results extend Cand`es, Romberg and Tao's proof of exact
recovery of piecewise constant objects with noiseless incomplete Fourier data
to the case of noisy data.Comment: Mathematics and Mechanics of Complex Systems (2013
Compressed Sensing of Analog Signals in Shift-Invariant Spaces
A traditional assumption underlying most data converters is that the signal
should be sampled at a rate exceeding twice the highest frequency. This
statement is based on a worst-case scenario in which the signal occupies the
entire available bandwidth. In practice, many signals are sparse so that only
part of the bandwidth is used. In this paper, we develop methods for low-rate
sampling of continuous-time sparse signals in shift-invariant (SI) spaces,
generated by m kernels with period T. We model sparsity by treating the case in
which only k out of the m generators are active, however, we do not know which
k are chosen. We show how to sample such signals at a rate much lower than m/T,
which is the minimal sampling rate without exploiting sparsity. Our approach
combines ideas from analog sampling in a subspace with a recently developed
block diagram that converts an infinite set of sparse equations to a finite
counterpart. Using these two components we formulate our problem within the
framework of finite compressed sensing (CS) and then rely on algorithms
developed in that context. The distinguishing feature of our results is that in
contrast to standard CS, which treats finite-length vectors, we consider
sampling of analog signals for which no underlying finite-dimensional model
exists. The proposed framework allows to extend much of the recent literature
on CS to the analog domain.Comment: to appear in IEEE Trans. on Signal Processin
Compressive Imaging Using RIP-Compliant CMOS Imager Architecture and Landweber Reconstruction
In this paper, we present a new image sensor architecture for fast and accurate compressive sensing (CS) of natural images. Measurement matrices usually employed in CS CMOS image sensors are recursive pseudo-random binary matrices. We have proved that the restricted isometry property of these matrices is limited by a low sparsity constant. The quality of these matrices is also affected by the non-idealities of pseudo-random number generators (PRNG). To overcome these limitations, we propose a hardware-friendly pseudo-random ternary measurement matrix generated on-chip by means of class III elementary cellular automata (ECA). These ECA present a chaotic behavior that emulates random CS measurement matrices better than other PRNG. We have combined this new architecture with a block-based CS smoothed-projected Landweber reconstruction algorithm. By means of single value decomposition, we have adapted this algorithm to perform fast and precise reconstruction while operating with binary and ternary matrices. Simulations are provided to qualify the approach.Ministerio de Economía y Competitividad TEC2015-66878-C3-1-RJunta de Andalucía TIC 2338-2013Office of Naval Research (USA) N000141410355European Union H2020 76586
Sparse and random sampling techniques for high-resolution, full-field, bss-based structural dynamics identification from video
Video-based techniques for identification of structural dynamics have the advantage that they are very inexpensive to deploy compared to conventional accelerometer or strain gauge techniques. When structural dynamics from video is accomplished using full-field, high-resolution analysis techniques utilizing algorithms on the pixel time series such as principal components analysis and solutions to blind source separation the added benefit of high-resolution, full-field modal identification is achieved. An important property of video of vibrating structures is that it is particularly sparse. Typically video of vibrating structures has a dimensionality consisting of many thousands or even millions of pixels and hundreds to thousands of frames. However the motion of the vibrating structure can be described using only a few mode shapes and their associated time series. As a result, emerging techniques for sparse and random sampling such as compressive sensing should be applicable to performing modal identification on video. This work presents how full-field, high-resolution, structural dynamics identification frameworks can be coupled with compressive sampling. The techniques described in this work are demonstrated to be able to recover mode shapes from experimental video of vibrating structures when 70% to 90% of the frames from a video captured in the conventional manner are removed
Optimal Phase Transitions in Compressed Sensing
Compressed sensing deals with efficient recovery of analog signals from
linear encodings. This paper presents a statistical study of compressed sensing
by modeling the input signal as an i.i.d. process with known distribution.
Three classes of encoders are considered, namely optimal nonlinear, optimal
linear and random linear encoders. Focusing on optimal decoders, we investigate
the fundamental tradeoff between measurement rate and reconstruction fidelity
gauged by error probability and noise sensitivity in the absence and presence
of measurement noise, respectively. The optimal phase transition threshold is
determined as a functional of the input distribution and compared to suboptimal
thresholds achieved by popular reconstruction algorithms. In particular, we
show that Gaussian sensing matrices incur no penalty on the phase transition
threshold with respect to optimal nonlinear encoding. Our results also provide
a rigorous justification of previous results based on replica heuristics in the
weak-noise regime.Comment: to appear in IEEE Transactions of Information Theor
- …