2

Determination of vibration amplitudes from binary phase patterns obtained by phase-shifting time-averaged speckle shearing interferometry

Abstract: Speckle shearing interferometry (shearography) is a full-field strain measurement technique that can be used in vibration analysis. In our case, we apply a method that combines the time-averaging and phase-shifting techniques.
2018 Applied Optics
DOI DIAL

Multispectral Compressive Imaging Strategies Using Fabry–Pérot Filtered Sensors

Abstract: In this paper, we introduce two novel acquisition schemes for multispectral compressive imaging. Unlike most existing methods, the proposed computational imaging techniques do not include any dispersive element, as they use a dedicated sensor that integrates narrowband Fabry–Pérot spectral filters at the pixel level.
2018 IEEE Transactions on Computational Imaging
DOI DIAL arXiv

Quantized Compressive K-Means

Abstract: The recent framework of compressive statistical learning proposes to design tractable learning algorithms that use only a heavily compressed representation - or sketch - of massive datasets. Compressive K-Means (CKM) is such a method: It aims at estimating the centroids of data clusters from pooled, nonlinear, and random signatures of the learning examples.
2018 IEEE Signal Processing Letters
DOI DIAL arXiv

Through the Haze: a Non-Convex Approach to Blind Gain Calibration for Linear Random Sensing Models

Abstract: Computational sensing strategies often suffer from calibration errors in the physical implementation of their ideal sensing models. Such uncertainties are typically addressed by using multiple, accurately chosen training signals to recover the missing information on the sensing model, an approach that can be resource-consuming and cumbersome.
2018 Information and Inference
DOI DIAL arXiv

Discriminative and efficient label propagation on complementary graphs for multi-object tracking

Abstract: Given a set of detections, detected at each time instant independently, we investigate how to associate them across time. This is done by propagating labels on a set of graphs, each graph capturing how either the spatiotemporal or the appearance cues promote the assignment of identical or distinct labels to a pair of detections.
2017 IEEE Transactions on Pattern Analysis and Machine Intelligence
DOI DIAL arXiv

On the Noise Robustness of Simultaneous Orthogonal Matching Pursuit

Abstract: In this paper, the joint support recovery of several sparse signals whose supports present similarities is examined. Each sparse signal is acquired using the same noisy linear measurement process, which returns fewer observations than the dimension of the sparse signals.
2017 IEEE Transactions on Signal Processing
Cite DOI DIAL arXiv

Small Width, Low Distortions: Quantized Random Embeddings of Low-complexity Sets

Abstract: Under which conditions and with which distortions can we preserve the pairwise-distances of low-complexity vectors, e.g., for structured sets such as the set of sparse vectors or the one of low-rank matrices, when these are mapped in a finite set of vectors?
2017 IEEE Transactions on Information Theory
DOI DIAL arXiv

Time for dithering: fast and quantized random embeddings via the restricted isometry property

Abstract: Recently, many works have focused on the characterization of non-linear dimensionality reduction methods obtained by quantizing linear embeddings, e.g., to reach fast processing time, efficient data compression procedures, novel geometry-preserving embeddings or to estimate the information/bits stored in this reduced data representation.
2017 Information and Inference
DOI DIAL arXiv

Consistent Basis Pursuit for Signal and Matrix Estimates in Quantized Compressed Sensing

Abstract: This paper focuses on the estimation of low-complexity signals when they are observed through \(M\) uniformly quantized compressive observations. Among such signals, we consider 1-D sparse vectors, low-rank matrices, or compressible signals that are well approximated by one of these two models.
2016 IEEE Signal Processing Letters
Code DOI DIAL arXiv Demo

Error Decay of (almost) Consistent Signal Estimations from Quantized Gaussian Random Projections

Abstract: This paper provides new error bounds on “consistent” reconstruction methods for signals observed from quantized random projections. Those signal estimation techniques guarantee a perfect matching between the available quantized data and a new observation of the estimated signal under the same sensing model.
2016 IEEE Transactions on Information Theory
DOI DIAL arXiv