Demo Data from EDBT 2026 / reviewers in the wild / expert
Nicolas Wotawa
dblp:34/2564
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2006
—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
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 · 56% Representation and self-supervised learning · 44% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
3d reconstruction |
0.1 | 1 | 2006 | Control Theory and Fast Marching Techniques for Brain Connectivity Mapping · CVPR (1) 2006 |
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning
geodesic distance computation |
0.1 | 1 | 2006 | Control Theory and Fast Marching Techniques for Brain Connectivity Mapping · CVPR (1) 2006 |
Bioinformatics and computational biology › computational neuroscience › brain connectivity analysis
brain connectivity estimation |
0.1 | 1 | 2006 | Control Theory and Fast Marching Techniques for Brain Connectivity Mapping · CVPR (1) 2006 |
Computer vision › 3D vision
diffusion tensor imaging |
0.0 | 1 | 2006 | Control Theory and Fast Marching Techniques for Brain Connectivity Mapping · CVPR (1) 2006 |
Methods — techniques the papers use, named apart from their topics
riemannian geometry · 0.1fast marching · 0.1control theory · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Control Theory and Fast Marching Techniques for Brain Connectivity MappingabstractWe propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magnetic Resonance Imaging (or DTI) and models the white matter by using Riemannian geometry and control theory. We show that it is possible, from a region of interest, to compute the geodesic distance to any other point and the associated optimal vector field. The latter can be used to trace shortest paths coinciding with neural fiber bundles. We also demonstrate that no explicit computation of those 3D curves is necessary to assess the degree of connectivity of the region of interest with the rest of the brain. We finally introduce a general local connectivity measure whose statistics along the optimal paths may be used to evaluate the degree of connectivity of any pair of voxels. All those quantities can be computed simultaneously in a Fast Marching framework, directly yielding the connectivity maps. Apart from being extremely fast, this method has other advantages such as the strict respect of the convoluted geometry of white matter, the fact that it is parameter-free, and its robustness to noise. We illustrate our technique by showing results on real and synthetic datasets. OurGCM(Geodesic Connectivity Mapping) algorithm is implemented in C++ and will be soon available on the web. Emmanuel Prados, Stefano Soatto, Christophe Lenglet, Jean-Philippe Pons, Nicolas Wotawa, Rachid Deriche, Olivier D. Faugeras |
CVPR (1) | 5 |