Search NASA⌕ Search

SEARCH · Search NASA

Results for “visualization algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

SNL ATDM Visualization (ECP ST Capability Assessment Report)

The SNL ATDM Data and Visualization work consolidates existing ATDM activities in scalable data management and visualization. Part of the responsibilities of the SNL ATDM Data and Visualization Project is the maintenance and development of visualization resources for ATDM applications on Exascale platforms. The ATDM Scalable Visualization project provides visualization and analysis required to satisfy the needs of the ASC/ATDM applications on next-generation, many-core platforms. This involves many activities including the re-engineering of visualization algorithms, services, and tools that enable ASC customers to carry out data analysis on ASC systems and ACES platforms. Current tools include scalable data analysis software released open source through ParaView, VTK, and Catalyst. We are also both leveraging and contributing to VTK-m, a many-core visualization library, to satisfy our visualization needs on advanced architectures. The scope of the Scalable Visualization under ATDM at SNL is R&D for the programming model and implementation of visualization code for ASC/ATDM projects and ASC/ATDM application support.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

PSpecteR: A User-Friendly and Interactive Application for Visualizing Top-Down and Bottom-Up Proteomics Data in R

Visual examination of mass spectrometry data is necessary to assess data quality and to facilitate data exploration. Graphics provide the means to evaluate spectral properties, test alternative peptide/protein sequence matches, prepare annotated spectra for publication, and fine-tune parameters during wet lab procedures. Visual inspection of MS data is hindered by proprietary proteomics visualization software designed for particular workflows and academic software that lack visualization tools. We built PSpecteR, an open-source and interactive R Shiny web application to address these issues, with support for several steps of proteomics data processing, including: reading various mass spectrometry files, running open-source database search tools, labelling spectra with fragmentation patterns, testing post-translational modifications, plotting where identified fragments map to reference sequences, and visualizing algorithmic output and metadata. All figures, tables, and spectra are exportable within one easy-to-use graphical user interface. Our current software provides a flexible and modern R framework to support fast implementation of additional features. The open source code is readily available (https://github.com/EMSL-Computing/PSpecteR), and a PSpecteR Docker container (https://hub.docker.com/r/emslcomputing) is available for easy local installation.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2024

An Entropy-Based Test and Development Framework for Uncertainty Modeling in Level-Set Visualizations

We present a simple comparative framework for testing and developing uncertainty modeling in uncertain marching cubes implementations. The selection of a model to represent the probability distribution of uncertain values directly influences the memory use, run time, and accuracy of an uncertainty visualization algorithm. We use an entropy calculation directly on ensemble data to establish an expected result and then compare the entropy from various probability models, including uniform, Gaussian, histogram, and quantile models. Our results verify that models matching the distribution of the ensemble indeed match the entropy. We further show that fewer bins in nonparametric histogram models are more effective whereas large numbers of bins in quantile models approach data accuracy.

Sisneros, Robert↗
DOE OSTI2019

A Lifeline-Based Approach for Work Requesting and Parallel Particle Advection

Particle advection, a fundamental building block for many flow visualization algorithms, is very difficult to parallelize efficiently. That said, work requesting is a promising technique to improve parallel performance for particle advection. With this work, we introduce a new work requesting-based method which uses the Lifeline scheduling method. To evaluate the impact of this new algorithm, we ran 92 experiments, running at concurrencies as high as 8192 cores, data sets as large as 17 billion cells, and as many as 16 million particles, comparing against other work requesting scheduling methods. Overall, our results show that Lifeline has significantly less idle time than other approaches, since it reduces the number of failed attempts to request work.

Pugmire, Dave↗
DOE OSTI2016

Framework and algorithms for illustrative visualizations of time-varying flows on unstructured meshes

Photo- and physically realistic techniques are often insufficient for visualization of fluid flow simulations, especially for 3D and time-varying studies. Substantial research effort has been dedicated to the development of non-photorealistic and illustration-inspired visualization techniques for compact and intuitive presentation of such complex datasets. However, a great deal of work has been reproduced in this field, as many research groups have developed specialized visualization software. Additionally, interoperability between illustrative visualization software is limited due to diverse processing and rendering architectures employed in different studies. In this investigation, a framework for illustrative visualization is proposed, and implemented in MarmotViz, a ParaView plug-in, enabling its use on a variety of computing platforms with various data file formats and mesh geometries. Region-of-interest identification and feature-tracking algorithms incorporated into this tool are described. Implementations of multiple illustrative effect algorithms are also presented to demonstrate the use and flexibility of this framework. Here, by providing an integrated framework for illustrative visualization of CFD data, MarmotViz can serve as a valuable asset for the interpretation of simulations of ever-growing scale.

42 ENGINEERING↗
DOE OSTI2026

Memory-Aware External Facelist Calculation: A Data-Parallel Atomic Hash Counting Approach

Unstructured volumetric meshes serve as fundamental data representations in various scientific simulations and analyses. They play a crucial role in representing complex computational domains and are essential for important numerical techniques, such as finite element analysis. Whenever such a mesh is read from a file, streamed in-situ, or generated by algorithms, scientific visualization libraries rely on calculating the external surface of a geometry, named “external facelist”, to produce a polygonal mesh for rendering. Consequently, external facelist calculation has become one of the most widely used algorithms in the scientific visualization domain, necessitating optimal performance. In this paper, we explore relevant work on external facelist calculation algorithms in two common visualization libraries, VTK and Viskores, assess their performance and memory constraints, and introduce a novel memory-aware external facelist calculation algorithm employing an atomic hash counting approach. This algorithm fully leverages Viskores' data-parallel primitive operations, facilitating its execution across diverse many-core architectures. Our algorithm features the lowest memory footprint on the GPU and the second-lowest on the CPU among all evaluated methods, and it also delivers the fastest performance on both CPU and GPU. It has been made available under an open-source license in the VTK and Viskores visualization systems.

Tsalikis, Spiros [Kitware] (ORCID:0000000151137195↗
DOE OSTI2025

Solving the Bernstein-Vazirani problem using Majorana-based topological quantum algorithms

Executing quantum algorithms using Majorana zero modes—a major milestone for the field of topological quantum computing—requires a platform that can be scaled to large quantum registers, can be controlled in real time and space, and a braiding protocol that uses the unique properties of these exotic particles. Here, we demonstrate the first successful simulation of a Majorana-based, fault-tolerant quantum algorithm to solve the Bernstein-Vazirani problem in two-dimensional magnet-superconductor hybrid structures from initialization to read-out of the final many-body state. Utilizing the Majorana zero modes’ topological properties, we introduce an optimized braiding protocol for the algorithm and a scalable architecture for its implementation with an arbitrary number of qubits. We visualize the algorithm protocol in real time and space by computing the non-equilibrium density of states, which is proportional to the time-dependent differential conductance, and the non-equilibrium charge density, which assigns a unique signature to each final state of the algorithm.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Preprocessing Prediction of Advanced Algorithms for Medical Imaging

Advanced medical imaging algorithms (such as bone removal, vessel segmentation, or a lung nodule detection) can provide extremely valuable information to the radiologists, but they might sometimes be very time consuming. Being able to run the algorithms in advance can be a possible solution. However, we do not know which algorithm to run on a given dataset before it is actually used. It is possible to manually insert matching rules for preprocessing algorithms, but it requires high maintenance and does not work well in practice. This paper presents a dynamic machine learning solution for predicting which advanced visualization (AV) algorithm needs to be applied on a given series. The system gets a handful of free text DICOM tags as an input and builds a model in the clinical setting. It incorporates a Bag of Words (BOW) feature extractor and a Random Forest classifier. The approach was tested on two datasets from clinical sites which use different languages and varying scanner models. We show that even without feature extraction, sensitivity of above 90% can be reached on both of them. By using BOW feature extractor, precision and sensitivity can usually be further improved. Even on a noisy and highly unbalanced dataset, only around 100 samples were needed to reach sensitivity of above 80% and specificity of above 97%. We show how the solution can be part of a Smart Preprocessing mechanism in a viewing software. Using such a system will ultimately minimize the time to launch studies and improve radiologists reading time efficiency.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

Surface Triangulation for CSG in Mercury

Visualization routines for rendering complicated geometries are very useful for engineers and scientists who are trying to build 3D prototypes of their designs. A common way to rapidly add interesting features to a 3D model is through the use of a concept called Constructive Solid Geometry. CSG uses compositions of the boolean set operations to manipulate basic geometric primitives to form more complicated objects. The most common boolean operations employed are union, intersection, and subtraction. Most computer-aided design software packages contain some sort of ability visualize CSG. The typical workflow for the user is as follows: The user specifies the individual primitive components, the user arbitrarily combines each of these primitives with boolean operations, the software generates a CSG tree structure which normally stores these solids implicitly with their defining equation, the tree is traversed and a general algorithm is applied to render the appropriate geometry onto the screen. Algorithms for visualizing CSG have been extensively developed for over a decade. Points sampled from the implicit solids are typically used as input by variations of algorithms like marching cubes and point-cloud surface reconstruction. Here, we explain a surface triangulation method from the graphics community that is being used for surface visualization in the framework of a Monte-Carlo neutron transport code called Mercury.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

minilosurface

The miniIsosurface package provides a collection of reference implementations for finding a representation for a contour of a scalar field in a volume. Contouring is a well-studied algorithm in scientific visualization and there are many algorithm variations to solve it. The miniIsosurface package provides a convenient collection of the most popular variations of the contour algorithm and some variations to run in different parallel environments.

Borgeois, Daniel↗
DOE OSTI2016

DragonView: Toward Understanding Network Interference in Dragonfly-based Supercomputers

Acquiring and maintaining high performance computing systems represents a substantial, long term investment. Therefore, it is paramount to optimize their utilization in order to maximize the return on investment and the impact on science and engineering. In this context, network congestion and inter-job interference are a major challenge as they can lead to significant systemwide performance degregation. This is especially pertinent in shared interconnects such as the dragonfly network, in which resources are shared by multiple jobs. Since many large-scale applications are communication-bound, a few communication heavy applications can have a large impact on the performance of all jobs and decrease the overall system throughput. In this paper, we describe a web-based visual analytics environment to study congestion and inter-job interference on dragonfly networks. The system enables network architects, system administrators and application developers to explore the potential impact of machine configuration, job placement policies and routing algorithms by visualizing and comparing ensembles of simulated workloads and real world data. We focus on the design of the system and describe the challenges, design decisions and the final implementation. Finally, we present two detailed case studies of prototypical analysis sessions by our stakeholders aimed at exploring the implications of different workloads and machine configurations using ensembles of network simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

DEVELOPMENT AND TESTING OF FAULT-DIAGNOSIS ALGORITHMS FOR REACTOR PLANT SYSTEMS

Argonne National Laboratory is further developing fault diagnosis algorithms for use by the operator of a nuclear plant to aid in improved monitoring of overall plant condition and performance. The objective is better management of plant upsets through more timely, informed decisions on control actions with the ultimate goal of improved plant safety, production, and cost management. Integration of these algorithms with visual aids for operators is taking place through a collaboration under the concept of an operator advisory system. This is a software entity whose purpose is to manage and distill the enormous amount of information an operator must process to understand the plant state, particularly in off-normal situations, and how the state trajectory will unfold in time. The fault diagnosis algorithms were exhaustively tested using computer simulations of twenty different faults introduced into the chemical and volume control system (CVCS) of a pressurized water reactor (PWR). The algorithms are unique in that each new application to a facility requires providing only the piping and instrumentation diagram (PID) and no other plant-specific information; a subject-matter expert is not needed to install and maintain each instance of an application. The testing approach followed accepted procedures for verifying and validating software. It was shown that the code satisfies its functional requirement which is to accept sensor information, identify process variable trends based on this sensor information, and then to return an accurate diagnosis based on chains of rules related to these trends. The validation and verification exercise made use of GPASS, a one-dimensional systems code, for simulating CVCS operation. Plant components were failed and the code generated the resulting plant response. Parametric studies with respect to the severity of the fault, the richness of the plant sensor set, and the accuracy of sensors were performed as part of the validation exercise. The background and overview of the software will be presented to give an overview of the approach. Following, the verification and validation effort using the GPASS code for simulation of plant transients including a sensitivity study on important parameters will be presented

Fault Diagnosis Algorithm↗
DOE OSTI2016

VTK-m: Accelerating the Visualization Toolkit for Massively Threaded Architectures

Execution on massively threaded processors is one of the most critical challenges for high-performance computing (HPC) scientific visualization. Of the many fundamental changes we are seeing in HPC systems, one of the most profound is a reliance on new processor types optimized for execution bandwidth over latency hiding. Moreover, our current production scientific visualization software is not designed for these new types of architectures. In order to address this issue, the VTK-m framework serves as a container for algorithms, provides flexible data representation, and simplifies the design of visualization algorithms on new and future computer architecture.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

First look at neutron emission shape characteristics of ignition hotspots at the National Ignition Facility (invited)

The nuclear imaging system has been capturing neutron images of inertial confinement fusion (ICF) driven implosions for over a decade at the National Ignition Facility. This imaging system has evolved from one to three nearly orthogonal lines-of-sight, allowing for the study of three-dimensional shape characteristics of ignition shots. Limited-view tomography algorithms help visualize the burning hotspot in 3D and assess neutron source geometry using Legendre mode parameters. With its neutron, gamma-ray, and x-ray image reconstruction capabilities, NIS has provided critical insight into mechanisms that have limited implosion performance, such as fill tube diameter for ignition-type targets. This comprehensive diagnostic suite opens a window into the shape characteristics of ignition shots and how symmetry affects ICF implosion performance. In more recent ignition shots, neutron yields have visibly increased. Analyzing the shape and size of the reconstructed neutron source has shown an expansion of the burn volume, which is indicative of more efficient alpha heating during the implosion process.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Real-Time Simultaneous 3D Volumetric Imaging and Mapping of Gamma-ray and Neutron Sources

The invention combines radiation detection instrumentation, data processing algorithms, and visualization software to enable, for the first time ever, simultaneous, real-time imaging of both gamma ray and neutron sources (fast and slow). Radiation detectors sensitive to gamma rays and neutrons are integrated with readout electronics that allow discriminated particles to be incorporated into real-time 3D volumetric reconstructions as two separate data streams. Using the Scene Data Fusion (SDF) conceptual framework and contextual sensors from the Localization and Mapping Platform (LAMP) developed at LBNL, gamma-ray and neutron data are fused onto contextual information from the environment around the detection system. The invention is compatible with radiation detection media capable of detecting and discriminating between gamma rays and neutrons or the pairing of multiple detectors separately capable of detecting gamma rays and/or neutrons. It can be integrated into a compact, lightweight imaging platform for operation as a hand-carry device, on unmanned aerial systems, and with unmanned vehicles. The ability to measure neutron enables the detection and 3D localization of shielded nuclear materials such as Pu-239 which is not possible with means of gamma-ray detection and spectroscopy overcoming of major limitation in the detection of such materials to-date.

Cates, Joshua↗
DOE OSTI2026

WM26 Paper Multi-Robot Collaboration for Hazardous Environments

Hazardous nuclear and industrial facilities are rarely designed for robots. Work in these domains demand precise manipulation and robust mobility in cluttered, constrained spaces where off-the-shelf platforms struggle and “one-size-fits-all” machines become costly and complex. Idaho National Laboratory (INL) is developing an autonomous, multi-robot inspection system that coordinates task-specific platforms rather than relying on a single omni-tool robot. An electric truck serves as a power and compute hub for a custom manipulator co-developed with Florida International University (FIU), a commercial mini crawler, a pan–tilt–zoom camera, and a Nexxis Argus LiDAR mapping system. Working in concert, these robots generate spatial, radiation, and temperature maps of the pit environments at the Hanford Waste Tank Farms. These systems will capture visual records and environmental telemetry to allow for analysis post inspection. The system architecture uses Robot Operating System 2 (ROS 2) for publish/subscribe integration, NVIDIA Isaac Sim and Unity for simulation and visualization, and algorithms such as NVBlox to fuse data into unified 3D overlays. This robot-agnostic approach reduces operator burden by enabling autonomy across heterogeneous platforms and lets each robot be used where it is strongest. Having autonomous functions means operators don’t have to fully control multiple different components. The ease of use could allow for more widespread adoption of advanced robotics at waste management sites that see continued use. By coordinating simpler, purpose-built mechanisms, the approach lowers design and manufacturing complexity, reduces capital risk in contaminated settings, and improves controllability for complex inspection and manipulation tasks. We present the architecture, early results, and lessons learned from building and deploying this coordinated multi-robot system, with the goal of accelerating safe, cost-effective adoption of advanced robotics at waste-management sites.

42 - ENGINEERING↗