Demo Data from EDBT 2026 / reviewers in the wild / expert
Bernard Longuet
dblp:91/4797
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Geometric modeling and processing · 50% Image and video processing · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › mathematical morphology
3d thinning |
0.0 | 1 | 1999 | Medial Faces from a Concise 3D Thinning Algorithm · ICCV 1999 |
Geometric modeling and processing
shape analysis |
0.0 | 1 | 1999 | Medial Faces from a Concise 3D Thinning Algorithm · ICCV 1999 |
Methods — techniques the papers use, named apart from their topics
topology preservation · 0.0parallel thinning · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Medial Faces from a Concise 3D Thinning AlgorithmabstractWe propose in this paper a new 3D fully parallel thinning algorithm that we believe to be the most concise due to its simple characterization. The algorithm is indeed completely defined by a set of five patterns, three removing conditions and two non-removing conditions. These patterns are designed from the two fundamental and compatible constraints usually expected in skeleta: (1) Topology preservation and (2) Medial surface. From these two constraints, the removing patterns terns (/spl alpha//sub 1/, /spl alpha//sub 2/ and /spl alpha//sub 3/) detect the non-local maxima, whereas the non-removing patterns (/spl beta//sub 1/ and /spl beta//sub 2/) prevent any topology change that the removing conditions could imply. We show that the three mentioned constraints are respected. The logical conciseness of our procedure, called MB-3D, makes it to our knowledge the easiest 3D thinning algorithm to implement. Some results are displayed, that illustrate the relevance of our approach. Antoine Manzanera, Thierry M. Bernard, Françoise J. Prêteux, Bernard Longuet |
ICCV | 4 |
| 1997 | A computer aided architecture design tool aimed at image processing applicationsabstractSAGAPA (System Architecture Generated from A Parallel Algorithm) is an image processing system design tool based on an original methodology that automatically carries out the minimal architecture adapted to the application algorithm in respect with a maximal execution time constraint. The obtained architecture is minimal in terms of number of processors, amount of memory, and complexity of interconnection network. An execution-driven type simulation is performed in order to estimate resource's utilization and to check the time constraint. Pascal Collet, Gérard Ramstein, Bernard Longuet |
HiPC | 3 |