Bertrand Zavidovique

Learn More
We present a new technique for content based image retrieval using motif cooccurrence matrix (MCM). The MCM is derived from the motif transformed image. The whole image is divided into 2 £ 2 pixel grids. Each grid is replaced by a scan motif that minimizes the local gradient while traversing the 2 £ 2 grid forming a motif transformed image. The MCM is then(More)
Robustness is a key issue in pedestrian detection for autonomous vehicles. Contextual information, if well exploited, should increase robustness and performance. Specifically, contextual knowledge allows for the integration of algorithms performing well only in specific situations, which would otherwise be excluded from a system designed for the general(More)
This article introduces two fast algorithms for connected component Labeling of binary images, a peculiar case of coloring. The first one, Selkow DT is pixel-based and a Selkow’s algorithm combined with the decision tree optimization technique. The second one called light speed labeling is segment-based line-relative labeling and was especially thought for(More)
This paper presents a dataflow functional computer (DFFC) developed at the Etablissement Technique Central de l'Armement (ETCA) and dedicated to real-time image processing. Two types of data-driven processing elements, dedicated respectively to low-level and mid-level processings are integrated in a regular 3D array. The design of the DFFC relies on a close(More)
This paper describes a Recon gurable Compute En gine the Data Flow Functional Computer or DFFC developed at ETCA and dedicated to rapid prototyping of real time vision automata The Computer consists of a regular D array of very coarse grain application speci c FPGA called the Field Programmable Oper ator Array FPOA each FPOA includes Con g urable Data Paths(More)
This paper describes a new method for fuzzy segmentation based on spatial constraints. Taking into account the neighborhood influence two techniques are used. First a new feature is derived from Peano scans to represent a spatial relationship among neighbors. Second we incorporate a regularization term to fuzzy C-means algorithm (FCM). The algorithm is(More)
In this paper, we propose ”stable marriages” algorithms based on a novel representation called marriage table. After explaining how properties as global satisfaction, sex equality and stability show in the representation, we define 3 algorithms corresponding to 3 different scans of the marriage table to meet progressively all constraints. The performance is(More)