Terece Louise Turton
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Terece Louise Turton has a total of 143 co-authors. Here are the top co-authors by number of shared publications:
- James Ahrens
Los Alamos National Laboratory
12 shared publications - Soumya Dutta
IIT Kanpur, Kanpur, India
7 shared publications - Roxana Bujack
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
6 shared publications - David Honegger Rogers
Information Sciences Group, Los Alamos National Laboratory, Los Alamos, US
4 shared publications - Divya Banesh
Los Alamos National Laboratory
4 shared publications - Ayan Biswas
Los Alamos National Laboratory, USA
3 shared publications
Latest Publications
- 11 December 2025
- Published by Office of Scientific and Technical Information (OSTI)
InferA: A Smart Assistant for Cosmological Ensemble Data
- 11 December 2025
- Published by Office of Scientific and Technical Information (OSTI)
InferA: A Smart Assistant for Cosmological Ensemble Data
- 5 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 32 (1) , 1021-1031
VizGenie: Toward Self-Refining, Domain-Aware Workflows for Next-Generation Scientific Visualization
We present VizGenie, a self-improving, agentic framework that advances scientific visualization through large language model (LLM) by orchestrating of a collection of domain-specific and dynamically generated modules. Users initially access core functionalities-such as threshold-based filtering, slice extraction, and statistical analysis-through pre-existing tools. For tasks beyond this baseline, VizGenie autonomously employs LLMs to generate new visualization scripts (e.g., VTK Python code), expanding its capabilities on-demand. Each generated script undergoes automated backend validation and is seamlessly integrated upon successful testing, continuously enhancing the system's adaptability and robustness. A distinctive feature of VizGenie is its intuitive natural language interface, allowing users to issue high-level feature-based queries (e.g., “visualize the skull” or “highlight tissue boundaries”). The system leverages image-based analysis and visual question answering (VQA) via fine-tuned vision models to interpret these queries precisely, bridging domain expertise and technical implementation. Additionally, users can interactively query generated visualizations through VQA, facilitating deeper exploration. Reliability and reproducibility are further strengthened by Retrieval-Augmented Generation (RAG), providing context-driven responses while maintaining comprehensive provenance records. Evaluations on complex volumetric datasets demonstrate significant reductions in cognitive overhead for iterative visualization tasks. By integrating curated domain-specific tools with LLM-driven flexibility, VizGenie not only accelerates insight generation but also establishes a sustainable, continuously evolving visualization practice. The resulting platform dynamically learns from user interactions, consistently enhancing support for feature-centric exploration and reproducible research in scientific visualization.
- 5 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 32 (1) , 1021-1031
VizGenie: Toward Self-Refining, Domain-Aware Workflows for Next-Generation Scientific Visualization
We present VizGenie, a self-improving, agentic framework that advances scientific visualization through large language model (LLM) by orchestrating of a collection of domain-specific and dynamically generated modules. Users initially access core functionalities-such as threshold-based filtering, slice extraction, and statistical analysis-through pre-existing tools. For tasks beyond this baseline, VizGenie autonomously employs LLMs to generate new visualization scripts (e.g., VTK Python code), expanding its capabilities on-demand. Each generated script undergoes automated backend validation and is seamlessly integrated upon successful testing, continuously enhancing the system's adaptability and robustness. A distinctive feature of VizGenie is its intuitive natural language interface, allowing users to issue high-level feature-based queries (e.g., “visualize the skull” or “highlight tissue boundaries”). The system leverages image-based analysis and visual question answering (VQA) via fine-tuned vision models to interpret these queries precisely, bridging domain expertise and technical implementation. Additionally, users can interactively query generated visualizations through VQA, facilitating deeper exploration. Reliability and reproducibility are further strengthened by Retrieval-Augmented Generation (RAG), providing context-driven responses while maintaining comprehensive provenance records. Evaluations on complex volumetric datasets demonstrate significant reductions in cognitive overhead for iterative visualization tasks. By integrating curated domain-specific tools with LLM-driven flexibility, VizGenie not only accelerates insight generation but also establishes a sustainable, continuously evolving visualization practice. The resulting platform dynamically learns from user interactions, consistently enhancing support for feature-centric exploration and reproducible research in scientific visualization.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 20-28
InferA: A Smart Assistant for Cosmological Ensemble Data
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 20-28
Open AccessInferA: A Smart Assistant for Cosmological Ensemble Data
- 3 November 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (1) , 193-207
The ECP SICM project: Managing complex memory hierarchies for exascale applications
The Exascale Computing Project (ECP)’s Simplified Interface to Complex Memories (SICM) effort focuses on developing universal interfaces for discovering, managing, and sharing data across complex memory hierarchies. These facilitate the exploitation of emerging memory technologies and support precise control over their various trade-offs such as high-bandwidth versus low-latency, persistent versus ephemeral, high-capacity versus low-capacity, and near-CPU versus near-GPU. SICM comprises three interrelated components: a low-level interface, a high-level interface, and a persistent-heap interface. The low-level SICM interface is intended for system and run-time developers as well as expert application developers who prefer full control of the memory objects used within their application. The high-level SICM interface builds upon the low-level interface, employing application-level profiling and analysis to optimize data management for complex memory hierarchies. The persistent-heap interface provides applications with a persistent memory allocator that can allocate custom C++ data structures in both block-storage and byte-addressable persistent memories.
- 3 November 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (1) , 193-207
The ECP SICM project: Managing complex memory hierarchies for exascale applications
The Exascale Computing Project (ECP)’s Simplified Interface to Complex Memories (SICM) effort focuses on developing universal interfaces for discovering, managing, and sharing data across complex memory hierarchies. These facilitate the exploitation of emerging memory technologies and support precise control over their various trade-offs such as high-bandwidth versus low-latency, persistent versus ephemeral, high-capacity versus low-capacity, and near-CPU versus near-GPU. SICM comprises three interrelated components: a low-level interface, a high-level interface, and a persistent-heap interface. The low-level SICM interface is intended for system and run-time developers as well as expert application developers who prefer full control of the memory objects used within their application. The high-level SICM interface builds upon the low-level interface, employing application-level profiling and analysis to optimize data management for complex memory hierarchies. The persistent-heap interface provides applications with a persistent memory allocator that can allocate custom C++ data structures in both block-storage and byte-addressable persistent memories.
- 6 October 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (1) , 32-51
The ECP ALPINE project: In situ and post hoc visualization infrastructure and analysis capabilities for exascale
A significant challenge on an exascale computer is the speed at which we compute results exceeds by many orders of magnitude the speed at which we save these results. Therefore the Exascale Computing Project (ECP) ALPINE project focuses on providing exascale-ready visualization solutions including in situ processing. In situ visualization and analysis runs as the simulation is run, on simulations results are they are generated avoiding the need to save entire simulations to storage for later analysis. The ALPINE project made post hoc visualization tools, ParaView and VisIt, exascale ready and developed in situ algorithms and infrastructures. The suite of ALPINE algorithms developed under ECP includes novel approaches to enable automated data analysis and visualization to focus on the most important aspects of the simulation. Many of the algorithms also provide data reduction benefits to meet the I/O challenges at exascale. ALPINE developed a new lightweight in situ infrastructure, Ascent.
- 6 October 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (1) , 32-51
The ECP ALPINE project: In situ and post hoc visualization infrastructure and analysis capabilities for exascale
A significant challenge on an exascale computer is the speed at which we compute results exceeds by many orders of magnitude the speed at which we save these results. Therefore the Exascale Computing Project (ECP) ALPINE project focuses on providing exascale-ready visualization solutions including in situ processing. In situ visualization and analysis runs as the simulation is run, on simulations results are they are generated avoiding the need to save entire simulations to storage for later analysis. The ALPINE project made post hoc visualization tools, ParaView and VisIt, exascale ready and developed in situ algorithms and infrastructures. The suite of ALPINE algorithms developed under ECP includes novel approaches to enable automated data analysis and visualization to focus on the most important aspects of the simulation. Many of the algorithms also provide data reduction benefits to meet the I/O challenges at exascale. ALPINE developed a new lightweight in situ infrastructure, Ascent.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 30 (9) , 6507-6519
Efficient Computation of Geodesics in Color Space
Although scientists agree that a perceptual color space is not Euclidean and color difference measures, such as CIELAB's Δ E 2000 , model these aspects of color perception, colormaps are still mostly evaluated through piecewise linear interpolation in a Euclidean color space. In a non-Euclidean setting, the piecewise linear interpolation of a colormap through control points translates to finding shortest paths. Alternatively, a smooth interpolation can be generalized to finding the straightest path. Both approaches are difficult to solve and are compute intensive. We compare the 11 most promising optimization algorithms for the computation of a geodesic either as the shortest or as the straightest path to find the most efficient one to use for colormap interpolation in real-world applications. For two control points, the zero curvature algorithms excelled, especially the 2D relaxation method. For multiple control points, only the mimimal curvature algorithms can produce smooth curves, amongst which the 1D relaxation method performed best.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 30 (9) , 6507-6519
Efficient Computation of Geodesics in Color Space
Although scientists agree that a perceptual color space is not Euclidean and color difference measures, such as CIELAB's Δ E 2000 , model these aspects of color perception, colormaps are still mostly evaluated through piecewise linear interpolation in a Euclidean color space. In a non-Euclidean setting, the piecewise linear interpolation of a colormap through control points translates to finding shortest paths. Alternatively, a smooth interpolation can be generalized to finding the straightest path. Both approaches are difficult to solve and are compute intensive. We compare the 11 most promising optimization algorithms for the computation of a geodesic either as the shortest or as the straightest path to find the most efficient one to use for colormap interpolation in real-world applications. For two control points, the zero curvature algorithms excelled, especially the 2D relaxation method. For multiple control points, only the mimimal curvature algorithms can produce smooth curves, amongst which the 1D relaxation method performed best.
- 20 July 2023
- Published by Office of Scientific and Technical Information (OSTI)
ASC Data Science Infrastructure Project June 2023 [Slides]
The U.S. Department of Energy's Office of Scientific and Technical Information
- 20 July 2023
- Published by Office of Scientific and Technical Information (OSTI)
ASC Data Science Infrastructure Project June 2023 [Slides]
The U.S. Department of Energy's Office of Scientific and Technical Information
- 1 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 11-20
Analyzing the Impact of Lossy Data Reduction on Volume Rendering of Cosmology Data
Cosmology simulations are among some of the largest simulations currently run on supercomputers, generating terabytes to petabytes of data for each run. Consequently, scien-tists are seeking to reduce the amount of storage needed while preserving enough quality for analysis and visualization of the data. One of the most commonly used visualization techniques for cosmology simulations is volume rendering. Here, we investigate how different types of lossy error-bound compression algorithms affect the quality of volume-rendered images generated from reconstructed datasets. We also compute a number of image quality assessment metrics to determine which ones are the most effective at identifying artifacts in the visualizations.
- 1 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 11-20
Analyzing the Impact of Lossy Data Reduction on Volume Rendering of Cosmology Data
Cosmology simulations are among some of the largest simulations currently run on supercomputers, generating terabytes to petabytes of data for each run. Consequently, scien-tists are seeking to reduce the amount of storage needed while preserving enough quality for analysis and visualization of the data. One of the most commonly used visualization techniques for cosmology simulations is volume rendering. Here, we investigate how different types of lossy error-bound compression algorithms affect the quality of volume-rendered images generated from reconstructed datasets. We also compute a number of image quality assessment metrics to determine which ones are the most effective at identifying artifacts in the visualizations.
- Open Access
- 9 September 2022
- Published by Association for Research in Vision and Ophthalmology (ARVO) in Journal of Vision
- Vol. 22 (10) , 9
Maximum likelihood estimation of difference scaling functions for suprathreshold judgments
Maximum likelihood estimation (MLE) has been used to produce perceptual scales from binary judgments of triads and quadruples. This method relies on Thurstone’s theory of a stochastic perceptual process where the perceived difference of two stimuli is the difference in their perceived strengths. It is possible that the perception of a suprathreshold difference is overestimated when adding smaller differences, a phenomenon referred to as diminishing returns. The current approach to construct a perceptual scale using MLE does not account for this phenomenon. We present a way to model the perception of differences using MLE and Thurstone’s theory, adapted to allow the possibility of diminishing returns. This method is validated using Monte Carlo simulated responses to experimental triads and can correctly model diminishing returns, the absence of diminishing returns, and the opposite of diminishing returns both in the cases when a perceptual scale is known and when the true perceived strengths of the stimuli are unknown. Additionally, this method was applied to empirical data sets to determine its feasibility in investigations of perception. Ultimately, it was found that this analysis allows for more accurate modeling of suprathreshold difference judgments, a more complete understanding of the perceptual processes underlying comparisons, and the evaluation of Thurstone’s theory of difference judgments.
- 9 September 2022
- Published by Association for Research in Vision and Ophthalmology (ARVO) in Journal of Vision
- Vol. 22 (10) , 9
Open AccessMaximum likelihood estimation of difference scaling functions for suprathreshold judgments
Maximum likelihood estimation (MLE) has been used to produce perceptual scales from binary judgments of triads and quadruples. This method relies on Thurstone’s theory of a stochastic perceptual process where the perceived difference of two stimuli is the difference in their perceived strengths. It is possible that the perception of a suprathreshold difference is overestimated when adding smaller differences, a phenomenon referred to as diminishing returns. The current approach to construct a perceptual scale using MLE does not account for this phenomenon. We present a way to model the perception of differences using MLE and Thurstone’s theory, adapted to allow the possibility of diminishing returns. This method is validated using Monte Carlo simulated responses to experimental triads and can correctly model diminishing returns, the absence of diminishing returns, and the opposite of diminishing returns both in the cases when a perceptual scale is known and when the true perceived strengths of the stimuli are unknown. Additionally, this method was applied to empirical data sets to determine its feasibility in investigations of perception. Ultimately, it was found that this analysis allows for more accurate modeling of suprathreshold difference judgments, a more complete understanding of the perceptual processes underlying comparisons, and the evaluation of Thurstone’s theory of difference judgments.
- Open Access
- 28 July 2022
- Published by Office of Scientific and Technical Information (OSTI)
Graph Neural Network (GNN) - assisted Sampling for Cosmological Simulations [Slides]
The U.S. Department of Energy's Office of Scientific and Technical Information
- 28 July 2022
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessGraph Neural Network (GNN) - assisted Sampling for Cosmological Simulations [Slides]
The U.S. Department of Energy's Office of Scientific and Technical Information