Recursive Nearest Agglomeration (ReNA): Fast Clustering for Approximation of Structured Signals.

In this work, we revisit fast dimension reduction approaches, as with random projections and random sampling. Our goal is to summarize the data to decrease computational costs and memory footprint of subsequent analysis. Such dimension reduction can be very efficient when the signals of interest have a strong structure, such as with images.

A Projection Algorithm for Gradient Waveforms Design in Magnetic Resonance Imaging.

Collecting the maximal amount of information in a given scanning time is a major concern in magnetic resonance imaging (MRI) to speed up image acquisition. The hardware constraints (gradient magnitude, slew rate, etc.), physical distortions (e.

Implementation of transportation distance for analyzing FLIM and FRET experiments.

Analysis of fluorescence lifetime imaging microscopy (FLIM) and Förster resonance energy transfer (FRET) experiments in living cells is usually based on mean lifetimes computations. However, these mean lifetimes can induce misinterpretations. We propose in this work the implementation of the transportation distance for FLIM and FRET experiments in vivo.