Jonas Kahn

On the generation of sampling schemes for Magnetic Resonance Imaging

Magnetic resonance imaging (MRI) is probably one of the most successful application fields of compressed sensing. Despite recent advances, there is still a large discrepancy between theories and most actual implementations. Overall, many important questions related to sampling theory remain open. In this paper, we attack one of them: given a set of sampling constraints (e.g., measuring Fourier coefficients along physically plausible trajectories), how to optimally design a sampling pattern? We first outline three aspects that should be carefully designed by inspecting the literature, namely admissibility, limit of the empirical measure, and coverage speed. To address them jointly, we then propose an original approach which consists of projecting a probability distribution onto a set of admissible measures. The proposed algorithm permits handling arbitrary constraints and automatically generates efficient sampling patterns for MRI as shown on realistic simulations. We achieve a 20-fold undersampling factor...

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. We focus on this setting and investigate feature clustering schemes for data reductions that capture this structure. An impediment to fast dimension reduction is then that good clustering comes with large algorithmic costs. We address it by contributing a linear-time agglomerative clustering scheme, Recursive Nearest Agglomeration (ReNA). Unlike existing fast agglomerative schemes, it avoids the creation of giant clusters. We empirically validate that it approximates the data as well as traditional variance-minimizing clustering schemes that have a quadratic complexity. In addition, we analyze signal approximation with feature clustering and show that it can remove noise, improving subsequent analysis steps. As a consequence, data reduction by clustering features with ReNA yields very fast and accurate models, enabling to process large datasets on budget. Our theoretical analysis is backed by extensive experiments on publicly-available data that illustrate the computation efficiency and the denoising properties of the resulting dimension reduction scheme.

Strong identifiability and optimal minimax rates for finite mixture estimation

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Strong identifiability and optimal minimax rates for finite mixture estimation Philippe Heinrich, Jonas Kahn

How many T-tessellations on k lines? Existence of associated Gibbs measures on bounded convex domains

The paper bounds the number of tessellations with T-shaped vertices on a fixed set of k lines: tessellations are efficiently encoded, and algorithms retrieve them, proving injectivity. This yields existence of a completely random T-tessellation, as defined by Kieu et al. Spat Stat 6 2013 118-138, and of its Gibbsian modifications. The combinatorial bound is sharp, but likely pessimistic in typical cases.

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. This non-fitting indicator, which is easy to compute, reflects the similarity between two distributions and can be used for pixels clustering to improve the estimation of the FRET parameters. We study the robustness and the discriminating power of this transportation distance, both theoretically and numerically. In addition, a comparison study with the largely used mean lifetime differences is performed. We finally demonstrate practically the benefits of the transportation distance over the usual mean lifetime differences for both FLIM and FRET experiments in living cells.