#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1980

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Adel Hafiane, Guna Seetharaman, Bertrand Zavidovique
- ICIAR
- 2007

- N. Jhanwar, Subhasis Chaudhuri, Guna Seetharaman, Bertrand Zavidovique
- Image Vision Comput.
- 2004

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)

- P. Lombardi, B. Zavidovique
- IEEE Intelligent Vehicles Symposium, 2004
- 2004

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)

We investigate some attractive features of the 1-D sequence of pixels produced by the peano traversal of an image. We introduce two new hardware operations called bit-spreaded-meshing and its inverse bit-collation to produce and invert the sequence in real-time. A compact binary tree built using this sequence at its base implicitly contains the well known… (More)

- Lionel Lacassagne, Bertrand Zavidovique
- Journal of Real-Time Image Processing
- 2009

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)

- Georges QU ENOT, Bertrand ZAVIDOVIQUE
- 1991

Georges QU ENOT, Bertrand ZAVIDOVIQUE Laboratoire Syst eme de Perception DGA/Etablissement Technique Central de l'Armement 16 bis Av. Prieur de la Côte d'Or, 94114 Arcueil CEDEX (FRANCE) Tel: (33 1) 42 31 99 51 Fax: (33 1) 42 31 99 55 Email: quenot@etca.fr Abstract A chip featuring two coupled dataow processors (DFPs) has been designed. It is to be… (More)

- Jocelyn Sérot, Georges Quénot, Bertrand Zavidovique
- Machine Vision and Applications
- 1993

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)

- G M Qu, I C Kralji, J S Erot, B Zavidovique
- 1994

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)

- Adel Hafiane, Bertrand Zavidovique, Subhasis Chaudhuri
- IEEE International Conference on Image Processing…
- 2005

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)

- Bertrand Zavidovique, Nikom Suvonvorn, Guna Seetharaman
- ICINCO
- 2005

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)