Markus van Almsick

dblp:98/958 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

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

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

Computer graphics and multimedia
3 papers
Visualization and visual analytics · 50% Rendering · 38% Image and video processing · 6%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › medical visualization › medical image visualization
diffusion tensor imaging visualization
0.222011
Fused DTI/HARDI Visualization · IEEE Trans. Vis. Comput. Graph. 2011
GPU-Based Ray-Casting of Spherical Functions Applied to High Angular Resolution Diffusion Imaging · IEEE Trans. Vis. Comput. Graph. 2011
Visualization and visual analytics
medical visualization
0.222011
Fused DTI/HARDI Visualization · IEEE Trans. Vis. Comput. Graph. 2011
GPU-Based Ray-Casting of Spherical Functions Applied to High Angular Resolution Diffusion Imaging · IEEE Trans. Vis. Comput. Graph. 2011
Rendering › volume rendering › ray casting
GPU ray-casting
0.112011
GPU-Based Ray-Casting of Spherical Functions Applied to High Angular Resolution Diffusion Imaging · IEEE Trans. Vis. Comput. Graph. 2011
Rendering › volume rendering
ray casting
0.112011
GPU-Based Ray-Casting of Spherical Functions Applied to High Angular Resolution Diffusion Imaging · IEEE Trans. Vis. Comput. Graph. 2011
Image and video processing
image filtering
0.112006
An Efficient Method for Tensor Voting Using Steerable Filters · ECCV (4) 2006
Geometric modeling and processing
tensor voting
0.112006
An Efficient Method for Tensor Voting Using Steerable Filters · ECCV (4) 2006

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

spherical harmonics · 0.1laplace expansion · 0.1glyph rendering · 0.1fragment shader · 0.1classification scheme · 0.1GPU computing · 0.1tensor voting · 0.1steerable filters · 0.1
YearPublicationVenuePosition
2011 GPU-Based Ray-Casting of Spherical Functions Applied to High Angular Resolution Diffusion Imaging
abstract
Abstract-Any sufficiently smooth, positive, real-valued function ψ : S(2) → K+ on a sphere S(2) can be expanded by a Laplace expansion into a sum of spherical harmonics. Given the Laplace expansion coefficients, we provide a CPU and GPU-based algorithm that renders the radial graph of ψ in a fast and efficient way by ray-casting the glyph of ψ in the fragment shader of a GPU. The proposed rendering algorithm has proven highly useful in the visualization of high angular resolution diffusion imaging (HARDI) data. Our implementation of the rendering algorithm can display simultaneously thousands of glyphs depicting the local diffusivity of water. The rendering is fast enough to allow for interactive manipulation of large HARDI data sets.
Markus van Almsick, Tim H. J. M. Peeters, Vesna Prckovska, Anna Vilanova, Bart M. ter Haar Romeny
IEEE Trans. Vis. Comput. Graph.1
2011 Fused DTI/HARDI Visualization
abstract
High-angular resolution diffusion imaging (HARDI) is a diffusion weighted MRI technique that overcomes some of the decisive limitations of its predecessor, diffusion tensor imaging (DTI), in the areas of composite nerve fiber structure. Despite its advantages, HARDI raises several issues: complex modeling of the data, nonintuitive and computationally demanding visualization, inability to interactively explore and transform the data, etc. To overcome these drawbacks, we present a novel, multifield visualization framework that adopts the benefits of both DTI and HARDI. By applying a classification scheme based on HARDI anisotropy measures, the most suitable model per imaging voxel is automatically chosen. This classification allows simplification of the data in areas with single fiber bundle coherence. To accomplish fast and interactive visualization for both HARDI and DTI modalities, we exploit the capabilities of modern GPUs for glyph rendering and adopt DTI fiber tracking in suitable regions. The resulting framework, allows user-friendly data exploration of fused HARDI and DTI data. Many incorporated features such as sharpening, normalization, maxima enhancement and different types of color coding of the HARDI glyphs, simplify the data and enhance its features. We provide a qualitative user evaluation that shows the potentials of our visualization tools in several HARDI applications.
Vesna Prckovska, Tim H. J. M. Peeters, Markus van Almsick, Bart M. ter Haar Romeny, Anna Vilanova
IEEE Trans. Vis. Comput. Graph.3
2009 Fast and sleek glyph rendering for interactive HARDI data exploration
abstract
High angular resolution diffusion imaging (HARDI) is an emerging magnetic resonance imaging (MRI) technique that overcomes some decisive limitations of its predecessor diffusion tensor imaging (DTI). HARDI can resolve locally more than one direction in the diffusion pattern of water molecules and thereby opens up the opportunity to display and track crossing fibers. Showing the local structure of the reconstructed, angular probability profiles in a fast, detailed, and interactive way can improve the quality of the research in this area and help to move it into clinical application. In this paper we present a novel approach for HARDI glyph visualization or, more generally, for the visualization of any function that resides on a sphere and that can be expressed by a Laplace series. Our GPU-accelerated glyph rendering improves the performance of the traditional way of HARDI glyph visualization as well as the visual quality of the reconstructed data, thus offering interactive HARDI data exploration of the local structure of the white brain matter in-vivo. In this paper we exploit the capabilities of modern GPUs to overcome the large, processor-intensive and memory-consuming data visualization.
Tim H. J. M. Peeters, Vesna Prckovska, Markus van Almsick, Anna Vilanova, Bart M. ter Haar Romeny
PacificVis3
2006 An Efficient Method for Tensor Voting Using Steerable Filters
Erik Franken, Markus van Almsick, Peter M. J. Rongen, Luc Florack, Bart M. ter Haar Romeny
ECCV (4)2
2006 Detection of Electrophysiology Catheters in Noisy Fluoroscopy Images
Erik Franken, Peter M. J. Rongen, Markus van Almsick, Bart M. ter Haar Romeny
MICCAI (2)3