Jérôme Gilles

CV
h-index19
4papers
204citations
Novelty20%
AI Score24

4 Papers

CVOct 23, 2014Code
A Regularization Approach to Blind Deblurring and Denoising of QR Barcodes

Yves van Gennip, Prashant Athavale, Jérôme Gilles et al.

QR bar codes are prototypical images for which part of the image is a priori known (required patterns). Open source bar code readers, such as ZBar, are readily available. We exploit both these facts to provide and assess purely regularization-based methods for blind deblurring of QR bar codes in the presence of noise.

IVNov 14, 2024
Fast probabilistic snake algorithm

Jérôme Gilles, Bertrand Collin

Few people use the probability theory in order to achieve image segmentation with snake models. In this article, we are presenting an active contour algorithm based on a probability approach inspired by A. Blake work and P. R{é}fr{é}gier's team research in France. Our algorithm, both very fast and highly accurate as far as contour description is concerned, is easily adaptable to any specific application.

IVNov 11, 2024
METRIC: a complete methodology for performances evaluation of automatic target Detection, Recognition and Tracking algorithms in infrared imagery

Jérôme Gilles, Stéphane Landeau, Tristan Dagobert et al.

In this communication, we deal with the question of automatic target detection, recognition and tracking (ATD/R/T) algorithms performance assessment. We propose a complete methodology of evaluation which approaches objective image datasets development and adapted metrics definition for the different tasks (detection, recognition and tracking). We present some performance results which are currently processed in a French-MoD program called 2ACI (``Acquisition Automatique de Cibles par Imagerie``).

CVJan 13, 2014
A parameterless scale-space approach to find meaningful modes in histograms - Application to image and spectrum segmentation

Jérôme Gilles, Kathryn Heal

In this paper, we present an algorithm to automatically detect meaningful modes in a histogram. The proposed method is based on the behavior of local minima in a scale-space representation. We show that the detection of such meaningful modes is equivalent in a two classes clustering problem on the length of minima scale-space curves. The algorithm is easy to implement, fast, and does not require any parameters. We present several results on histogram and spectrum segmentation, grayscale image segmentation and color image reduction.