EDBT 2026 Demo / reviewers in the wild / expert
Daniel Jönsson
dblp:13/10766
· DBLP profile ↗
16ranked-venue papers
7as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 14 · 7 first-author · 3 since 2021Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 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
8 papers |
Rendering · 74% Visualization and visual analytics · 23% Computational photography and imaging · 2% |
Topics — the 16 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering
global illumination |
1.1 | 4 | 2022 | Direct Transmittance Estimation in Heterogeneous Participating Media Using Approximated Taylor Expansions · IEEE Trans. Vis. Comput. Graph. 2022 Correlated Photon Mapping for Interactive Global Illumination of Time-Varying Volumetric Data · IEEE Trans. Vis. Comput. Graph. 2017 Efficient Visibility Encoding for Dynamic Illumination in Direct Volume Rendering · IEEE Trans. Vis. Comput. Graph. 2012 |
Rendering
volume rendering |
1.0 | 5 | 2017 | Correlated Photon Mapping for Interactive Global Illumination of Time-Varying Volumetric Data · IEEE Trans. Vis. Comput. Graph. 2017 Boundary Aware Reconstruction of Scalar Fields · IEEE Trans. Vis. Comput. Graph. 2014 Verifying Volume Rendering Using Discretization Error Analysis · IEEE Trans. Vis. Comput. Graph. 2014 |
Rendering › volume rendering
heterogeneous participating media |
0.6 | 1 | 2022 | Direct Transmittance Estimation in Heterogeneous Participating Media Using Approximated Taylor Expansions · IEEE Trans. Vis. Comput. Graph. 2022 |
Rendering
light transport |
0.6 | 1 | 2022 | Direct Transmittance Estimation in Heterogeneous Participating Media Using Approximated Taylor Expansions · IEEE Trans. Vis. Comput. Graph. 2022 |
Rendering
participating media |
0.6 | 1 | 2022 | Direct Transmittance Estimation in Heterogeneous Participating Media Using Approximated Taylor Expansions · IEEE Trans. Vis. Comput. Graph. 2022 |
Rendering › light transport
transmittance estimation |
0.6 | 1 | 2022 | Direct Transmittance Estimation in Heterogeneous Participating Media Using Approximated Taylor Expansions · IEEE Trans. Vis. Comput. Graph. 2022 |
Visualization and visual analytics › volume visualization
transfer function design |
0.4 | 2 | 2016 | Intuitive Exploration of Volumetric Data Using Dynamic Galleries · IEEE Trans. Vis. Comput. Graph. 2016 Boundary Aware Reconstruction of Scalar Fields · IEEE Trans. Vis. Comput. Graph. 2014 |
Rendering › global illumination
photon mapping |
0.4 | 2 | 2017 | Correlated Photon Mapping for Interactive Global Illumination of Time-Varying Volumetric Data · IEEE Trans. Vis. Comput. Graph. 2017 Historygrams: Enabling Interactive Global Illumination in Direct Volume Rendering using Photon Mapping · IEEE Trans. Vis. Comput. Graph. 2012 |
Rendering › volume rendering
transfer function editing |
0.4 | 2 | 2017 | Correlated Photon Mapping for Interactive Global Illumination of Time-Varying Volumetric Data · IEEE Trans. Vis. Comput. Graph. 2017 Historygrams: Enabling Interactive Global Illumination in Direct Volume Rendering using Photon Mapping · IEEE Trans. Vis. Comput. Graph. 2012 |
Visualization and visual analytics
volume visualization |
0.3 | 2 | 2016 | Intuitive Exploration of Volumetric Data Using Dynamic Galleries · IEEE Trans. Vis. Comput. Graph. 2016 Boundary Aware Reconstruction of Scalar Fields · IEEE Trans. Vis. Comput. Graph. 2014 |
Rendering › volume rendering
direct volume rendering |
0.3 | 2 | 2012 | Efficient Visibility Encoding for Dynamic Illumination in Direct Volume Rendering · IEEE Trans. Vis. Comput. Graph. 2012 Historygrams: Enabling Interactive Global Illumination in Direct Volume Rendering using Photon Mapping · IEEE Trans. Vis. Comput. Graph. 2012 |
Visualization and visual analytics › volume visualization
time-varying volumetric data |
0.3 | 1 | 2017 | Correlated Photon Mapping for Interactive Global Illumination of Time-Varying Volumetric Data · IEEE Trans. Vis. Comput. Graph. 2017 |
Computational photography and imaging › physics-based vision
material classification |
0.2 | 1 | 2014 | Boundary Aware Reconstruction of Scalar Fields · IEEE Trans. Vis. Comput. Graph. 2014 |
Visualization and visual analytics › visualization evaluation
verifiable visualization |
0.2 | 1 | 2014 | Verifying Volume Rendering Using Discretization Error Analysis · IEEE Trans. Vis. Comput. Graph. 2014 |
Visualization and visual analytics
interactive visualization |
0.1 | 1 | 2016 | Intuitive Exploration of Volumetric Data Using Dynamic Galleries · IEEE Trans. Vis. Comput. Graph. 2016 |
Rendering
visibility computation |
0.0 | 1 | 2012 | Efficient Visibility Encoding for Dynamic Illumination in Direct Volume Rendering · IEEE Trans. Vis. Comput. Graph. 2012 |
Methods — techniques the papers use, named apart from their topics
taylor expansion · 0.6russian roulette · 0.6ratio tracking · 0.6importance sampling · 0.6layered architecture · 0.4photon trace reuse · 0.3low-resolution grid · 0.3touch interaction · 0.2dynamic previews · 0.2convergence analysis · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Foreword to the special section on visual computing for biology and medicine (VCBM 2023)
Renata G. Raidou, James B. Procter, Thomas Höllt, Daniel Jönsson |
Comput. Graph. | 5 |
| 2022 | Where did my Lines go? Visualizing Missing Data in Parallel CoordinatesabstractAbstract We evaluate visualization concepts to represent missing values in parallel coordinates. We focus on the trade‐off between the ability to perceive missing values and the concept's impact on common tasks. For this purpose, we identified three missing value representation concepts: removing line segments where values are missing, adding a separate, horizontal axis onto which missing values are projected, and using imputed values as a replacement for missing values. For the missing values axis and imputed values concepts, we additionally add downplay and highlight variations. We performed a crowd‐sourced, quantitative user study with 732 participants comparing the concepts and their variations using five real‐world datasets. Based on our findings, we provide suggestions regarding which visual encoding to employ depending on the task at focus. Alex Bäuerle, Christian van Onzenoodt, Simon der Kinderen, Jimmy Johansson 0001, Daniel Jönsson, Timo Ropinski |
Comput. Graph. Forum | 5 |
| 2022 | Direct Transmittance Estimation in Heterogeneous Participating Media Using Approximated Taylor ExpansionsabstractEvaluating the transmittance between two points along a ray is a key component in solving the light transport through heterogeneous participating media and entails computing an intractable exponential of the integrated medium's extinction coefficient. While algorithms for estimating this transmittance exist, there is a lack of theoretical knowledge about their behaviour, which also prevent new theoretically sound algorithms from being developed. For this purpose, we introduce a new class of unbiased transmittance estimators based on random sampling or truncation of a Taylor expansion of the exponential function. In contrast to classical tracking algorithms, these estimators are non-analogous to the physical light transport process and directly sample the underlying extinction function without performing incremental advancement. We present several versions of the new class of estimators, based on either importance sampling or Russian roulette to provide finite unbiased estimators of the infinite Taylor series expansion. We also show that the well known ratio tracking algorithm can be seen as a special case of the new class of estimators. Lastly, we conduct performance evaluations on both the central processing unit (CPU) and the graphics processing unit (GPU), and the results demonstrate that the new algorithms outperform traditional algorithms for heterogeneous mediums. Daniel Jönsson, Joel Kronander, Jonas Unger, Thomas B. Schön, Magnus Wrenninge |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2020 | Classifying the Classifier: Dissecting the Weight Space of Neural NetworksabstractThis paper presents an empirical study on the weights of neural networks, where we interpret each model as a point in a high-dimensional space – the neural weight space. To explore the complex structure of this space, we sample from a diverse selection of training variations (dataset, optimization procedure, architecture, etc.) of neural network classifiers, and train a large number of models to represent the weight space. Then, we use a machine learning approach for analyzing and extracting information from this space. Most centrally, we train a number of novel deep meta-classifiers with the objective of classifying different properties of the training setup by identifying their footprints in the weight space. Thus, the meta-classifiers probe for patterns induced by hyper-parameters, so that we can quantify how much, where, and when these are encoded through the optimization process. This provides a novel and complementary view for explainable AI, and we show how meta-classifiers can reveal a great deal of information about the training setup and optimization, by only considering a small subset of randomly selected consecutive weights. To promote further research on the weight space, we release the neural weight space (NWS) dataset – a collection of 320K weight snapshots from 16K individually trained deep neural networks. Gabriel Eilertsen, Daniel Jönsson, Timo Ropinski, Jonas Unger, Anders Ynnerman |
ECAI | 2 |
| 2020 | VisualNeuro: A Hypothesis Formation and Reasoning Application for Multi-Variate Brain Cohort Study DataabstractAbstract We present an application, and its development process, for interactive visual analysis of brain imaging data and clinical measurements. The application targets neuroscientists interested in understanding the correlations between active brain regions and physiological or psychological factors. The application has been developed in a participatory design process and has subsequently been released as the free software ‘VisualNeuro’. From initial observations of the neuroscientists' workflow, we concluded that while existing tools provide powerful analysis options, they lack effective interactive exploration requiring the use of many tools side by side. Consequently, our application has been designed to simplify the workflow combining statistical analysis with interactive visual exploration. The resulting environment comprises parallel coordinates for effective overview and selection, Welch's t‐test to filter out brain regions with statistically significant differences and multiple visualizations for comparison between brain regions and clinical parameters. These exploration concepts enable neuroscientists to interactively explore the complex bidirectional interplay between clinical and brain measurements and easily compare different patient groups. A qualitative user study has been performed with three neuroscientists from different domains. The study shows that the developed environment supports simultaneous analysis of more parameters, provides rapid pathways to insights and is an effective tool for hypothesis formation. Daniel Jönsson, Albin Bergström, Camilla Forsell, Rozalyn Simon, Maria Engström, Susanna Walter, Anders Ynnerman, Ingrid Hotz |
Comput. Graph. Forum | 1 |
| 2020 | A combined strategy of feature selection and machine learning to identify predictors of prediabetesabstractOBJECTIVE: To identify predictors of prediabetes using feature selection and machine learning on a nationally representative sample of the US population. MATERIALS AND METHODS: We analyzed n = 6346 men and women enrolled in the National Health and Nutrition Examination Survey 2013-2014. Prediabetes was defined using American Diabetes Association guidelines. The sample was randomly partitioned to training (n = 3174) and internal validation (n = 3172) sets. Feature selection algorithms were run on training data containing 156 preselected exposure variables. Four machine learning algorithms were applied on 46 exposure variables in original and resampled training datasets built using 4 resampling methods. Predictive models were tested on internal validation data (n = 3172) and external validation data (n = 3000) prepared from National Health and Nutrition Examination Survey 2011-2012. Model performance was evaluated using area under the receiver operating characteristic curve (AUROC). Predictors were assessed by odds ratios in logistic models and variable importance in others. The Centers for Disease Control (CDC) prediabetes screening tool was the benchmark to compare model performance. RESULTS: Prediabetes prevalence was 23.43%. The CDC prediabetes screening tool produced 64.40% AUROC. Seven optimal (≥ 70% AUROC) models identified 25 predictors including 4 potentially novel associations; 20 by both logistic and other nonlinear/ensemble models and 5 solely by the latter. All optimal models outperformed the CDC prediabetes screening tool (P < 0.05). DISCUSSION: Combined use of feature selection and machine learning increased predictive performance outperforming the recommended screening tool. A range of predictors of prediabetes was identified. CONCLUSION: This work demonstrated the value of combining feature selection with machine learning to identify a wide range of predictors that could enhance prediabetes prediction and clinical decision-making. Kushan De Silva, Daniel Jönsson, Ryan T. Demmer |
J. Am. Medical Informatics Assoc. | 2 |
| 2020 | Inviwo - A Visualization System with Usage Abstraction LevelsabstractThe complexity of today's visualization applications demands specific visualization systems tailored for the development of these applications. Frequently, such systems utilize levels of abstraction to improve the application development process, for instance by providing a data flow network editor. Unfortunately, these abstractions result in several issues, which need to be circumvented through an abstraction-centered system design. Often, a high level of abstraction hides low level details, which makes it difficult to directly access the underlying computing platform, which would be important to achieve an optimal performance. Therefore, we propose a layer structure developed for modern and sustainable visualization systems allowing developers to interact with all contained abstraction levels. We refer to this interaction capabilities as usage abstraction levels, since we target application developers with various levels of experience. We formulate the requirements for such a system, derive the desired architecture, and present how the concepts have been exemplary realized within the Inviwo visualization system. Furthermore, we address several specific challenges that arise during the realization of such a layered architecture, such as communication between different computing platforms, performance centered encapsulation, as well as layer-independent development by supporting cross layer documentation and debugging capabilities. Daniel Jönsson, Peter Steneteg, Erik Sundén, Rickard Englund, Sathish Kottravel, Martin Falk, Anders Ynnerman, Ingrid Hotz, Timo Ropinski |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2019 | Do we read what we share?: analyzing the click dynamic of news articles shared on TwitterabstractNews and information spread over social media can have big impact on thoughts, beliefs, and opinions. It is therefore important to understand the sharing dynamics on these forums. However, most studies trying to capture these dynamics rely only on Twitter's open APIs to measure how frequently articles are shared/retweeted, and therefore do not capture how many users actually read the articles linked in these tweets. To address this problem, in this paper, we first develop a novel measurement methodology, which combines the Twitter steaming API, the Bitly API, and careful sample rate selection to simultaneously collect and analyze the timeline of both the number of retweets and clicks generated by news article links. Second, we present a temporal analysis of the news cycle based on five-day-long traces (containing both clicks and retweet over time) for the news article links discovered during a seven-day period. Among other things, our analysis highlights differences in the relative timelines observed for clicks and retweets (e.g., retweet data often lags and underestimates the bias towards reading popular links/articles), and helps answer important questions regarding differences in how age-based biases and churn affect how frequently news articles shared on Twitter are accessed over time. Jesper Holmström, Daniel Jönsson, Filip Polbratt, Olav Nilsson, Linnea Lundström, Sebastian Ragnarsson, Anton Forsberg, Karl Andersson 0003, Niklas Carlsson |
ASONAM | 2 |
| 2017 | Correlated Photon Mapping for Interactive Global Illumination of Time-Varying Volumetric DataabstractWe present a method for interactive global illumination of both static and time-varying volumetric data based on reduction of the overhead associated with re-computation of photon maps. Our method uses the identification of photon traces invariant to changes of visual parameters such as the transfer function (TF), or data changes between time-steps in a 4D volume. This lets us operate on a variant subset of the entire photon distribution. The amount of computation required in the two stages of the photon mapping process, namely tracing and gathering, can thus be reduced to the subset that are affected by a data or visual parameter change. We rely on two different types of information from the original data to identify the regions that have changed. A low resolution uniform grid containing the minimum and maximum data values of the original data is derived for each time step. Similarly, for two consecutive time-steps, a low resolution grid containing the difference between the overlapping data is used. We show that this compact metadata can be combined with the transfer function to identify the regions that have changed. Each photon traverses the low-resolution grid to identify if it can be directly transferred to the next photon distribution state or if it needs to be recomputed. An efficient representation of the photon distribution is presented leading to an order of magnitude improved performance of the raycasting step. The utility of the method is demonstrated in several examples that show visual fidelity, as well as performance. The examples show that visual quality can be retained when the fraction of retraced photons is as low as 40%-50%. Daniel Jönsson, Anders Ynnerman |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2016 | Intuitive Exploration of Volumetric Data Using Dynamic GalleriesabstractIn this work we present a volume exploration method designed to be used by novice users and visitors to science centers and museums. The volumetric digitalization of artifacts in museums is of rapidly increasing interest as enhanced user experience through interactive data visualization can be achieved. This is, however, a challenging task since the vast majority of visitors are not familiar with the concepts commonly used in data exploration, such as mapping of visual properties from values in the data domain using transfer functions. Interacting in the data domain is an effective way to filter away undesired information but it is difficult to predict where the values lie in the spatial domain. In this work we make extensive use of dynamic previews instantly generated as the user explores the data domain. The previews allow the user to predict what effect changes in the data domain will have on the rendered image without being aware that visual parameters are set in the data domain. Each preview represents a subrange of the data domain where overview and details are given on demand through zooming and panning. The method has been designed with touch interfaces as the target platform for interaction. We provide a qualitative evaluation performed with visitors to a science center to show the utility of the approach. Daniel Jönsson, Martin Falk, Anders Ynnerman |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2014 | A Survey of Volumetric Illumination Techniques for Interactive Volume RenderingabstractAbstract Interactive volume rendering in its standard formulation has become an increasingly important tool in many application domains. In recent years several advanced volumetric illumination techniques to be used in interactive scenarios have been proposed. These techniques claim to have perceptual benefits as well as being capable of producing more realistic volume rendered images. Naturally, they cover a wide spectrum of illumination effects, including varying shading and scattering effects. In this survey, we review and classify the existing techniques for advanced volumetric illumination. The classification will be conducted based on their technical realization, their performance behaviour as well as their perceptual capabilities. Based on the limitations revealed in this review, we will define future challenges in the area of interactive advanced volumetric illumination. Daniel Jönsson, Erik Sundén, Anders Ynnerman, Timo Ropinski |
Comput. Graph. Forum | 1 |
| 2014 | Continuous Levels-of-Detail and Visual Abstraction for Seamless Molecular VisualizationabstractAbstract Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the level‐of‐detail concept, where we exploit three different abstractions combined in one visualization. Firstly, molecular surface abstraction exploits three different surfaces, solvent‐excluded surface (SES), Gaussian kernels and van der Waals spheres, combined as one surface by linear interpolation. Secondly, we introduce three shading abstraction levels and a method for creating seamless transitions between these representations. The SES representation with full shading and added contours stands in focus while on the other side a sphere representation of a cluster of atoms with constant shading and without contours provide the context. Thirdly, we propose a hierarchical abstraction based on a set of clusters formed on molecular atoms. All three abstraction models are driven by one importance function classifying the scene into the near‐, mid‐ and far‐field. Moreover, we introduce a methodology to render the entire molecule directly using the A‐buffer technique, which further improves the performance. The rendering performance is evaluated on series of molecules of varying atom counts. Július Parulek, Daniel Jönsson, Timo Ropinski, Stefan Bruckner, Anders Ynnerman, Ivan Viola |
Comput. Graph. Forum | 2 |
| 2014 | Verifying Volume Rendering Using Discretization Error AnalysisabstractWe propose an approach for verification of volume rendering correctness based on an analysis of the volume rendering integral, the basis of most DVR algorithms. With respect to the most common discretization of this continuous model (Riemann summation), we make assumptions about the impact of parameter changes on the rendered results and derive convergence curves describing the expected behavior. Specifically, we progressively refine the number of samples along the ray, the grid size, and the pixel size, and evaluate how the errors observed during refinement compare against the expected approximation errors. We derive the theoretical foundations of our verification approach, explain how to realize it in practice, and discuss its limitations. We also report the errors identified by our approach when applied to two publicly available volume rendering packages. Tiago Etiene, Daniel Jönsson, Timo Ropinski, Carlos Scheidegger, João Luiz Dihl Comba, Luis Gustavo Nonato, Robert M. Kirby, Anders Ynnerman, Cláudio T. Silva |
IEEE Trans. Vis. Comput. Graph. | 2 |
| 2014 | Boundary Aware Reconstruction of Scalar FieldsabstractIn visualization, the combined role of data reconstruction and its classification plays a crucial role. In this paper we propose a novel approach that improves classification of different materials and their boundaries by combining information from the classifiers at the reconstruction stage. Our approach estimates the targeted materials' local support before performing multiple material-specific reconstructions that prevent much of the misclassification traditionally associated with transitional regions and transfer function (TF) design. With respect to previously published methods our approach offers a number of improvements and advantages. For one, it does not rely on TFs acting on derivative expressions, therefore it is less sensitive to noisy data and the classification of a single material does not depend on specialized TF widgets or specifying regions in a multidimensional TF. Additionally, improved classification is attained without increasing TF dimensionality, which promotes scalability to multivariate data. These aspects are also key in maintaining low interaction complexity. The results are simple-to-achieve visualizations that better comply with the user's understanding of discrete features within the studied object. Stefan Lindholm, Daniel Jönsson, Charles D. Hansen, Anders Ynnerman |
IEEE Trans. Vis. Comput. Graph. | 2 |
| 2012 | Historygrams: Enabling Interactive Global Illumination in Direct Volume Rendering using Photon MappingabstractIn this paper, we enable interactive volumetric global illumination by extending photon mapping techniques to handle interactive transfer function (TF) and material editing in the context of volume rendering. We propose novel algorithms and data structures for finding and evaluating parts of a scene affected by these parameter changes, and thus support efficient updates of the photon map. In direct volume rendering (DVR) the ability to explore volume data using parameter changes, such as editable TFs, is of key importance. Advanced global illumination techniques are in most cases computationally too expensive, as they prevent the desired interactivity. Our technique decreases the amount of computation caused by parameter changes, by introducing Historygrams which allow us to efficiently reuse previously computed photon media interactions. Along the viewing rays, we utilize properties of the light transport equations to subdivide a view-ray into segments and independently update them when invalid. Unlike segments of a view-ray, photon scattering events within the volumetric medium needs to be sequentially updated. Using our Historygram approach, we can identify the first invalid photon interaction caused by a property change, and thus reuse all valid photon interactions. Combining these two novel concepts, supports interactive editing of parameters when using volumetric photon mapping in the context of DVR. As a consequence, we can handle arbitrarily shaped and positioned light sources, arbitrary phase functions, bidirectional reflectance distribution functions and multiple scattering which has previously not been possible in interactive DVR. Daniel Jönsson, Joel Kronander, Timo Ropinski, Anders Ynnerman |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2012 | Efficient Visibility Encoding for Dynamic Illumination in Direct Volume RenderingabstractWe present an algorithm that enables real-time dynamic shading in direct volume rendering using general lighting, including directional lights, point lights, and environment maps. Real-time performance is achieved by encoding local and global volumetric visibility using spherical harmonic (SH) basis functions stored in an efficient multiresolution grid over the extent of the volume. Our method enables high-frequency shadows in the spatial domain, but is limited to a low-frequency approximation of visibility and illumination in the angular domain. In a first pass, level of detail (LOD) selection in the grid is based on the current transfer function setting. This enables rapid online computation and SH projection of the local spherical distribution of visibility information. Using a piecewise integration of the SH coefficients over the local regions, the global visibility within the volume is then computed. By representing the light sources using their SH projections, the integral over lighting, visibility, and isotropic phase functions can be efficiently computed during rendering. The utility of our method is demonstrated in several examples showing the generality and interactive performance of the approach. Joel Kronander, Daniel Jönsson, Joakim Löw, Patric Ljung, Anders Ynnerman, Jonas Unger |
IEEE Trans. Vis. Comput. Graph. | 2 |