Klaus Hildebrandt

Klaus Hildebrandt

Auto-generated profile, based on publicly available information

Klaus Hildebrandt

Computer Graphics and Visualization Lab, TU Delft, Delft, The Netherlands

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 June 2016 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
CBChristopher Brandt
Christopher Brandt
LSLeonardo Scandolo
Leonardo Scandolo
EEElmar Eisemann
Elmar Eisemann
KHKlaus Hildebrandt
Klaus Hildebrandt

4 January 2022 in ACM Transactions on Graphics
Verified
Journal Article
Open access
ANAhmad Nasikun
Ahmad Nasikun
KHKlaus Hildebrandt
Klaus Hildebrandt
Sparse eigenproblems are important for various applications in computer graphics. The spectrum and eigenfunctions of the Laplace–Beltrami operator, for example, are fundamental for methods in shape analysis and mesh processing. The Subspace Iteration Method is a robust solver for these problems. In practice, however, Lanczos schemes are often faster. In this article, we introduce the Hierarchical Subspace Iteration Method (HSIM) , a novel solver for sparse eigenproblems that operates on a hierarchy of nested vector spaces. The hierarchy is constructed such that on the coarsest space all eigenpairs can be computed with a dense eigensolver. HSIM uses these eigenpairs as initialization and iterates from coarse to fine over the hierarchy. On each level, subspace iterations, initialized with the solution from the previous level, are used to approximate the eigenpairs. This approach substantially reduces the number of iterations needed on the finest grid compared to the non-hierarchical Subspace Iteration Method. Our experiments show that HSIM can solve Laplace–Beltrami eigenproblems on meshes faster than state-of-the-art methods based on Lanczos iterations, preconditioned conjugate gradients, and subspace iterations.

12 February 2024 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
MSMartin Skrodzki
Martin Skrodzki
HGHunter van Geffen
Hunter van Geffen
NCNicolas F. Chaves-De-Plaza
Nicolas F. Chaves-De-Plaza
THThomas Höllt
Thomas Höllt
EEElmar Eisemann
Elmar Eisemann
KHKlaus Hildebrandt
Klaus Hildebrandt
The need to understand the structure of hierarchical or high-dimensional data is present in a variety of fields. Hyperbolic spaces have proven to be an important tool for embedding computations and analysis tasks as their non-linear nature lends itself well to tree or graph data. Subsequently, they have also been used in the visualization of high-dimensional data, where they exhibit increased embedding performance. However, none of the existing dimensionality reduction methods for embedding into hyperbolic spaces scale well with the size of the input data. That is because the embeddings are computed via iterative optimization schemes and the computation cost of every iteration is quadratic in the size of the input. Furthermore, due to the non-linear nature of hyperbolic spaces, euclidean acceleration structures cannot directly be translated to the hyperbolic setting. This article introduces the first acceleration structure for hyperbolic embeddings, building upon a polar quadtree. We compare our approach with existing methods and demonstrate that it computes embeddings of similar quality in significantly less time. Implementation and scripts for the experiments can be found at https://graphics.tudelft.nl/accelerating-hyperbolic-tsne .

20 December 2024 in International Journal of Computer Assisted Radiology and Surgery
Verified
Journal Article
Open access
PDF file
JPJette J Peek
Jette J Peek
XZXucong Zhang
Xucong Zhang
KHK. Hildebrandt
K. Hildebrandt
SMS. A. Max
S. A. Max
ASAmir H Sadeghi
Amir H Sadeghi
Edris A.F. MahtabEdris A.F. Mahtab
Edris A.F. Mahtab
Purpose: In this feasibility study, we aimed to create a dedicated pulmonary augmented reality (AR) workflow to enable a semi-automated intraoperative overlay of the pulmonary anatomy during video-assisted thoracoscopic surgery (VATS) or robot-assisted thoracoscopic surgery (RATS). Methods: Initially, the stereoscopic cameras were calibrated to obtain the intrinsic camera parameters. Intraoperatively, stereoscopic images were recorded and a 3D point cloud was generated from these images. By manually selecting the bifurcation key points, the 3D segmentation (from the diagnostic CT scan) was registered onto the intraoperative 3D point cloud. Results: Image reprojection errors were 0.34 and 0.22 pixels for the VATS and RATS cameras, respectively. We created disparity maps and point clouds for all eight patients. Time for creation of the 3D AR overlay was 5 min. Validation of the point clouds was performed, resulting in a median absolute error of 0.20 mm [IQR 0.10–0.54]. We were able to visualize the AR overlay and identify the arterial bifurcations adequately for five patients. In addition to creating AR overlays of the visible or invisible structures intraoperatively, we successfully visualized branch labels and altered the transparency of the overlays. Conclusion: An algorithm was developed transforming the operative field into a 3D point cloud surface. This allowed for an accurate registration and visualization of preoperative 3D models. Using this system, surgeons can navigate through the patient's anatomy intraoperatively, especially during crucial moments, by visualizing otherwise invisible structures. This proposed registration method lays the groundwork for automated intraoperative AR navigation during minimally invasive pulmonary resections.

23 July 2023
Verified
Conference Paper
Open access
RWRuben Wiersma
Ruben Wiersma
ANAhmad Nasikun
Ahmad Nasikun
EEElmar Eisemann
Elmar Eisemann
KHKlaus Hildebrandt
Klaus Hildebrandt

12 August 2020 in Computer Graphics Forum
Verified
Journal Article
Open access
PDF file
JSJosua Sassen
Josua Sassen
KHKlaus Hildebrandt
Klaus Hildebrandt
MRMartin Rumpf
Martin Rumpf
This paper introduces the construction of a low‐dimensional nonlinear space capturing the variability of a non‐rigid shape from a data set of example poses. The core of the approach is a Sparse Principal Geodesic Analysis (SPGA) on the Riemannian manifold of discrete shells, in which a pose of a non‐rigid shape is a point. The SPGA is invariant to rigid body motions of the poses and supports large deformation. Since the Riemannian metric measures the membrane and bending distortions of the shells, the sparsity term forces the modes to describe largely decoupled and localized deformations. This property facilitates the analysis of articulated shapes. The modes often represent characteristic articulations of the shape and usually come with a decomposing of the spanned subspace into low‐dimensional widely decoupled subspaces. For example, for human models, one expects distinct, localized modes for the bending of elbow or knee whereas some more modes are required to represent shoulder articulation. The decoupling property can be used to construct useful starting points for the computation of the nonlinear deformations via a superposition of shape submanifolds resulting from the decoupling. In a preprocessing stage, samples of the individual subspaces are computed, and, in an online phase, these are interpolated multilinearly. This accelerates the construction of nonlinear deformations and makes the method applicable for interactive applications. The method is compared to alternative approaches and the benefits are demonstrated on different kinds of input data.