1,861 research outputs found
Time-resolved magnetic sensing with electronic spins in diamond
Quantum probes can measure time-varying fields with high sensitivity and
spatial resolution, enabling the study of biological, material, and physical
phenomena at the nanometer scale. In particular, nitrogen-vacancy centers in
diamond have recently emerged as promising sensors of magnetic and electric
fields. Although coherent control techniques have measured the amplitude of
constant or oscillating fields, these techniques are not suitable for measuring
time-varying fields with unknown dynamics. Here we introduce a coherent
acquisition method to accurately reconstruct the temporal profile of
time-varying fields using Walsh sequences. These decoupling sequences act as
digital filters that efficiently extract spectral coefficients while
suppressing decoherence, thus providing improved sensitivity over existing
strategies. We experimentally reconstruct the magnetic field radiated by a
physical model of a neuron using a single electronic spin in diamond and
discuss practical applications. These results will be useful to implement
time-resolved magnetic sensing with quantum probes at the nanometer scale.Comment: 8+12 page
Signal Recovery in Perturbed Fourier Compressed Sensing
In many applications in compressed sensing, the measurement matrix is a
Fourier matrix, i.e., it measures the Fourier transform of the underlying
signal at some specified `base' frequencies , where is the
number of measurements. However due to system calibration errors, the system
may measure the Fourier transform at frequencies
that are different from the base frequencies and where
are unknown. Ignoring perturbations of this nature can lead to major errors in
signal recovery. In this paper, we present a simple but effective alternating
minimization algorithm to recover the perturbations in the frequencies \emph{in
situ} with the signal, which we assume is sparse or compressible in some known
basis. In many cases, the perturbations can be expressed
in terms of a small number of unique parameters . We demonstrate that
in such cases, the method leads to excellent quality results that are several
times better than baseline algorithms (which are based on existing off-grid
methods in the recent literature on direction of arrival (DOA) estimation,
modified to suit the computational problem in this paper). Our results are also
robust to noise in the measurement values. We also provide theoretical results
for (1) the convergence of our algorithm, and (2) the uniqueness of its
solution under some restrictions.Comment: New theortical results about uniqueness and convergence now included.
More challenging experiments now include
Modulated Unit-Norm Tight Frames for Compressed Sensing
In this paper, we propose a compressed sensing (CS) framework that consists
of three parts: a unit-norm tight frame (UTF), a random diagonal matrix and a
column-wise orthonormal matrix. We prove that this structure satisfies the
restricted isometry property (RIP) with high probability if the number of
measurements for -sparse signals of length
and if the column-wise orthonormal matrix is bounded. Some existing structured
sensing models can be studied under this framework, which then gives tighter
bounds on the required number of measurements to satisfy the RIP. More
importantly, we propose several structured sensing models by appealing to this
unified framework, such as a general sensing model with arbitrary/determinisic
subsamplers, a fast and efficient block compressed sensing scheme, and
structured sensing matrices with deterministic phase modulations, all of which
can lead to improvements on practical applications. In particular, one of the
constructions is applied to simplify the transceiver design of CS-based channel
estimation for orthogonal frequency division multiplexing (OFDM) systems.Comment: submitted to IEEE Transactions on Signal Processin
Frequency-splitting Dynamic MRI Reconstruction using Multi-scale 3D Convolutional Sparse Coding and Automatic Parameter Selection
Department of Computer Science and EngineeringIn this thesis, we propose a novel image reconstruction algorithm using multi-scale 3D con- volutional sparse coding and a spectral decomposition technique for highly undersampled dy- namic Magnetic Resonance Imaging (MRI) data. The proposed method recovers high-frequency information using a shared 3D convolution-based dictionary built progressively during the re- construction process in an unsupervised manner, while low-frequency information is recovered using a total variation-based energy minimization method that leverages temporal coherence in dynamic MRI. Additionally, the proposed 3D dictionary is built across three different scales to more efficiently adapt to various feature sizes, and elastic net regularization is employed to promote a better approximation to the sparse input data. Furthermore, the computational com- plexity of each component in our iterative method is analyzed. We also propose an automatic parameter selection technique based on a genetic algorithm to find optimal parameters for our numerical solver which is a variant of the alternating direction method of multipliers (ADMM). We demonstrate the performance of our method by comparing it with state-of-the-art methods on 15 single-coil cardiac, 7 single-coil DCE, and a multi-coil brain MRI datasets at different sampling rates (12.5%, 25% and 50%). The results show that our method significantly outper- forms the other state-of-the-art methods in reconstruction quality with a comparable running time and is resilient to noise.ope
Compressed Sensing and Parallel Acquisition
Parallel acquisition systems arise in various applications in order to
moderate problems caused by insufficient measurements in single-sensor systems.
These systems allow simultaneous data acquisition in multiple sensors, thus
alleviating such problems by providing more overall measurements. In this work
we consider the combination of compressed sensing with parallel acquisition. We
establish the theoretical improvements of such systems by providing recovery
guarantees for which, subject to appropriate conditions, the number of
measurements required per sensor decreases linearly with the total number of
sensors. Throughout, we consider two different sampling scenarios -- distinct
(corresponding to independent sampling in each sensor) and identical
(corresponding to dependent sampling between sensors) -- and a general
mathematical framework that allows for a wide range of sensing matrices (e.g.,
subgaussian random matrices, subsampled isometries, random convolutions and
random Toeplitz matrices). We also consider not just the standard sparse signal
model, but also the so-called sparse in levels signal model. This model
includes both sparse and distributed signals and clustered sparse signals. As
our results show, optimal recovery guarantees for both distinct and identical
sampling are possible under much broader conditions on the so-called sensor
profile matrices (which characterize environmental conditions between a source
and the sensors) for the sparse in levels model than for the sparse model. To
verify our recovery guarantees we provide numerical results showing phase
transitions for a number of different multi-sensor environments.Comment: 43 pages, 4 figure
Structured random measurements in signal processing
Compressed sensing and its extensions have recently triggered interest in
randomized signal acquisition. A key finding is that random measurements
provide sparse signal reconstruction guarantees for efficient and stable
algorithms with a minimal number of samples. While this was first shown for
(unstructured) Gaussian random measurement matrices, applications require
certain structure of the measurements leading to structured random measurement
matrices. Near optimal recovery guarantees for such structured measurements
have been developed over the past years in a variety of contexts. This article
surveys the theory in three scenarios: compressed sensing (sparse recovery),
low rank matrix recovery, and phaseless estimation. The random measurement
matrices to be considered include random partial Fourier matrices, partial
random circulant matrices (subsampled convolutions), matrix completion, and
phase estimation from magnitudes of Fourier type measurements. The article
concludes with a brief discussion of the mathematical techniques for the
analysis of such structured random measurements.Comment: 22 pages, 2 figure
- …