#### Filter Results:

#### Publication Year

1980

2014

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn 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… (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)

We present a novel image feature descriptor for rotation-ally invariant 2D texture classification. This extends our previous work on noise-resistant and intensity-shift invariant median binary patterns (MBPs), which use binary pattern vectors based on adaptive median thresholding. In this paper the MBPs are hashed to a binary chain or equivalence class… (More)

- Georges M Qu Enot, Nicolas Paris, Bertrand Zavidovique
- 1991

A Temperature and Voltage Measurement Cell (TVM Cell) for VLSI circuits has been developed. It requires less than 1 mm 2 of core area (for a 2 m CMOS technology) and only 4 I/O pins. It can be integrated into any CMOS VLSI circuit. It permits the measurement of the Circuit Die Temperature (T) and its Core Power Supply Voltage (V) while the chip is operated… (More)

This paper introduces a direction-sensitive and locally reorientable compact binary tree, called the Z ; tree, for representing digital images. A rotation operation is deened on a subset of its node, called square nodes, to spatially reorganize the four grand children of any g i v en square-node. The goal is to adapt the Z ; tree in order to produce a… (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)

- Guna S Seetharaman, Bertrand Zavidovique
- 1997

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)