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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Multimodal parameter spaces of a complex multi-channel neuron model

One of the most common types of models that helps us to understand neuron behavior is based on the Hodgkin–Huxley ion channel formulation (HH model). A major challenge with inferring parameters in HH models is non-uniqueness: many different sets of ion channel parameter values produce similar outputs for the same input stimulus. Such phenomena result in an objective function that exhibits multiple modes (i.e., multiple local minima). This non-uniqueness of local optimality poses challenges for parameter estimation with many algorithmic optimization techniques. HH models additionally have severe non-linearities resulting in further challenges for inferring parameters in an algorithmic fashion. To address these challenges with a tractable method in high-dimensional parameter spaces, we propose using a particular Markov chain Monte Carlo (MCMC) algorithm, which has the advantage of inferring parameters in a Bayesian framework. The Bayesian approach is designed to be suitable for multimodal solutions to inverse problems. We introduce and demonstrate the method using a three-channel HH model. We then focus on the inference of nine parameters in an eight-channel HH model, which we analyze in detail. We explore how the MCMC algorithm can uncover complex relationships between inferred parameters using five injected current levels. The MCMC method provides as a result a nine-dimensional posterior distribution, which we analyze visually with solution maps or landscapes of the possible parameter sets. The visualized solution maps show new complex structures of the multimodal posteriors, and they allow for selection of locally and globally optimal value sets, and they visually expose parameter sensitivities and regions of higher model robustness. We envision these solution maps as enabling experimentalists to improve the design of future experiments, increase scientific productivity and improve on model structure and ideation when the MCMC algorithm is applied to experimental data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Visual-Attention-Based Background Modeling for Detecting Infrequently Moving Objects

Motion is one of the most important cues to separate foreground objects from the background in a video. Using a stationary camera, it is usually assumed that the background is static, while the foreground objects are moving most of the time. However, in practice, the foreground objects may show infrequent motions, such as abandoned objects and sleeping persons. Meanwhile, the background may contain frequent local motions, such as waving trees and/or grass. Such complexities may prevent the existing background subtraction algorithms from correctly identifying the foreground objects. We propose a new approach that can detect the foreground objects with frequent and/or infrequent motions. Specifically, we use a visual-attention mechanism to infer a complete background from a subset of frames and then propagate it to the other frames for accurate background subtraction. Furthermore, we develop a feature-matching-based local motion stabilization algorithm to identify frequent local motions in the background for reducing false positives in the detected foreground. The proposed approach is fully unsupervised, without using any supervised learning for object detection and tracking. Extensive experiments on a large number of videos have demonstrated that the proposed approach outperforms the state-of-the-art motion detection and background subtraction methods in comparison.

42 ENGINEERING↗
DOE OSTI2019

Mode Meter for Mitigating Forced Oscillations on the Grid

Increased renewable energy sources connected to the power grid leads to forced power oscillations that result in costly outages and an unstable grid. Forecasting and predicting fluctuations is difficult for grid operators. PNNL, Montana Tech and the University of Wyoming developed Mode Meter, a power tool that detects and reports grid instabilities. Using three advanced algorithms, Mode Meter detects, analyzes, and helps localize power swings that are growing unstable. Mode Meter uses precise, time-synchronized data collected from thousands of advanced sensors placed on powerlines and other transmission devices. Information is reported in an easy-to-read visual tool. The patented innovation is available for commercialization. Contact Commercialization Manager Peter Christensen at peter.christensen@pnnl.gov

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

A computer vision algorithm for interpreting lacustrine carbonate textures at Searles Valley, USA

Investigations of the paleohydrologies of pluvial lake systems have often employed lake carbonate deposits called “tufa” that grow subaqueously and can be preserved long after the drying of the lake. For this reason, tufa have been used as a proxy for minimum lake level. However, they exhibit a variety of textures that hold the potential to reveal richer paleoclimatological information. With the goal of determining if tufa texture can be used as a proxy for lake environment, this study investigates the textures of tufa at Mono Lake, California in comparison to the fossil tufa in Searles Valley, California. While observations in the last century suggest that the tufa in the Mono basin grew in waters similar to the modern, the tufa at Searles formed during the last glacial period, when the Great Basin contained a system of pluvial lakes on the scale of the modern Great Lakes. The tufa at both basins have been observed to have a range of classifiable textures, and new methods of inspecting visual data could be informative about what factors control these textures. To this end, a t-Distributed Stochastic Neighbor Embedding (t-SNE) algorithm is used to project images of the tufa at Searles and Mono into a coordinate space, allowing for simple, quantitative comparisons of the visual similarity of textures. In this work, the textures of tufa at Searles are compared to each other, as well as to the tufa at Mono. This study performs a robust assessment of the feasibility of Mono Lake as a modern analogue for Searles Valley. It finds that there is a justifiable basis for the comparison of certain fossil facies at Searles to the tufa at Mono, significant progress towards the goal of using texture as a metric for the environment in which tufa formed.

58 GEOSCIENCES↗
DOE OSTI2018

Innovative Technologies for Optical Detection of Stress Corrosion Cracks

Stress corrosion cracks (SCC) represent a major concern for the structural integrity of engineered metal structures. In hazardous or restricted-access environments, remote detection of corrosion or SCC frequently relies on visual methods; however, with standard VT-1 visual inspection techniques, probabilities of SCC detection are low. Here, we develop and evaluate an improved optical sensor for SCC in restricted access-environments by combining a robotically controlled camera/fiber-optic based probe with software-based super-resolution imaging (SRI) techniques to increase image quality and detection of SCC. SRI techniques combine multiple images taken at different viewing angles, locations, or rotations, to produce a single higher- resolution composite image. We have created and tested an imaging system and algorithms for combining optimized, controlled camera movements and super- resolution imaging, improving SCC detection probabilities, and potentially revolutionizing techniques for remote visual inspections of any type.

36 MATERIALS SCIENCE↗
DOE OSTI2023

ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs

Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. Here, this paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph G of an input scalar field f defined on a cell complex K, and subsequently compute the unaugmented merge tree of f on G instead of K; which are equivalent. Any merge tree algorithm can be carried out significantly faster on G, since K in general contains substantially more cells than G. To further speed up computation, ExTreeM includes a tailored procedure to derive merge trees of extremum graphs. The computation of the fully augmented merge tree, i.e., a merge tree domain segmentation of K, can then be performed in an optional post-processing step. All steps of ExTreeM consist of procedures with high parallel efficiency, and we provide a formal proof of its correctness. Our experiments, performed on publicly available datasets, report a speedup of up to one order of magnitude over the state-of-the-art algorithms included in the TTK and VTK-m software libraries, while also requiring significantly less memory and exhibiting excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Convective Parameters Derived from Radiosonde Data (SONDEPARAM) Value-Added Product Report

Radiosondes provide fundamental observations of the vertical profile of atmospheric state (pressure, temperature, humidity, and winds), with important implications for subsequent studies on environmental controls on cloud conditions. Within convective cloud environments, there is an increasing demand for additional value-added products (VAPs) to facilitate the use of U.S. Department of Energy Atmospheric Radiation Measurement (ARM) user facility radiosonde data sets. Such VAPs should provide quick and reliable estimates for several standard radiosonde parameters or quantities of interest using common assumptions, as well as open, flexible code for visualization and user interaction. The Convective Parameters Derived from Radiosonde Data (SONDEPARAM) VAP will apply several robust algorithms used in Wang et al. (2020) for the calculation of useful radiosonde convective cloud parameters, including the convective available potential energy (CAPE), convective inhibition (CIN), and other convective parameters, for several different assumptions regarding the initial parcel characteristics (i.e., surface-based, most unstable, mixed layer). These ARM VAP codes are developed in open, flexible Python formats, with the intention that these parameters/calculations will be incorporated into traditional ARM quick-look radiosonde plotting, yet associated with user-available codes for ease in user reproduction and assumption modification.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

Incremental k-core decomposition: Algorithms and evaluation

A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-hard problems on real networks efficiently, like maximal clique finding. In many real-world applications, networks change over time. As a result, it is essential to develop efficient incremental algorithms for dynamic graph data. In this paper, we propose a suite of incremental k-core decomposition algorithms for dynamic graph data. These algorithms locate a small subgraph that is guaranteed to contain the list of vertices whose maximum k-core values have changed and efficiently process this subgraph to update the k-core decomposition. We present incremental algorithms for both insertion and deletion operations, and propose auxiliary vertex state maintenance techniques that can further accelerate these operations. Our results show a significant reduction in runtime compared to non-incremental alternatives. We illustrate the efficiency of our algorithms on different types of real and synthetic graphs, at varying scales. Furthermore, for a graph of 16 million vertices, we observe relative throughputs reaching a million times, relative to the non-incremental algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Assessing Cognitive Impacts of Errors from Machine Learning and Deep Learning Models: Final Report

Due to their recent increases in performance, machine learning and deep learning models are being increasingly adopted across many domains for visual processing tasks. One such domain is international nuclear safeguards, which seeks to verify the peaceful use of commercial nuclear energy across the globe. Despite recent impressive performance results from machine learning and deep learning algorithms, there is always at least some small level of error. Given the significant consequences of international nuclear safeguards conclusions, we sought to characterize how incorrect responses from a machine or deep learning-assisted visual search task would cognitively impact users. We found that not only do some types of model errors have larger negative impacts on human performance than other errors, the scale of those impacts change depending on the accuracy of the model with which they are presented and they persist in scenarios of evenly distributed errors and single-error presentations. Further, we found that experiments conducted using a common visual search dataset from the psychology community has similar implications to a safeguards- relevant dataset of images containing hyperboloid cooling towers when the cooling tower images are presented to expert participants. While novice performance was considerably different (and worse) on the cooling tower task, we saw increased novice reliance on the most challenging cooling tower images compared to experts. These findings are relevant not just to the cognitive science community, but also for developers of machine and deep learning that will be implemented in multiple domains. For safeguards, this research provides key insights into how machine and deep learning projects should be implemented considering their special requirements that information not be missed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Electron tomography imaging methods with diffraction contrast for materials research

Transmission electron microscopy (TEM) and scanning transmission electron microscopy (STEM) enable the visualization of three-dimensional (3D) microstructures ranging from atomic to micrometer scales using 3D reconstruction techniques based on computed tomography algorithms. This 3D microscopy method is called electron tomography (ET) and has been utilized in the fields of materials science and engineering for more than two decades. Although atomic resolution is one of the current topics in ET research, the development and deployment of intermediate-resolution (non-atomic-resolution) ET imaging methods have garnered considerable attention from researchers. This research trend is probably not irrelevant due to the fact that the spatial resolution and functionality of 3D imaging methods of scanning electron microscopy (SEM) and X-ray microscopy have come to overlap with those of ET. In other words, there may be multiple ways to carry out 3D visualization using different microscopy methods for nanometer-scale objects in materials. From the above standpoint, this review paper aims to (i) describe the current status and issues of intermediate-resolution ET with regard to enhancing the effectiveness of TEM/STEM imaging and (ii) discuss promising applications of state-of-the-art intermediate-resolution ET for materials research with a particular focus on diffraction contrast ET for crystalline microstructures (superlattice domains and dislocations) including a demonstration of in situ dislocation tomography.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Sparse Symmetric Format for Tucker Decomposition

Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM c ) in general sparse tensors, the $\underline{S}$ parse $\underline{S}$ ymmetric $\underline{T}$ ensor $\underline{T}$ imes $\underline{S}$ ame $\underline{M}$ atrix $\underline{c}$ hain (S 3 TTM c ) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S 3 TTM c operation. We theoretically establish that S 3 TTM c on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to 2.72× speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.

42 ENGINEERING↗
DOE OSTI2021

Probing polarization dynamics at specific domain configurations: Computer-vision based automated experiment in piezoresponse force microscopy

Topological defects in ferroelectric materials have attracted much attention due to the emergence of conductive, ferroic, and magnetic functionalities. However, many topological configurations dynamically evolve during the switching processes, making them a challenge to characterize via traditional techniques. Here, we implement an automated experimentation approach for the exploration of functional properties in BiFeO 3 thin films. Specifically, we visualize the ferroelectric domain structures via single frequency piezoresponse force microscopy and implement a computer vision-based algorithm to discover features of interest at which spectroscopic measurements are taken. Subsequently, we employ dimensionality reduction techniques to reveal characteristic polarization behaviors at these features. This approach can be extended to other spectroscopies and modalities to probe only specific features of interest, ultimately enabling dynamical processes in ferroelectrics to be studied.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Real-World Cyber Security Demonstration for Networked Electric Drives

In this article, we present the design and implementation of a cyber-physical security testbed for networked electric drive systems, aimed at conducting real-world security demonstrations. To our knowledge, this is one of the first security testbeds for networked electric drives, seamlessly integrating the domains of power electronics and computer science, and cybersecurity. By doing so, the testbed offers a comprehensive platform to explore and understand the intricate and often complex interactions between cyber and physical systems. The core of our testbed consists of four electric machine drives, meticulously configured to emulate small-scale but realistic information technology (IT) and operational technology (OT) networks. This setup both provides a controlled environment for simulating a wide array of cyber-attacks, and mirrors potential real-world attack scenarios with a high degree of fidelity. The testbed serves as an invaluable resource for the study of cyber-physical security, offering a practical and dynamic platform for testing and validating cybersecurity measures in the context of networked electric drive systems. As a concrete example of the testbed's capabilities, we have developed and implemented a Python-based script designed to execute step-stone attacks over a wireless local area network (WLAN). This script leverages a sequence of target IP addresses, simulating a real-world attack vector that could be exploited by adversaries. To counteract such threats, we demonstrate the efficacy of our developed cyber-attack detection algorithms, which are integral to our testbed's security framework. Furthermore, the testbed incorporates a real-time visualization system using InfluxDB and Grafana, providing a dynamic and interactive representation of networked electric drives and their associated security monitoring mechanisms. This visualization component not only enhances the testbed's usability but also offers insightful, real-time data for researchers and practitioners, thereby facilitating a deeper understanding of cyber-physical security dynamics in networked electric drive systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Model-Based Iterative Reconstruction of Magnetization Using Vector Field Electron Tomography

Vector field electron tomography (VFET) is extensively used for three-dimensional (3-D) imaging of magnetic materials at nanometer resolutions. The conventional approach is to reconstruct and visualize the magnetic vector potential or the magnetic field associated with the sample. There is a lack of algorithms capable of reconstructing the 3-D distribution of magnetization from VFET data. Unlike magnetic vector potential and magnetic field, magnetization is a fundamental physical property of the sample that does not extend beyond the dimensions of the sample. We present a model-based iterative reconstruction algorithm (MBIR) that reconstructs the magnetization by minimizing a cost function consisting of a forward model term and a prior model term. The forward model uses the physics of imaging to model the VFET data as a function of the magnetization, and the prior model enforces sparsity in the magnetization reconstruction. We then formulate an optimization algorithm based on the theory of alternate direction method of multipliers to minimize the resulting MBIR cost function. In conclusion, using simulated and real data, we show that our algorithm accurately reconstructs both the magnetization and the magnetic vector potential.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The Impact of Specificity on Human Interpretations of State Uncertainty

The goal of this project was test how different representations of state uncertainty impact human decision making. Across a series of experiments, we sought to answer fundamental questions about human cognitive biases and how they are impacted by visual and numerical information. The results of these experiments identify problems and pitfalls to avoid when for presenting algorithmic outputs that include state uncertainty to human decision makers. Our findings also point to important areas for future research that will enable system designers to minimize biases in human interpretation for the outputs of artificial intelligence, machine learning, and other advanced analytic systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Geometric Measure Theory Approach to Identify Complex Structural Features on Soft Matter Surfaces

The structural features that protrude above or below a soft matter interface are well-known to be related to interfacially mediated chemical reactivity and transport processes. It is a challenge to develop a robust algorithm for identifying these organized surface structures, as the morphology can be highly varied and they may exist on top of an interface containing significant interfacial roughness. A new algorithm that employs concepts from geometric measure theory, algebraic topology, and optimization is developed to identify candidate structures at a soft matter surface, and then, using a probabilistic approach, to rank their likelihood of being a complex structural feature. The algorithm is tested for a surfactant laden water/oil interface, where it is robust to identifying protrusions responsible for water transport against a set identified by visual inspection. To our knowledge, this is the first example of applying geometric measure theory to analyze the properties of a chemical/materials science system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Information-Theoretic Exploration of Multivariate Time-Varying Image Databases

Modern scientific simulations produce very large datasets, making interactive exploration of such data computationally prohibitive. An increasingly common data reduction technique is to store visualizations and other data extracts in a database. The Cinema project is one such approach, storing visualizations in an image database for post hoc exploration and interactive image-based analysis. This work focuses on developing efficient algorithms that can quantify various types of multivariate dependencies existing within multi-variable datasets. It applies specific mutual information measures for the quantification of salient regions from multivariate image data. Here, using such information measures, the opacity of the images is modulated so that the salient regions are automatically highlighted and the domain scientists can interactively explore the most relevant regions for scientific discovery.

97 MATHEMATICS AND COMPUTING↗