1,171 research outputs found
Structured Sparsity Models for Multiparty Speech Recovery from Reverberant Recordings
We tackle the multi-party speech recovery problem through modeling the
acoustic of the reverberant chambers. Our approach exploits structured sparsity
models to perform room modeling and speech recovery. We propose a scheme for
characterizing the room acoustic from the unknown competing speech sources
relying on localization of the early images of the speakers by sparse
approximation of the spatial spectra of the virtual sources in a free-space
model. The images are then clustered exploiting the low-rank structure of the
spectro-temporal components belonging to each source. This enables us to
identify the early support of the room impulse response function and its unique
map to the room geometry. To further tackle the ambiguity of the reflection
ratios, we propose a novel formulation of the reverberation model and estimate
the absorption coefficients through a convex optimization exploiting joint
sparsity model formulated upon spatio-spectral sparsity of concurrent speech
representation. The acoustic parameters are then incorporated for separating
individual speech signals through either structured sparse recovery or inverse
filtering the acoustic channels. The experiments conducted on real data
recordings demonstrate the effectiveness of the proposed approach for
multi-party speech recovery and recognition.Comment: 31 page
Perceptual Compressive Sensing
Compressive sensing (CS) works to acquire measurements at sub-Nyquist rate
and recover the scene images. Existing CS methods always recover the scene
images in pixel level. This causes the smoothness of recovered images and lack
of structure information, especially at a low measurement rate. To overcome
this drawback, in this paper, we propose perceptual CS to obtain high-level
structured recovery. Our task no longer focuses on pixel level. Instead, we
work to make a better visual effect. In detail, we employ perceptual loss,
defined on feature level, to enhance the structure information of the recovered
images. Experiments show that our method achieves better visual results with
stronger structure information than existing CS methods at the same measurement
rate.Comment: Accepted by The First Chinese Conference on Pattern Recognition and
Computer Vision (PRCV 2018). This is a pre-print version (not final version
Partitioned Compressive Sensing with Neighbor-Weighted Decoding
Compressive sensing has gained momentum in recent years as an exciting new theory in signal processing with several useful applications. It states that signals known to have a sparse representation may be encoded and later reconstructed using a small number of measurements, approximately proportional to the signal s sparsity rather than its size. This paper addresses a critical problem that arises when scaling compressive sensing to signals of large length: that the time required for decoding becomes prohibitively long, and that decoding is not easily parallelized. We describe a method for partitioned compressive sensing, by which we divide a large signal into smaller blocks that may be decoded in parallel. However, since this process requires a signi cant increase in the number of measurements needed for exact signal reconstruction, we focus on mitigating artifacts that arise due to partitioning in approximately reconstructed signals. Given an error-prone partitioned decoding, we use large magnitude components that are detected with highest accuracy to in uence the decoding of neighboring blocks, and call this approach neighbor-weighted decoding. We show that, for applications with a prede ned error threshold, our method can be used in conjunction with partitioned compressive sensing to improve decoding speed, requiring fewer additional measurements than unweighted or locally-weighted decoding.Engineering and Applied Science
On Known-Plaintext Attacks to a Compressed Sensing-based Encryption: A Quantitative Analysis
Despite the linearity of its encoding, compressed sensing may be used to
provide a limited form of data protection when random encoding matrices are
used to produce sets of low-dimensional measurements (ciphertexts). In this
paper we quantify by theoretical means the resistance of the least complex form
of this kind of encoding against known-plaintext attacks. For both standard
compressed sensing with antipodal random matrices and recent multiclass
encryption schemes based on it, we show how the number of candidate encoding
matrices that match a typical plaintext-ciphertext pair is so large that the
search for the true encoding matrix inconclusive. Such results on the practical
ineffectiveness of known-plaintext attacks underlie the fact that even
closely-related signal recovery under encoding matrix uncertainty is doomed to
fail.
Practical attacks are then exemplified by applying compressed sensing with
antipodal random matrices as a multiclass encryption scheme to signals such as
images and electrocardiographic tracks, showing that the extracted information
on the true encoding matrix from a plaintext-ciphertext pair leads to no
significant signal recovery quality increase. This theoretical and empirical
evidence clarifies that, although not perfectly secure, both standard
compressed sensing and multiclass encryption schemes feature a noteworthy level
of security against known-plaintext attacks, therefore increasing its appeal as
a negligible-cost encryption method for resource-limited sensing applications.Comment: IEEE Transactions on Information Forensics and Security, accepted for
publication. Article in pres
Deep learning in computational microscopy
We propose to use deep convolutional neural networks (DCNNs) to perform 2D and 3D computational imaging. Specifically, we investigate three different applications. We first try to solve the 3D inverse scattering problem based on learning a huge number of training target and speckle pairs. We also demonstrate a new DCNN architecture to perform Fourier ptychographic Microscopy (FPM) reconstruction, which achieves high-resolution phase recovery with considerably less data than standard FPM. Finally, we employ DCNN models that can predict focused 2D fluorescent microscopic images from blurred images captured at overfocused or underfocused planes.Published versio
Semi fragile audio crypto-watermarking based on sparse sampling with partially decomposed Haar matrix structure
In the recent era the growth of technology is tremendous and at the same time, the misuse of technology is also increasing with an equal scale. Thus the owners have to protect the multimedia data from the malicious and piracy. This has led the researchers to the new era of cryptography and watermarking. In the traditional security algorithm for the audio, the algorithm is implemented on the digital data after the traditional analog to digital conversion. But in this article, we propose the crypto – watermarking algorithm based on sparse sampling to be implemented during the analog to digital conversion process only. The watermark is generated by exploiting the structure of HAAR transform. The performance of the algorithm is tested on various audio signals and the obtained SNR is greater than 30dB and the algorithm results in good robustness against various signal attacks such as echo addition, noise addition, reverberation etc
Shearlet-based compressed sensing for fast 3D cardiac MR imaging using iterative reweighting
High-resolution three-dimensional (3D) cardiovascular magnetic resonance
(CMR) is a valuable medical imaging technique, but its widespread application
in clinical practice is hampered by long acquisition times. Here we present a
novel compressed sensing (CS) reconstruction approach using shearlets as a
sparsifying transform allowing for fast 3D CMR (3DShearCS). Shearlets are
mathematically optimal for a simplified model of natural images and have been
proven to be more efficient than classical systems such as wavelets. Data is
acquired with a 3D Radial Phase Encoding (RPE) trajectory and an iterative
reweighting scheme is used during image reconstruction to ensure fast
convergence and high image quality. In our in-vivo cardiac MRI experiments we
show that the proposed method 3DShearCS has lower relative errors and higher
structural similarity compared to the other reconstruction techniques
especially for high undersampling factors, i.e. short scan times. In this
paper, we further show that 3DShearCS provides improved depiction of cardiac
anatomy (measured by assessing the sharpness of coronary arteries) and two
clinical experts qualitatively analyzed the image quality
- …