Demo Data from EDBT 2026 / reviewers in the wild / expert
Jean-Michel Oliva
dblp:23/3514
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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.
| Artificial intelligence
1 paper |
3D vision · 100% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › 3d shape representation
shape descriptor |
0.0 | 1 | 2000 | Angular Bisector Network, a Simplified Generalized Voronoi Diagram: Application to Processing Complex Intersections in Biomedical Images · IEEE Trans. Pattern Anal. Mach. Intell. 2000 |
Computational geometry › voronoi diagram
generalized voronoi diagrams |
0.0 | 1 | 2000 | Angular Bisector Network, a Simplified Generalized Voronoi Diagram: Application to Processing Complex Intersections in Biomedical Images · IEEE Trans. Pattern Anal. Mach. Intell. 2000 |
Medical and health informatics › medical imaging
medical image analysis |
0.0 | 1 | 2000 | Angular Bisector Network, a Simplified Generalized Voronoi Diagram: Application to Processing Complex Intersections in Biomedical Images · IEEE Trans. Pattern Anal. Mach. Intell. 2000 |
Methods — techniques the papers use, named apart from their topics
planar graph representation · 0.1angular bisector network · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Angular Bisector Network, a Simplified Generalized Voronoi Diagram: Application to Processing Complex Intersections in Biomedical ImagesabstractOne of the major goals of computer vision is the research and the development of flexible methods for shape description. A large group of shape description techniques is given by heuristic approaches, which yield acceptable results in the description of simple shapes and regions. In this case, objects are represented by a planar graph with nodes symbolizing subregions from region decomposition, and region shape is then described by the graph properties. In the paper, the angular bisector network (ABN), a descriptor of polygonal shape, is used to automatically detect intersections between neurites of cell structures. Some properties of the ABN, such as linear algebraic complexity, easy extraction of characteristic points, etc., are very useful and experimental results are promising. Florence Cloppet, Jean-Michel Oliva, Georges Stamon |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |
| 1996 | 3D Reconstruction of Complex Polyhedral Shapes from Contours using a Simplified Generalized Voronoi DiagramabstractAbstract We are interested in modelling the suface of very irregular objects known through a few planar polygonal cross‐sections. This problem is considered difficult when severe topology and morphology variations appear between neighbouring cross‐sections (multi‐branching, holes, disconnected areas). Only few methods deal with this problem in a systematic way. The paper describes an original method allowing to build, in a fully automatic and systematic way, an external surface with a valid topology in any case. It moreover allows to adjust details of the reconstructed surface in view of the morphologies and topologies of the various initial cross‐sectional contours. At first, a global correspondence is operated between each couple of adjacent cross‐sections by extracting polygonal areas of difference. Next steps are based on the computation in each area of difference of the bisector network, a well‐defined simplified generalised Voronoi diagram. This structure is used both for connecting initial contour points and for interpolating new intermediate portions of contours. It depends on the complexity of initial 2D shapes. Interpolation stage is then recursively operated until a satisfactory surface has been obtained or until a maximum number of new intermediate cross‐sectional contours have been built. The valid final suface is directly obtained by concatenating all the tiling areas of difference without need of any post processing step. The processing of several real data related to geological bodies or human organs has proved that the described method allows detailed modelling of irregular objects with very performing CPU times. The reconstruction appears insensitive to severe variations of the object shape, including apparitions of holes or disconnections. Jean-Michel Oliva, Michel Perrin, Sabine Coquillart |
Comput. Graph. Forum | 1 |