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 Bülow

dblp:21/630 · DBLP profile ↗
← Back
11ranked-venue papers
6as first author
0since 2021 · last 2013
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 9 · 4 first-authorArtificial intelligence and machine learning · 5 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 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.

Computer graphics and multimedia
3 papers
Visualization and visual analytics · 35% Rendering · 35% Geometric modeling and processing · 20%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
medical visualization
0.212013
A Radial Structure Tensor and Its Use for Shape-Encoding Medical Visualization of Tubular and Nodular Structures · IEEE Trans. Vis. Comput. Graph. 2013
Rendering
volume rendering
0.212013
A Radial Structure Tensor and Its Use for Shape-Encoding Medical Visualization of Tubular and Nodular Structures · IEEE Trans. Vis. Comput. Graph. 2013
Image and video processing
feature extraction
0.012013
A Radial Structure Tensor and Its Use for Shape-Encoding Medical Visualization of Tubular and Nodular Structures · IEEE Trans. Vis. Comput. Graph. 2013
Geometric modeling and processing › mesh processing
mesh smoothing
0.012004
Spherical Diffusion for 3D Surface Smoothing · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Geometric modeling and processing
point cloud processing
0.012004
Recognizing Objects in Range Data Using Regional Point Descriptors · ECCV (3) 2004
Computational geometry › curve representation
curve approximation
0.012002
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm · IEEE Trans. Pattern Anal. Mach. Intell. 2002
Computational geometry › digital geometry
digital curves
0.012002
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm · IEEE Trans. Pattern Anal. Mach. Intell. 2002
Computer vision › 3D vision › 3d object recognition
range image object recognition
0.012004
Recognizing Objects in Range Data Using Regional Point Descriptors · ECCV (3) 2004

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

sparse radial gradient sampling · 0.2radial structure tensor · 0.2GPU implementation · 0.2shape matching · 0.1point feature descriptors · 0.1nonlinear diffusion · 0.0gaussian smoothing · 0.0iterative approximation algorithm · 0.0
YearPublicationVenuePosition
2013 A Radial Structure Tensor and Its Use for Shape-Encoding Medical Visualization of Tubular and Nodular Structures
abstract
The concept of curvature and shape-based rendering is beneficial for medical visualization of CT and MRI image volumes. Color-coding of local shape properties derived from the analysis of the local Hessian can implicitly highlight tubular structures such as vessels and airways, and guide the attention to potentially malignant nodular structures such as tumors, enlarged lymph nodes, or aneurysms. For some clinical applications, however, the evaluation of the Hessian matrix does not yield satisfactory renderings, in particular for hollow structures such as airways, and densely embedded low contrast structures such as lymph nodes. Therefore, as a complement to Hessian-based shape-encoding rendering, this paper introduces a combination of an efficient sparse radial gradient sampling scheme in conjunction with a novel representation, the radial structure tensor (RST). As an extension of the well-known general structure tensor, which has only positive definite eigenvalues, the radial structure tensor correlates position and direction of the gradient vectors in a local neighborhood, and thus yields positive and negative eigenvalues which can be used to discriminate between different shapes. As Hessian-based rendering, also RST-based rendering is ideally suited for GPU implementation. Feedback from clinicians indicates that shape-encoding rendering can be an effective image navigation tool to aid diagnostic workflow and quality assurance.
Rafael Wiemker, Tobias Klinder, Martin Bergtholdt, Kirsten Meetz, Ingwer C. Carlsen, Thomas Bülow
IEEE Trans. Vis. Comput. Graph.6
2007 Automated Model-Based Rib Cage Segmentation and Labeling in CT Images
Tobias Klinder, Cristian Lorenz, Jens von Berg, Sebastian P. M. Dries, Thomas Bülow, Jörn Ostermann
MICCAI (2)5
2004 Recognizing Objects in Range Data Using Regional Point Descriptors
Andrea Frome, Daniel Huber, Ravi Kolluri, Thomas Bülow, Jitendra Malik
ECCV (3)4
2004 A General Framework for Tree Segmentation and Reconstruction from Medical Volume Data
Thomas Bülow, Cristian Lorenz, Steffen Renisch
MICCAI (1)1
2004 Modeling the Coronary Artery Tree
abstract
The paper describes a model of the coronary artery tree. It has been developed for the context of medical image processing and medical reporting. The model combines geometric information with associated medical nomenclature and anatomical relations. Applicability of the model and interindividual geometrical variability has been studied by matching the model to the individual coronary anatomy of 33 patients imaged with a multidetector-row computer tomography scanner.
Cristian Lorenz, Jens von Berg, Thomas Bülow, Steffen Renisch, Sven Wergandt
SMI3
2004 Modeling the Coronary Artery Tree (Figures 1, 2, 4, and 5)
Cristian Lorenz, Jens von Berg, Thomas Bülow, Steffen Renisch, Sven Wergandt
SMI3
2004 Spherical Diffusion for 3D Surface Smoothing
abstract
A diffusion-based approach to surface smoothing is presented. Surfaces are represented as scalar functions defined on the sphere. The approach is equivalent to Gaussian smoothing on the sphere and is computationally efficient since it does not require iterative smoothing. Furthermore, it does not suffer from the well-known shrinkage problem. Evolution of important shape features (parabolic curves) under diffusion is demonstrated. A nonlinear modification of the diffusion process is introduced in order to improve smoothing behavior of elongated and poorly centered objects.
Thomas Bülow
IEEE Trans. Pattern Anal. Mach. Intell.1
2002 Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
abstract
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional Euclidean space. The length of such a simple digital curve is defined to be the length of the minimum-length polygonal curve fully contained and complete in the tube of this digital curve. So far, no algorithm was known for the calculation of such a shortest polygonal curve. The paper provides an iterative algorithmic solution for approximating the minimum-length polygon of a given simple digital space-curve. The theoretical foundations of this algorithm are presented as well as experimental results.
Thomas Bülow, Reinhard Klette
IEEE Trans. Pattern Anal. Mach. Intell.1
2000 Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves
abstract
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean space. The length of such a simple digital curve is defined to be the length of the minimum-length polygonal curve fully contained and complete in the tube of this digital curve. So far no algorithm was known for the calculation of such a shortest polygonal curve. The paper provides an iterative algorithmic solution, including a presentation of its foundations and of experimental results.
Thomas Bülow, Reinhard Klette
ICPR1
1999 A Novel Approach to the 2D Analytic Signal
Thomas Bülow, Gerald Sommer
CAIP1
1998 Quaternionic gabor filters for local structure classification
abstract
We introduce quaternionic Gabor filters for the classification of local image structure. These filters are constructed as windowed basis functions of the quaternionic Fourier transform. We show that-in contrast to the 2D complex Gabor filters-the quaternionic Gabor filters are intrinsically 2D filters. A generalized phase concept is introduced and compared to the classical one. It is shown how local image structure can be classified by the value of the local quaternionic phase.
Thomas Bülow, Gerald Sommer
ICPR1