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

Gordon L. Kindlmann

dblp:76/6965 · DBLP profile ↗
← Back
36ranked-venue papers
13as first author
0since 2021 · last 2020
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 21 · 8 first-authorHuman-computer interaction and ubiquitous computing · 11 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 10 · 4 first-authorSoftware engineering, systems software and programming languages · 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
13 papers
Visualization and visual analytics · 83% Rendering · 5% Computer animation and physical simulation · 5%
Software engineering, system software, and programming languages
4 papers
Compilers and program optimization · 44% Programming languages and type systems · 35% Software testing · 12%
Artificial intelligence
1 paper
Segmentation and scene understanding · 100%
Interdisciplinary, comprehensive, and emerging computing
5 papers
Medical and health informatics · 91% Computational science and engineering · 9%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › visual communication
misleading visualization
0.412020
Surfacing Visualization Mirages · CHI 2020
Programming languages and type systems
domain-specific languages
0.422016
Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis · IEEE Trans. Vis. Comput. Graph. 2016
Diderot: a parallel DSL for image analysis and visualization · PLDI 2012
Visualization and visual analytics › information visualization › metadata visualization
data quality visualization
0.412019
Looks Good To Me: Visualizations As Sanity Checks · IEEE Trans. Vis. Comput. Graph. 2019
Visualization and visual analytics › information visualization › statistical graphics
distribution visualization
0.412019
Looks Good To Me: Visualizations As Sanity Checks · IEEE Trans. Vis. Comput. Graph. 2019
Visualization and visual analytics › scientific visualization
tensor field visualization
0.342010
Superquadric Glyphs for Symmetric Second-Order Tensors · IEEE Trans. Vis. Comput. Graph. 2010
Invariant Crease Lines for Topological and Structural Analysis of Tensor Fields · IEEE Trans. Vis. Comput. Graph. 2008
Diffusion Tensor Visualization with Glyph Packing · IEEE Trans. Vis. Comput. Graph. 2006
Compilers and program optimization › code generation
GPU code generation
0.212016
Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis · IEEE Trans. Vis. Comput. Graph. 2016
Compilers and program optimization › code generation
parallel code generation
0.212016
Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis · IEEE Trans. Vis. Comput. Graph. 2016
Visualization and visual analytics
visualization design
0.212014
An Algebraic Process for Visualization Design · IEEE Trans. Vis. Comput. Graph. 2014
Computer vision › Segmentation and scene understanding
interactive segmentation
0.212013
Open-Box Spectral Clustering: Applications to Medical Image Analysis · IEEE Trans. Vis. Comput. Graph. 2013
Computer vision › Segmentation and scene understanding
medical image segmentation
0.212013
Open-Box Spectral Clustering: Applications to Medical Image Analysis · IEEE Trans. Vis. Comput. Graph. 2013
Visualization and visual analytics
high-dimensional data visualization
0.212013
Open-Box Spectral Clustering: Applications to Medical Image Analysis · IEEE Trans. Vis. Comput. Graph. 2013
Computer animation and physical simulation › particle-based simulation
particle systems
0.222009
Sampling and Visualizing Creases with Scale-Space Particles · IEEE Trans. Vis. Comput. Graph. 2009
Diffusion Tensor Visualization with Glyph Packing · IEEE Trans. Vis. Comput. Graph. 2006
Visualization and visual analytics
scientific visualization
0.232016
Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis · IEEE Trans. Vis. Comput. Graph. 2016
Diderot: a parallel DSL for image analysis and visualization · PLDI 2012
Multidimensional Transfer Functions for Interactive Volume Rendering · IEEE Trans. Vis. Comput. Graph. 2002
Software testing
metamorphic testing
0.112020
Surfacing Visualization Mirages · CHI 2020
Multimedia analysis and retrieval
image analysis
0.122016
Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis · IEEE Trans. Vis. Comput. Graph. 2016
Diderot: a parallel DSL for image analysis and visualization · PLDI 2012
Rendering
volume rendering
0.132005
Reconstruction and Visualization of Planetary Nebulae · IEEE Trans. Vis. Comput. Graph. 2005
Multidimensional Transfer Functions for Interactive Volume Rendering · IEEE Trans. Vis. Comput. Graph. 2002
Strategies for Direct Volume Rendering of Diffusion Tensor Fields · IEEE Trans. Vis. Comput. Graph. 2000
Visualization and visual analytics › scientific visualization › tensor field visualization
tensor glyphs
0.112010
Superquadric Glyphs for Symmetric Second-Order Tensors · IEEE Trans. Vis. Comput. Graph. 2010
Medical and health informatics › medical imaging
medical image analysis
0.142013
Open-Box Spectral Clustering: Applications to Medical Image Analysis · IEEE Trans. Vis. Comput. Graph. 2013
Sampling and Visualizing Creases with Scale-Space Particles · IEEE Trans. Vis. Comput. Graph. 2009
Diffusion Tensor Visualization with Glyph Packing · IEEE Trans. Vis. Comput. Graph. 2006
Visualization and visual analytics › scientific visualization
feature-based visualization
0.112009
Sampling and Visualizing Creases with Scale-Space Particles · IEEE Trans. Vis. Comput. Graph. 2009
Geometric modeling and processing › shape analysis › curvature analysis
crease detection
0.112008
Invariant Crease Lines for Topological and Structural Analysis of Tensor Fields · IEEE Trans. Vis. Comput. Graph. 2008
Visualization and visual analytics
topological data analysis
0.112008
Invariant Crease Lines for Topological and Structural Analysis of Tensor Fields · IEEE Trans. Vis. Comput. Graph. 2008
Visualization and visual analytics
visual encoding
0.112014
An Algebraic Process for Visualization Design · IEEE Trans. Vis. Comput. Graph. 2014
Visualization and visual analytics › scientific visualization
astronomical visualization
0.112005
Reconstruction and Visualization of Planetary Nebulae · IEEE Trans. Vis. Comput. Graph. 2005
Rendering › volume rendering
GPU volume rendering
0.112005
Reconstruction and Visualization of Planetary Nebulae · IEEE Trans. Vis. Comput. Graph. 2005
Medical and health informatics › neuroimaging › diffusion MRI analysis
diffusion tensor imaging
0.022009
Sampling and Visualizing Creases with Scale-Space Particles · IEEE Trans. Vis. Comput. Graph. 2009
Diffusion Tensor Visualization with Glyph Packing · IEEE Trans. Vis. Comput. Graph. 2006
Visualization and visual analytics › volume visualization
transfer function design
0.012002
Multidimensional Transfer Functions for Interactive Volume Rendering · IEEE Trans. Vis. Comput. Graph. 2002
Visualization and visual analytics › medical visualization › medical image visualization
diffusion tensor imaging visualization
0.012000
Strategies for Direct Volume Rendering of Diffusion Tensor Fields · IEEE Trans. Vis. Comput. Graph. 2000
Computational science and engineering › astronomy
astrophysical simulation
0.012005
Reconstruction and Visualization of Planetary Nebulae · IEEE Trans. Vis. Comput. Graph. 2005
Rendering
GPU rendering
0.012002
Multidimensional Transfer Functions for Interactive Volume Rendering · IEEE Trans. Vis. Comput. Graph. 2002
Medical and health informatics › medical imaging › magnetic resonance imaging
diffusion-weighted imaging
0.012000
Strategies for Direct Volume Rendering of Diffusion Tensor Fields · IEEE Trans. Vis. Comput. Graph. 2000

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

metamorphic testing · 0.9algebraic visualization design · 0.8parallel compilation · 0.5domain-specific language design · 0.5GPU execution · 0.5interactive visualization · 0.5graph laplacian · 0.5crowdsourced experiments · 0.4crowdsourced experiment · 0.4spectral clustering · 0.3user study · 0.2algebraic modeling · 0.2particle systems · 0.2tensor glyph · 0.1spline interpolation · 0.1scale space theory · 0.1potential energy profiles · 0.1anisotropic mesh generation · 0.1
YearPublicationVenuePosition
2020 Surfacing Visualization Mirages
abstract
Dirty data and deceptive design practices can undermine, invert, or invalidate the purported messages of charts and graphs. These failures can arise silently: a conclusion derived from a particular visualization may look plausible unless the analyst looks closer and discovers an issue with the backing data, visual specification, or their own assumptions. We term such silent but significant failures . We describe a conceptual model of mirages and show how they can be generated at every stage of the visual analytics process. We adapt a methodology from software testing, , as a way of automatically surfacing potential mirages at the visual encoding stage of analysis through modifications to the underlying data and chart specification. We show that metamorphic testing can reliably identify mirages across a variety of chart types with relatively little prior knowledge of the data or the domain.
Andrew M. McNutt, Gordon L. Kindlmann, Michael Correll
CHI2
2019 Looks Good To Me: Visualizations As Sanity Checks
abstract
Famous examples such as Anscombe's Quartet highlight that one of the core benefits of visualizations is allowing people to discover visual patterns that might otherwise be hidden by summary statistics. This visual inspection is particularly important in exploratory data analysis, where analysts can use visualizations such as histograms and dot plots to identify data quality issues. Yet, these visualizations are driven by parameters such as histogram bin size or mark opacity that have a great deal of impact on the final visual appearance of the chart, but are rarely optimized to make important features visible. In this paper, we show that data flaws have varying impact on the visual features of visualizations, and that the adversarial or merely uncritical setting of design parameters of visualizations can obscure the visual signatures of these flaws. Drawing on the framework of Algebraic Visualization Design, we present the results of a crowdsourced study showing that common visualization types can appear to reasonably summarize distributional data while hiding large and important flaws such as missing data and extraneous modes. We make use of these results to propose additional best practices for visualizations of distributions for data quality tasks.
Michael Correll, Gordon L. Kindlmann, Carlos Scheidegger
IEEE Trans. Vis. Comput. Graph.3
2018 Rendering and Extracting Extremal Features in 3D Fields
abstract
Abstract Visualizing and extracting three‐dimensional features is important for many computational science applications, each with their own feature definitions and data types. While some are simple to state and implement (e.g. isosurfaces), others require more complicated mathematics (e.g. multiple derivatives, curvature, eigenvectors, etc.). Correctly implementing mathematical definitions is difficult, so experimenting with new features requires substantial investments. Furthermore, traditional interpolants rarely support the necessary derivatives, and approximations can reduce numerical stability. Our new approach directly translates mathematical notation into practical visualization and feature extraction, with minimal mental and implementation overhead. Using a mathematically expressive domain‐specific language, Diderot, we compute direct volume renderings and particle‐based feature samplings for a range of mathematical features. Non‐expert users can experiment with feature definitions without any exposure to meshes, interpolants, derivative computation, etc. We demonstrate high‐quality results on notoriously difficult features, such as ridges and vortex cores, using working code simple enough to be presented in its entirety.
Gordon L. Kindlmann, Charisee Chiw, T. Huynh, Attila Gyulassy, John H. Reppy, Peer-Timo Bremer
Comput. Graph. Forum1
2016 Glyphs for Asymmetric Second-Order 2D Tensors
abstract
Abstract Tensors model a wide range of physical phenomena. While symmetric tensors are sufficient for some applications (such as diffusion), asymmetric tensors are required, for example, to describe differential properties of fluid flow. Glyphs permit inspecting individual tensor values, but existing tensor glyphs are fully defined only for symmetric tensors. We propose a glyph to visualize asymmetric second‐order two‐dimensional tensors. The glyph includes visual encoding for physically significant attributes of the tensor, including rotation, anisotropic stretching, and isotropic dilation. Our glyph design conserves the symmetry and continuity properties of the underlying tensor, in that transformations of a tensor (such as rotation or negation) correspond to analogous transformations of the glyph. We show results with synthetic data from computational fluid dynamics.
Nicholas Seltzer, Gordon L. Kindlmann
Comput. Graph. Forum2
2016 Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis
abstract
Many algorithms for scientific visualization and image analysis are rooted in the world of continuous scalar, vector, and tensor fields, but are programmed in low-level languages and libraries that obscure their mathematical foundations. Diderot is a parallel domain-specific language that is designed to bridge this semantic gap by providing the programmer with a high-level, mathematical programming notation that allows direct expression of mathematical concepts in code. Furthermore, Diderot provides parallel performance that takes advantage of modern multicore processors and GPUs. The high-level notation allows a concise and natural expression of the algorithms and the parallelism allows efficient execution on real-world datasets.
Gordon L. Kindlmann, Charisee Chiw, Nicholas Seltzer, Lamont Samuels, John H. Reppy
IEEE Trans. Vis. Comput. Graph.1
2014 The effects of noise over the complete space of diffusion tensor shape
Jin-Kyu Gahm, Gordon L. Kindlmann, Daniel B. Ennis
Medical Image Anal.2
2014 An Algebraic Process for Visualization Design
abstract
We present a model of visualization design based on algebraic considerations of the visualization process. The model helps characterize visual encodings, guide their design, evaluate their effectiveness, and highlight their shortcomings. The model has three components: the underlying mathematical structure of the data or object being visualized, the concrete representation of the data in a computer, and (to the extent possible) a mathematical description of how humans perceive the visualization. Because we believe the value of our model lies in its practical application, we propose three general principles for good visualization design. We work through a collection of examples where our model helps explain the known properties of existing visualizations methods, both good and not-so-good, as well as suggesting some novel methods. We describe how to use the model alongside experimental user studies, since it can help frame experiment outcomes in an actionable manner. Exploring the implications and applications of our model and its design principles should provide many directions for future visualization research.
Gordon L. Kindlmann, Carlos Scheidegger
IEEE Trans. Vis. Comput. Graph.1
2013 Open-Box Spectral Clustering: Applications to Medical Image Analysis
abstract
Spectral clustering is a powerful and versatile technique, whose broad range of applications includes 3D image analysis. However, its practical use often involves a tedious and time-consuming process of tuning parameters and making application-specific choices. In the absence of training data with labeled clusters, help from a human analyst is required to decide the number of clusters, to determine whether hierarchical clustering is needed, and to define the appropriate distance measures, parameters of the underlying graph, and type of graph Laplacian. We propose to simplify this process via an open-box approach, in which an interactive system visualizes the involved mathematical quantities, suggests parameter values, and provides immediate feedback to support the required decisions. Our framework focuses on applications in 3D image analysis, and links the abstract high-dimensional feature space used in spectral clustering to the three-dimensional data space. This provides a better understanding of the technique, and helps the analyst predict how well specific parameter settings will generalize to similar tasks. In addition, our system supports filtering outliers and labeling the final clusters in such a way that user actions can be recorded and transferred to different data in which the same structures are to be found. Our system supports a wide range of inputs, including triangular meshes, regular grids, and point clouds. We use our system to develop segmentation protocols in chest CT and brain MRI that are then successfully applied to other datasets in an automated manner.
Thomas Schultz 0001, Gordon L. Kindlmann
IEEE Trans. Vis. Comput. Graph.2
2012 Linear Invariant Tensor Interpolation Applied to Cardiac Diffusion Tensor MRI
Jin-Kyu Gahm, Nicholas Wisniewski, Gordon L. Kindlmann, Geoffrey L. Kung, William S. Klug, Alan Garfinkel, Daniel B. Ennis
MICCAI (2)3
2012 Diderot: a parallel DSL for image analysis and visualization
abstract
Research scientists and medical professionals use imaging technology, such as computed tomography (CT) and magnetic resonance imaging (MRI) to measure a wide variety of biological and physical objects. The increasing sophistication of imaging technology creates demand for equally sophisticated computational techniques to analyze and visualize the image data. Analysis and visualization codes are often crafted for a specific experiment or set of images, thus imaging scientists need support for quickly developing codes that are reliable, robust, and efficient.
Charisee Chiw, Gordon L. Kindlmann, John H. Reppy, Lamont Samuels, Nicholas Seltzer
PLDI2
2010 Automatic Lung Lobe Segmentation Using Particles, Thin Plate Splines, and Maximum a Posteriori Estimation
James C. Ross, Raúl San José Estépar, Gordon L. Kindlmann, Alejandro A. Díaz 0001, Carl-Fredrik Westin, Edwin K. Silverman, George R. Washko
MICCAI (3)3
2010 Multi-Diffusion-Tensor Fitting via Spherical Deconvolution: A Unifying Framework
Thomas Schultz 0001, Carl-Fredrik Westin, Gordon L. Kindlmann
MICCAI (1)3
2010 A Maximum Enhancing Higher-Order Tensor Glyph
abstract
Abstract Glyphs are a fundamental tool in tensor visualization, since they provide an intuitive geometric representation of the full tensor information. The Higher‐Order Maximum Enhancing (HOME) glyph, a generalization of the second‐order tensor ellipsoid, was recently shown to emphasize the orientational information in the tensor through a pointed shape around maxima. This paper states and formally proves several important properties of this novel glyph, presents its first three‐dimensional implementation, and proposes a new coloring scheme that reflects peak direction and sharpness. Application to data from High Angular Resolution Diffusion Imaging (HARDI) shows that the method allows for interactive data exploration and confirms that the HOME glyph conveys fiber spread and crossings more effectively than the conventional polar plot.
Thomas Schultz 0001, Gordon L. Kindlmann
Comput. Graph. Forum2
2010 Superquadric Glyphs for Symmetric Second-Order Tensors
abstract
Symmetric second-order tensor fields play a central role in scientific and biomedical studies as well as in image analysis and feature-extraction methods. The utility of displaying tensor field samples has driven the development of visualization techniques that encode the tensor shape and orientation into the geometry of a tensor glyph. With some exceptions, these methods work only for positive-definite tensors (i.e. having positive eigenvalues, such as diffusion tensors). We expand the scope of tensor glyphs to all symmetric second-order tensors in two and three dimensions, gracefully and unambiguously depicting any combination of positive and negative eigenvalues. We generalize a previous method of superquadric glyphs for positive-definite tensors by drawing upon a larger portion of the superquadric shape space, supplemented with a coloring that indicates the quadratic form (including eigenvalue sign). We show that encoding arbitrary eigenvalue magnitudes requires design choices that differ fundamentally from those in previous work on traceless tensors that arise in the study of liquid crystals. Our method starts with a design of 2-D tensor glyphs guided by principles of scale-preservation and symmetry, and creates 3-D glyphs that include the 2-D glyphs in their axis-aligned cross-sections. A key ingredient of our method is a novel way of mapping from the shape space of three-dimensional symmetric second-order tensors to the unit square. We apply our new glyphs to stress tensors from mechanics, geometry tensors and Hessians from image analysis, and rate-of-deformation tensors in computational fluid dynamics.
Thomas Schultz 0001, Gordon L. Kindlmann
IEEE Trans. Vis. Comput. Graph.2
2009 Local White Matter Geometry Indices from Diffusion Tensor Gradients
Peter Savadjiev, Gordon L. Kindlmann, Sylvain Bouix, Martha Elizabeth Shenton, Carl-Fredrik Westin
MICCAI (1)2
2009 Sampling and Visualizing Creases with Scale-Space Particles
abstract
Particle systems have gained importance as a methodology for sampling implicit surfaces and segmented objects to improve mesh generation and shape analysis. We propose that particle systems have a significantly more general role in sampling structure from unsegmented data. We describe a particle system that computes samplings of crease features (i.e. ridges and valleys, as lines or surfaces) that effectively represent many anatomical structures in scanned medical data. Because structure naturally exists at a range of sizes relative to the image resolution, computer vision has developed the theory of scale-space, which considers an n-D image as an (n+1)-D stack of images at different blurring levels. Our scale-space particles move through continuous four-dimensional scale-space according to spatial constraints imposed by the crease features, a particle-image energy that draws particles towards scales of maximal feature strength, and an inter-particle energy that controls sampling density in space and scale. To make scale-space practical for large three-dimensional data, we present a spline-based interpolation across scale from a small number of pre-computed blurrings at optimally selected scales. The configuration of the particle system is visualized with tensor glyphs that display information about the local Hessian of the image, and the scale of the particle. We use scale-space particles to sample the complex three-dimensional branching structure of airways in lung CT, and the major white matter structures in brain DTI.
Gordon L. Kindlmann, Raúl San José Estépar, Stephen M. Smith 0001, Carl-Fredrik Westin
IEEE Trans. Vis. Comput. Graph.1
2008 Invariant Crease Lines for Topological and Structural Analysis of Tensor Fields
abstract
We introduce a versatile framework for characterizing and extracting salient structures in three-dimensional symmetric second-order tensor fields. The key insight is that degenerate lines in tensor fields, as defined by the standard topological approach, are exactly crease (ridge and valley) lines of a particular tensor invariant called mode. This reformulation allows us to apply well-studied approaches from scientific visualization or computer vision to the extraction of topological lines in tensor fields. More generally, this main result suggests that other tensor invariants, such as anisotropy measures like fractional anisotropy (FA), can be used in the same framework in lieu of mode to identify important structural properties in tensor fields. Our implementation addresses the specific challenge posed by the non-linearity of the considered scalar measures and by the smoothness requirement of the crease manifold computation. We use a combination of smooth reconstruction kernels and adaptive refinement strategy that automatically adjust the resolution of the analysis to the spatial variation of the considered quantities. Together, these improvements allow for the robust application of existing ridge line extraction algorithms in the tensor context of our problem. Results are proposed for a diffusion tensor MRI dataset, and for a benchmark stress tensor field used in engineering research.
Xavier Tricoche, Gordon L. Kindlmann, Carl-Fredrik Westin
IEEE Trans. Vis. Comput. Graph.2
2007 Geodesic-Loxodromes for Diffusion Tensor Interpolation and Difference Measurement
Gordon L. Kindlmann, Raúl San José Estépar, Marc Niethammer, Steven Haker, Carl-Fredrik Westin
MICCAI (1)1
2007 Delineating white matter structure in diffusion tensor MRI with anisotropy creases
Gordon L. Kindlmann, Xavier Tricoche, Carl-Fredrik Westin
Medical Image Anal.1
2007 Diffusion Tensor Analysis With Invariant Gradients and Rotation Tangents
abstract
Guided by empirically established connections between clinically important tissue properties and diffusion tensor parameters, we introduce a framework for decomposing variations in diffusion tensors into changes in shape and orientation. Tensor shape and orientation both have three degrees-of-freedom, spanned by invariant gradients and rotation tangents, respectively. As an initial demonstration of the framework, we create a tunable measure of tensor difference that can selectively respond to shape and orientation. Second, to analyze the spatial gradient in a tensor volume (a third-order tensor), our framework generates edge strength measures that can discriminate between different neuroanatomical boundaries, as well as creating a novel detector of white matter tracts that are adjacent yet distinctly oriented. Finally, we apply the framework to decompose the fourth-order diffusion covariance tensor into individual and aggregate measures of shape and orientation covariance, including a direct approximation for the variance of tensor invariants such as fractional anisotropy.
Gordon L. Kindlmann, Daniel B. Ennis, Ross T. Whitaker, Carl-Fredrik Westin
IEEE Trans. Medical Imaging1
2006 Diffusion k-tensor Estimation from Q-ball Imaging Using Discretized Principal Axes
Ørjan Bergmann, Gordon L. Kindlmann, Arvid Lundervold, Carl-Fredrik Westin
MICCAI (2)2
2006 Anisotropy Creases Delineate White Matter Structure in Diffusion Tensor MRI
Gordon L. Kindlmann, Xavier Tricoche, Carl-Fredrik Westin
MICCAI (1)1
2006 Diffusion Tensor Visualization with Glyph Packing
abstract
A common goal of multivariate visualization is to enable data inspection at discrete points, while also illustrating larger-scale continuous structures. In diffusion tensor visualization, glyphs are typically used to meet the first goal, and methods such as texture synthesis or fiber tractography can address the second. We adapt particle systems originally developed for surface modeling and anisotropic mesh generation to enhance the utility of glyph-based tensor visualizations. By carefully distributing glyphs throughout the field (either on a slice, or in the volume) into a dense packing, using potential energy profiles shaped by the local tensor value, we remove undue visual emphasis of the regular sampling grid of the data, and the underlying continuous features become more apparent. The method is demonstrated on a DT-MRI scan of a patient with a brain tumor.
Gordon L. Kindlmann, Carl-Fredrik Westin
IEEE Trans. Vis. Comput. Graph.1
2005 Visual Medicine: Part One - Medical Imaging
Dirk Bartz, Gordon L. Kindlmann, Klaus Mueller 0001, Bernhard Preim, Markus Wacker
IEEE Visualization2
2005 Visual Medicine: Part Two - Advanced Applications of Medical Imaging
Dirk Bartz, Gordon L. Kindlmann, Klaus Mueller 0001, Bernhard Preim, Markus Wacker
IEEE Visualization2
2005 Reconstruction and Visualization of Planetary Nebulae
abstract
From our terrestrially confined viewpoint, the actual three-dimensional shape of distant astronomical objects is, in general, very challenging to determine. For one class of astronomical objects, however, spatial structure can be recovered from conventional 2D images alone. So-called planetary nebulae (PNe) exhibit pronounced symmetry characteristics that come about due to fundamental physical processes. Making use of this symmetry constraint, we present a technique to automatically recover the axisymmetric structure of many planetary nebulae from photographs. With GPU-based volume rendering driving a nonlinear optimization, we estimate the nebula's local emission density as a function of its radial and axial coordinates and we recover the orientation of the nebula relative to Earth. The optimization refines the nebula model and its orientation by minimizing the differences between the rendered image and the original astronomical image. The resulting model allows creating realistic 3D visualizations of these nebulae, for example, for planetarium shows and other educational purposes. In addition, the recovered spatial distribution of the emissive gas can help astrophysicists gain deeper insight into the formation processes of planetary nebulae.
Marcus A. Magnor, Gordon L. Kindlmann, Charles D. Hansen, Neb Duric
IEEE Trans. Vis. Comput. Graph.2
2004 Constrained Inverse Volume Rendering for Planetary Nebulae
abstract
Determining the three-dimensional structure of distant astronomical objects is a challenging task, given that terrestrial observations provide only one viewpoint. For this task, bipolar planetary nebulae are interesting objects of study because of their pronounced axial symmetry due to fundamental physical processes. Making use of this symmetry constraint, we present a technique to automatically recover the axisymmetric structure of bipolar planetary nebulae from two-dimensional images. With GPU-based volume rendering driving a nonlinear optimization, we estimate the nebula's local emission density as a function of its radial and axial coordinates, and we recover the orientation of the nebula relative to Earth. The optimization refines the nebula model and its orientation by minimizing the differences between the rendered image and the original astronomical image. The resulting model enables realistic 3D visualizations of planetary nebulae, e.g. for educational purposes in planetarium shows. In addition, the recovered spatial distribution of the emissive gas allows validating computer simulation results of the astrophysical formation processes of planetary nebulae.
Marcus A. Magnor, Gordon L. Kindlmann, Neb Duric, Charles D. Hansen
IEEE Visualization2
2004 Visualization of Intricate Flow Structures for Vortex Breakdown Analysis
abstract
Vortex breakdowns and flow recirculation are essential phenomena in aeronautics where they appear as a limiting factor in the design of modern aircrafts. Because of the inherent intricacy of these features, standard flow visualization techniques typically yield cluttered depictions. The paper addresses the challenges raised by the visual exploration and validation of two CFD simulations involving vortex breakdown. To permit accurate and insightful visualization we propose a new approach that unfolds the geometry of the breakdown region by letting a plane travel through the structure along a curve. We track the continuous evolution of the associated projected vector field using the theoretical framework of parametric topology. To improve the understanding of the spatial relationship between the resulting curves and lines we use direct volume rendering and multidimensional transfer functions for the display of flow-derived scalar quantities. This enriches the visualization and provides an intuitive context for the extracted topological information. Our results offer clear, synthetic depictions that permit new insight into the structural properties of vortex breakdowns.
Xavier Tricoche, Christoph Garth, Gordon L. Kindlmann, Eduard Deines, Gerik Scheuermann, Markus Rütten, Charles D. Hansen
IEEE Visualization3
2003 Curvature-Based Transfer Functions for Direct Volume Rendering: Methods and Applications
abstract
Direct volume rendering of scalar fields uses a transfer function to map locally measured data properties to opacities and colors. The domain of the transfer function is typically the one-dimensional space of scalar data values. This paper advances the use of curvature information in multi-dimensional transfer functions, with a methodology for computing high-quality curvature measurements. The proposed methodology combines an implicit formulation of curvature with convolution-based reconstruction of the field. We give concrete guidelines for implementing the methodology, and illustrate the importance of choosing accurate filters for computing derivatives with convolution. Curvature-based transfer functions are shown to extend the expressivity and utility of volume rendering through contributions in three different application areas: nonphotorealistic volume rendering, surface smoothing via anisotropic diffusion, and visualization of isosurface uncertainty.
Gordon L. Kindlmann, Ross T. Whitaker, Tolga Tasdizen, Torsten Möller
IEEE Visualization1
2002 Face-based Luminance Matching for Perceptual Colormap Generation
abstract
Most systems used for creating and displaying colormap-based visualizations are not photometrically calibrated. That is, the relationship between RGB input levels and perceived luminance is usually not known, due to variations in the monitor, hardware configuration, and the viewing environment. However, the luminance component of perceptually based colormaps should be controlled, due to the central role that luminance plays in our visual processing. We address this problem with a simple and effective method for performing luminance matching on an uncalibrated monitor. The method is akin to the minimally distinct border technique (a previous method of luminance matching used for measuring luminous efficiency), but our method relies on the brain's highly developed ability to distinguish human faces. We present a user study showing that our method produces equivalent results to the minimally distinct border technique, but with significantly improved precision. We demonstrate how results from our luminance matching method can be directly applied to create new univariate colormaps.
Gordon L. Kindlmann, Erik Reinhard, Sarah H. Creem-Regehr
IEEE Visualization1
2002 Multidimensional Transfer Functions for Interactive Volume Rendering
abstract
Most direct volume renderings produced today employ 1D transfer functions which assign color and opacity to the volume based solely on the single scalar quantity which comprises the data set. Though they have not received widespread attention, multi-dimensional transfer functions are a very effective way to extract materials and their boundaries for both scalar and multivariate data. However, identifying good transfer functions is difficult enough in 1D, let alone 2D or 3D. This paper demonstrates an important class of 3D transfer functions for scalar data, and describes the application of multi-dimensional transfer functions to multivariate data. We present a set of direct manipulation widgets that make specifying such transfer functions intuitive and convenient. We also describe how to use modern graphics hardware to both interactively render with multidimensional transfer functions and to provide interactive shadows for volumes. The transfer functions, widgets and hardware combine to form a powerful system for interactive volume exploration.
Joe Michael Kniss, Gordon L. Kindlmann, Charles D. Hansen
IEEE Trans. Vis. Comput. Graph.2
2001 Interactive Volume Rendering Using Multi-Dimensional Transfer Functions and Direct Manipulation Widgets
abstract
Most direct volume renderings produced today employ one-dimensional transfer functions, which assign color and opacity to the volume based solely on the single scalar quantity which comprises the dataset. Though they have not received widespread attention, multi-dimensional transfer functions are a very effective way to extract specific material boundaries and convey subtle surface properties. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data (based on data value, gradient magnitude, and a second directional derivative), and describes a set of direct manipulation widgets which make specifying such transfer functions intuitive and convenient. We also describe how to use modem graphics hardware to interactively render with multi-dimensional transfer functions. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.
Joe Michael Kniss, Gordon L. Kindlmann, Charles D. Hansen
IEEE Visualization2
2000 The transfer function bake-off (panel session)
Hanspeter Pfister, William E. Lorensen, William J. Schroeder, Chandrajit L. Bajaj, Gordon L. Kindlmann
IEEE Visualization5
2000 Strategies for Direct Volume Rendering of Diffusion Tensor Fields
abstract
Diffusion-weighted magnetic resonance imaging is a relatively new modality capable of elucidating the fibrous structure of certain types of tissue, such as the white matter within the brain. One tool for interpreting this data is volume rendering because it permits the visualization of three dimensional structure without a prior segmentation process. In order to use volume rendering, however, we must develop methods for assigning opacity and color to the data, and create a method to shade the data to improve the legibility of the rendering. Previous work introduced three such methods: barycentric opacity maps, hue-balls (for color), and lit-tensors (for shading). The paper expands on and generalizes these methods, describing and demonstrating further means of generating opacity, color, and shading from the tensor information. We also propose anisotropic reaction-diffusion volume textures as an additional tool for visualizing the structure of diffusion data. The patterns generated by this process can be visualized on their own or they can be used to supplement the volume rendering strategies described in the rest of the paper. Finally, because interpolation between data points is a fundamental issue in volume rendering, we conclude with a discussion and evaluation of three distinct interpolation methods suitable for diffusion tensor MRI data.
Gordon L. Kindlmann, David M. Weinstein, David A. Hart
IEEE Trans. Vis. Comput. Graph.1
1999 Hue-Balls and Lit-Tensors for Direct Volume Rendering of Diffusion Tensor Fields
abstract
With the development of magnetic resonance imaging techniques for acquiring diffusion tensor data from biological tissue, visualization of tensor data has become a new research focus. The diffusion tensor describes the directional dependence of water molecules' diffusion and can be represented by a three-by-three symmetric matrix. Visualization of second-order tensor fields is difficult because the data values have many degrees of freedom. Existing visualization techniques are best at portraying the tensor's properties over a two-dimensional field, or over a small subset of locations within a three-dimensional field. A means of visualizing the global structure in measured diffusion tensor data is needed. We propose the use of direct volume rendering, with novel approaches for the tensors' coloring, lighting, and opacity assignment. Hue-balls use a two-dimensional colormap on the unit sphere to illustrate the tensor's action as a linear operator. Lit-tensors provide a lighting model for tensors which includes as special cases both lit-lines (from streamline vector visualization) and standard Phong surface lighting. Together with an opacity assignment based on a novel two-dimensional barycentric space of anisotropy, these methods are shown to produce informative renderings of measured diffusion tensor data from the human brain.
Gordon L. Kindlmann, David M. Weinstein
IEEE Visualization1
1999 Tensorlines: Advection-Diffusion Based Propagation through Diffusion Tensor Fields
abstract
Tracking linear features through tensor field datasets is an open research problem with widespread utility in medical and engineering disciplines. Existing tracking methods, which consider only the preferred local diffusion direction as they propagate, fail to accurately follow features as they enter regions of local complexity. This shortcoming is a result of partial voluming; that is, voxels in these regions often contain contributions from multiple features. These combined contributions result in ambiguities when deciding local primary feature orientation based solely on the preferred diffusion direction. We introduce a novel feature extraction method which we term tensorline propagation. Our method resolves the above ambiguity by incorporating information about the nearby orientation of the feature, as well as the anisotropic classification of the local tensor. The nearby orientation information is added in the spirit of an advection term in a standard diffusion based propagation technique, and has the effect of stabilizing the tracking. To demonstrate the efficacy of tensorlines, we apply this method to the neuroscience problem of tracking white-matter bundles within the brain.
David M. Weinstein, Gordon L. Kindlmann, Eric C. Lundberg
IEEE Visualization2