In this paper, we propose a method to realize a classification of keystroke dynamics users before performing user authentication. The objective is to set automatically the individual parameters of the classification method for each class of users. Features are extracted from each user learning set, and then a clustering algorithm divides the user s...
This paper describes a novel approach for on demand volumetric texture synthesis based on a deep learning framework that allows for the generation of high quality 3D data at interactive rates. Based on a few example images of textures, a generative network is trained to synthesize coherent portions of solid textures of arbitrary sizes that reproduc...
Published in Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society
The purpose of super-resolution approaches is to overcome the hardware limitations and the clinical requirements of imaging procedures by reconstructing high-resolution images from low-resolution acquisitions using post-processing methods. Super-resolution techniques could have strong impacts on structural magnetic resonance imaging when focusing o...
One of the most burning issue in deep learning community is the well known adversarial example phenomenon where two very close samples are classified differently. In this paper, I offer to see in this phenomenon the opportunity to help the training with a new kind of regularisation and/or semi supervised training. The main idea is to use both class...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Curvilinear structure restoration in image processing procedures is a difficult task, which can be compounded when these structures are thin, i.e., when their smallest dimension is close to the resolution of the sensor. Many recent restoration methods involve considering a local gradient-based regularization term as prior, assuming gradient sparsit...
We design an image quality measure independent of local contrast changes, which constitute simple models of illumination changes. Given two images, the algorithm provides the image closest to the first one with the component tree of the second. This problem can be cast as a specific convex program called isotonic regression. We provide a few analyt...
International audience
We present and analyse a backtracking strategy for a general Fast Iterative Shrink-age/Thresholding Algorithm which has been recently proposed in [11] for strongly convex objective functions. Differently from classical Armijo-type line searching, our backtracking rule allows for local increase and decrease of the Lipschitz constant estimate along t...
International audience
International audience
