Factorization over interpolation: A fast continuous orthogonal matching pursuit

Abstract: We propose a fast greedy algorithm to compute sparse representations of signals from continuous dictionaries that are factorizable, i.e., with atoms that can be separated as a product of sub-atoms.

Keep the phase! Signal recovery in phase-only compressive sensing

Abstract: We demonstrate that a sparse signal can be estimated from the phase of complex random measurements, in a “phase-only compressive sensing” (PO-CS) scenario. With high probability and up to a global unknown amplitude, we can perfectly recover such a signal if the sensing matrix is a complex Gaussian random matrix and the number of measurements is large compared to the signal sparsity.

Morphological components analysis for circumstellar disks imaging

Abstract: Recent developments in astronomical observations enable direct imaging of circumstellar disks. Precise characterization of such extended structure is essential to our understanding of stellar systems. However, the faint intensity of the circumstellar disks compared to the brightness of the host star compels astronomers to use tailored observation strategies, in addition to state-of-the-art optical devices.

One Bit to Rule Them All: Binarizing the Reconstruction in 1-bit Compressive Sensing

Abstract: This work focuses on the reconstruction of sparse signals from their 1-bit measurements. The context is the one of 1-bit compressive sensing where the measurements amount to quantizing (dithered) random projections.

When compressive learning fails: blame the decoder or the sketch?

Abstract: In compressive learning, a mixture model (a set of centroids or a Gaussian mixture) is learned from a sketch vector, that serves as a highly compressed representation of the dataset.

An Analog-to-Information VGA Image Sensor Architecture for Support Vector Machine on Compressive Measurements

Abstract: This work presents a compact VGA (480 × 640) CMOS Image Sensor (CIS) architecture with dedicated end-of-column Compressive Sensing (CS) scheme allowing embedded object recognition. The architecture takes advantage of a low-footprint pseudo-random data mixing circuit and a first order incremental Sigma-Delta (ΣΔ) Analog to Digital Converter (ADC) to extract compressed features.

Compressive k-Means with Differential Privacy

Abstract: In the compressive learning framework, one harshly compresses a whole training dataset into a single vector of generalized random moments, the sketch, from which a learning task can subsequently be performed.

Compressive Single-pixel Fourier Transform Imaging using Structured Illumination

Abstract: Single Pixel (SP) imaging is now a reality in many applications, eg, biomedical ultrathin endoscope and fluorescent spectroscopy. In this context, many schemes exist to improve the light throughput of these device, eg, using structured illumination driven by compressive sensing theory.

Differentially Private Compressive K-means

Abstract: This work addresses the problem of learning from large collections of data with privacy guarantees. The sketched learning framework proposes to deal with the large scale of datasets by compressing them into a single vector of generalized random moments, from which the learning task is then performed.

Exploring Hierarchical Machine Learning for Hardware-Limited Multi-Class Inference on Compressed Measurements

Abstract: This paper explores hierarchical clustering methods to learn a hierarchical multi-class classifier on compressed measurements in the context of highly constrained hardware (e.g., always-on ultra low power vision systems). In contrast to the popular multi-class classification approaches based on multiple binary classifiers (i.