← Search

Laurent Jacques

7 accepted papers

2025

UNSURE: self-supervised learning with Unknown Noise level and Stein's Unbiased Risk Estimate

ICLR 2025poster

Recently, many self-supervised learning methods for image reconstruction have been proposed that can learn from noisy data alone, bypassing the need for ground-truth references. Most existing methods cluster around two classes: i) Stein's Unbiased Risk Estimate (SURE) and similar approaches that as…

2023

Low-Rank Plus Sparse Trajectory Decomposition for Direct Exoplanet Imaging

ICASSP 2023accepted

We propose a direct imaging method for the detection of exo-planets based on a combined low-rank plus structured sparse model. For this task, we develop a dictionary of possible effective circular trajectories a planet can take during the observation time, elements of which can be efficiently comput…

Cited by 0SourceScholar
2023

Signal Processing with Optical Quadratic Random Sketches

ICASSP 2023accepted

Random data sketching (or projection) is now a classical technique enabling, for instance, approximate numerical linear algebra and machine learning algorithms with reduced computational complexity and memory. In this context, the possibility of performing data processing (such as pattern detection…

Cited by 0SourceScholar
2021

Sparse Factorization-Based Detection of Off-the-Grid Moving Targets Using FMCW Radars

ICASSP 2021accepted

In this paper, we investigate the application of continuous sparse signal reconstruction algorithms for the estimation of the ranges and speeds of multiple moving targets using an FMCW radar. Conventionally, to be reconstructed, continuous sparse signals are approximated by a discrete representation…

Cited by 0SourceScholar
2019

Compressive Single-pixel Fourier Transform Imaging Using Structured Illumination

ICASSP 2019accepted

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

Cited by 0SourceScholar
2019

Differentially Private Compressive K-means

ICASSP 2019accepted

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…

Cited by 0SourceScholar
2016

Sparse Support Recovery with Non-smooth Loss Functions

NeurIPS 2016poster

In this paper, we study the support recovery guarantees of underdetermined sparse regression using the $\ell_1$-norm as a regularizer and a non-smooth loss function for data fidelity. More precisely, we focus in detail on the cases of $\ell_1$ and $\ell_\infty$ losses, and contrast them with the usu…

Cited by 6SourcePDFScholar