2

Asymmetric compressive learning guarantees with applications to quantized sketches

Abstract: The compressive learning framework reduces the computational cost of training on large-scale datasets. In a sketching phase, the data is first compressed to a lightweight sketch vector, obtained by mapping the data samples through a well-chosen feature map, and averaging those contributions.

Sketching Datasets for Large-Scale Learning

(for a longer and free version on arXiv see here) Abstract: This article considers “compressive learning,” an approach to large-scale machine learning where datasets are massively compressed before learning (e.g., clustering, classification, or regression) is performed.

Breaking the waves: asymmetric random periodic features for low-bitrate kernel machines

Abstract: Many signal processing and machine learning applications are built from evaluating a kernel on pairs of signals, e.g. to assess the similarity of an incoming query to a database of known signals.

Compressive Imaging Through Optical Fiber with Partial Speckle Scanning

Abstract: The lensless endoscope (LE) is a promising device to acquire in vivo images at a cellular scale. The tiny size of the probe enables a deep exploration of the tissues.

Compressive learning with privacy guarantees

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

MAYONNAISE: a morphological components analysis pipeline for circumstellar discs and exoplanets imaging in the near-infrared

Abstract: Imaging circumstellar discs in the near-infrared provides unprecedented information about the formation and evolution of planetary systems. However, current post-processing techniques for high-contrast imaging using ground-based telescopes have a limited sensitivity to extended signals and their morphology is often plagued with strong morphological distortions.

The Importance of Phase in Complex Compressive Sensing

Abstract: We consider the question of estimating a real low-complexity signal (such as a sparse vector or a low-rank matrix) from the phase of complex random measurements. We show that in this phase-only compressive sensing (PO-CS) scenario, we can perfectly recover such a signal with high probability and up to global unknown amplitude if the sensing matrix is a complex Gaussian random matrix and the number of measurements is large compared to the complexity level of the signal space.

$(\ell_{1},\ell_{2})$-RIP and Projected Back-Projection Reconstruction for Phase-Only Measurements

Abstract: This letter analyzes the performances of a simple reconstruction method, namely the Projected Back-Projection (PBP), for estimating the direction of a sparse signal from its phase-only (or amplitude-less) complex Gaussian random measurements, i.

Close Encounters of the Binary Kind: Signal Reconstruction Guarantees for Compressive Hadamard Sampling with Haar Wavelet Basis

Abstract: We investigate the problems of 1-D and 2-D signal recovery from subsampled Hadamard measurements using Haar wavelet as a sparsity inducing prior. These problems are of interest in, e.g., computational imaging applications relying on optical multiplexing or single-pixel imaging.

Hardware-Compliant Compressive Image Sensor Architecture Based on Random Modulations and Permutations for Embedded Inference

Abstract: This work presents a compact CMOS Image Sensor (CIS) architecture enabling embedded object recognition facilitated by a dedicated end-of-column Compressive Sensing (CS), reducing on-chip memory needs. Our sensing scheme is based on a combination of random modulations and permutations leading to an implementation with very limited hardware impacts.