Jochen Görtler

dblp:129/3841 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
3since 2021 · last 2024
0000-0001-6510-0908ORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 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.

Computer graphics and multimedia
7 papers
Visualization and visual analytics · 93% Rendering · 7%
Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › graph visualization
graph layout
0.922022
SPEULER: Semantics-preserving Euler Diagrams · IEEE Trans. Vis. Comput. Graph. 2022
Probabilistic Graph Layout for Uncertain Network Visualization · IEEE Trans. Vis. Comput. Graph. 2017
Visualization and visual analytics
model visualization
0.812024
Talaria: Interactively Optimizing Machine Learning Models for Efficient Inference · CHI 2024
Visualization and visual analytics › set visualization
euler diagrams
0.612022
SPEULER: Semantics-preserving Euler Diagrams · IEEE Trans. Vis. Comput. Graph. 2022
Visualization and visual analytics
uncertainty visualization
0.522020
Bubble Treemaps for Uncertainty Visualization · IEEE Trans. Vis. Comput. Graph. 2018
Uncertainty-Aware Principal Component Analysis · IEEE Trans. Vis. Comput. Graph. 2020
Visualization and visual analytics
dimensionality reduction
0.412020
Uncertainty-Aware Principal Component Analysis · IEEE Trans. Vis. Comput. Graph. 2020
Visualization and visual analytics
information visualization
0.412019
Stippling of 2D Scalar Fields · IEEE Trans. Vis. Comput. Graph. 2019
Rendering › non-photorealistic rendering
stippling
0.412019
Stippling of 2D Scalar Fields · IEEE Trans. Vis. Comput. Graph. 2019
Visualization and visual analytics › hierarchical data visualization
treemap
0.312018
Bubble Treemaps for Uncertainty Visualization · IEEE Trans. Vis. Comput. Graph. 2018
Visualization and visual analytics
graph visualization
0.312017
Probabilistic Graph Layout for Uncertain Network Visualization · IEEE Trans. Vis. Comput. Graph. 2017
Machine learning › Efficient and distributed learning
model compression
0.212024
Talaria: Interactively Optimizing Machine Learning Models for Efficient Inference · CHI 2024
Machine learning and data management
model evaluation
0.212022
Neo: Generalizing Confusion Matrix Visualization to Hierarchical and Multi-Output Labels · CHI 2022
Visualization and visual analytics › scientific visualization › scalar field visualization
contour display
0.112019
Stippling of 2D Scalar Fields · IEEE Trans. Vis. Comput. Graph. 2019
Visualization and visual analytics
visual encoding
0.112019
Stippling of 2D Scalar Fields · IEEE Trans. Vis. Comput. Graph. 2019
Graph algorithms and graph theory
graph embedding
0.112017
Probabilistic Graph Layout for Uncertain Network Visualization · IEEE Trans. Vis. Comput. Graph. 2017

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

usability survey · 2.3log analysis · 2.3qualitative interviews · 1.5probability distribution algebra · 1.1formative study · 1.1qualitative interview · 0.8layout algorithm · 0.6sensitivity analysis · 0.4principal component analysis · 0.4observation-validating study · 0.4linde-buzo-gray stippling · 0.4splatting · 0.3monte carlo · 0.3force-directed layout · 0.3edge bundling · 0.3
YearPublicationVenuePosition
2024 Talaria: Interactively Optimizing Machine Learning Models for Efficient Inference
abstract
On-device machine learning (ML) moves computation from the cloud to personal devices, protecting user privacy and enabling intelligent user experiences. However, fitting models on devices with limited resources presents a major technical challenge: practitioners need to optimize models and balance hardware metrics such as model size, latency, and power. To help practitioners create efficient ML models, we designed and developed Talaria : a model visualization and optimization system. Talaria enables practitioners to compile models to hardware, interactively visualize model statistics, and simulate optimizations to test the impact on inference metrics. Since its internal deployment two years ago, we have evaluated Talaria using three methodologies: (1) a log analysis highlighting its growth of 800+ practitioners submitting 3,600+ models; (2) a usability survey with 26 users assessing the utility of 20 Talaria features; and (3) a qualitative interview with the 7 most active users about their experience using Talaria.
Fred Hohman, Chaoqun Wang 0002, Jinmook Lee, Jochen Görtler, Dominik Moritz, Jeffrey P. Bigham, Zhile Ren, Cecile Foret, Qi Shan, Xiaoyi Zhang 0006
CHI4
2022 Neo: Generalizing Confusion Matrix Visualization to Hierarchical and Multi-Output Labels
abstract
The confusion matrix, a ubiquitous visualization for helping people evaluate machine learning models, is a tabular layout that compares predicted class labels against actual class labels over all data instances. We conduct formative research with machine learning practitioners at Apple and find that conventional confusion matrices do not support more complex data-structures found in modern-day applications, such as hierarchical and multi-output labels. To express such variations of confusion matrices, we design an algebra that models confusion matrices as probability distributions. Based on this algebra, we develop Neo, a visual analytics system that enables practitioners to flexibly author and interact with hierarchical and multi-output confusion matrices, visualize derived metrics, renormalize confusions, and share matrix specifications. Finally, we demonstrate Neo’s utility with three model evaluation scenarios that help people better understand model performance and reveal hidden confusions.
Jochen Görtler, Fred Hohman, Dominik Moritz, Kanit Wongsuphasawat, Donghao Ren, Marc Kirchner, Kayur Patel
CHI1
2022 SPEULER: Semantics-preserving Euler Diagrams
abstract
Creating comprehensible visualizations of highly overlapping set-typed data is a challenging task due to its complexity. To facilitate insights into set connectivity and to leverage semantic relations between intersections, we propose a fast two-step layout technique for Euler diagrams that are both well-matched and well-formed. Our method conforms to established form guidelines for Euler diagrams regarding semantics, aesthetics, and readability. First, we establish an initial ordering of the data, which we then use to incrementally create a planar, connected, and monotone dual graph representation. In the next step, the graph is transformed into a circular layout that maintains the semantics and yields simple Euler diagrams with smooth curves. When the data cannot be represented by simple diagrams, our algorithm always falls back to a solution that is not well-formed but still well-matched, whereas previous methods often fail to produce expected results. We show the usefulness of our method for visualizing set-typed data using examples from text analysis and infographics. Furthermore, we discuss the characteristics of our approach and evaluate our method against state-of-the-art methods.
Rebecca Kehlbeck, Jochen Görtler, Yunhai Wang, Oliver Deussen
IEEE Trans. Vis. Comput. Graph.2
2020 Uncertainty-Aware Principal Component Analysis
abstract
We present a technique to perform dimensionality reduction on data that is subject to uncertainty. Our method is a generalization of traditional principal component analysis (PCA) to multivariate probability distributions. In comparison to non-linear methods, linear dimensionality reduction techniques have the advantage that the characteristics of such probability distributions remain intact after projection. We derive a representation of the PCA sample covariance matrix that respects potential uncertainty in each of the inputs, building the mathematical foundation of our new method: uncertainty-aware PCA. In addition to the accuracy and performance gained by our approach over sampling-based strategies, our formulation allows us to perform sensitivity analysis with regard to the uncertainty in the data. For this, we propose factor traces as a novel visualization that enables to better understand the influence of uncertainty on the chosen principal components. We provide multiple examples of our technique using real-world datasets. As a special case, we show how to propagate multivariate normal distributions through PCA in closed form. Furthermore, we discuss extensions and limitations of our approach.
Jochen Görtler, Thilo Spinner, Dirk Streeb, Daniel Weiskopf, Oliver Deussen
IEEE Trans. Vis. Comput. Graph.1
2019 Stippling of 2D Scalar Fields
abstract
We propose a technique to represent two-dimensional data using stipples. While stippling is often regarded as an illustrative method, we argue that it is worth investigating its suitability for the visualization domain. For this purpose, we generalize the Linde-Buzo-Gray stippling algorithm for information visualization purposes to encode continuous and discrete 2D data. Our proposed modifications provide more control over the resulting distribution of stipples for encoding additional information into the representation, such as contours. We show different approaches to depict contours in stipple drawings based on locally adjusting the stipple distribution. Combining stipple-based gradients and contours allows for simultaneous assessment of the overall structure of the data while preserving important local details. We discuss the applicability of our technique using datasets from different domains and conduct observation-validating studies to assess the perception of stippled representations.
Jochen Görtler, Marc Spicker, Christoph Schulz 0001, Daniel Weiskopf, Oliver Deussen
IEEE Trans. Vis. Comput. Graph.1
2018 Bubble Treemaps for Uncertainty Visualization
abstract
We present a novel type of circular treemap, where we intentionally allocate extra space for additional visual variables. With this extended visual design space, we encode hierarchically structured data along with their uncertainties in a combined diagram. We introduce a hierarchical and force-based circle-packing algorithm to compute Bubble Treemaps, where each node is visualized using nested contour arcs. Bubble Treemaps do not require any color or shading, which offers additional design choices. We explore uncertainty visualization as an application of our treemaps using standard error and Monte Carlo-based statistical models. To this end, we discuss how uncertainty propagates within hierarchies. Furthermore, we show the effectiveness of our visualization using three different examples: the package structure of Flare, the S&P 500 index, and the US consumer expenditure survey.
Jochen Görtler, Christoph Schulz 0001, Daniel Weiskopf, Oliver Deussen
IEEE Trans. Vis. Comput. Graph.1
2017 Probabilistic Graph Layout for Uncertain Network Visualization
abstract
We present a novel uncertain network visualization technique based on node-link diagrams. Nodes expand spatially in our probabilistic graph layout, depending on the underlying probability distributions of edges. The visualization is created by computing a two-dimensional graph embedding that combines samples from the probabilistic graph. A Monte Carlo process is used to decompose a probabilistic graph into its possible instances and to continue with our graph layout technique. Splatting and edge bundling are used to visualize point clouds and network topology. The results provide insights into probability distributions for the entire network-not only for individual nodes and edges. We validate our approach using three data sets that represent a wide range of network types: synthetic data, protein-protein interactions from the STRING database, and travel times extracted from Google Maps. Our approach reveals general limitations of the force-directed layout and allows the user to recognize that some nodes of the graph are at a specific position just by chance.
Christoph Schulz 0001, Arlind Nocaj, Jochen Görtler, Oliver Deussen, Ulrik Brandes, Daniel Weiskopf
IEEE Trans. Vis. Comput. Graph.3