Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thomas Walker

dblp:88/1324 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2025
0000-0003-0916-2076ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021

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%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d reconstruction
0.912025
CrossSDF: 3D Reconstruction of Thin Structures From Cross-Sections · CVPR 2025
Computer vision › 3D vision › implicit neural representation
neural signed distance field
0.912025
CrossSDF: 3D Reconstruction of Thin Structures From Cross-Sections · CVPR 2025
Computer vision › 3D vision › 3d reconstruction › object reconstruction
thin object reconstruction
0.912025
CrossSDF: 3D Reconstruction of Thin Structures From Cross-Sections · CVPR 2025
Medical and health informatics
medical image reconstruction
0.312025
CrossSDF: 3D Reconstruction of Thin Structures From Cross-Sections · CVPR 2025

Methods — techniques the papers use, named apart from their topics

signed distance field · 1.7neural implicit representation · 1.7
YearPublicationVenuePosition
2025 CrossSDF: 3D Reconstruction of Thin Structures From Cross-Sections
abstract
Reconstructing complex structures from planar cross-sections is a challenging problem, with wide-reaching applications in medical imaging, manufacturing, and topography. Out-of-the-box point cloud reconstruction methods can often fail due to the data sparsity between slicing planes, while current bespoke methods struggle to reconstruct thin geometric structures and preserve topological continuity. This is important for medical applications where thin vessel structures are present in CT and MRI scans. This paper introduces CrossSDF, a novel approach for extracting a 3D signed distance field from 2D signed distances generated from planar contours. Our approach makes the training of neural SDFs contour-aware by using losses designed for the case where geometry is known within 2D slices. Our results demonstrate a significant improvement over existing methods, effectively reconstructing thin structures and producing accurate 3D models without the interpolation artifacts or over-smoothing of prior approaches.
Thomas Walker, Salvatore Esposito, Daniel Rebain, Amir Vaxman, Arno Onken, Changjian Li 0001, Oisin Mac Aodha
CVPR1
2025 Spatially-Adaptive Hash Encodings for Neural Surface Reconstruction
abstract
Positional encodings are a common component of neural scene reconstruction methods, and provide a way to bias the learning of neural fields towards coarser or finer representations. Current neural surface reconstruction methods use a “one-size-fits-all” approach to encoding, choosing a fixed set of encoding functions, and therefore bias, across all scenes. Current state-of-the-art surface reconstruction approaches leverage grid-based multi-resolution hash encoding in order to recover high-detail geometry. We propose a learned approach which allows the network to choose its encoding basis as a function of space, by masking the contribution of features stored at separate grid resolutions. The resulting spatially adaptive approach allows the network to fit a wider range of frequencies without introducing noise. We test our approach on standard benchmark surface reconstruction datasets and achieve state-of-the-art performance on two benchmark datasets.
Thomas Walker, Octave Mariotti, Amir Vaxman, Hakan Bilen
WACV1
2004 Algorithms for Distributed Exploration
Thomas Walker, Daniel Kudenko, Malcolm J. A. Strens
ECAI1