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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS2009

Rover Slip Validation and Prediction Algorithm

A physical-based simulation has been developed for the Mars Exploration Rover (MER) mission that applies a slope-induced wheel-slippage to the rover location estimator. Using the digital elevation map from the stereo images, the computational method resolves the quasi-dynamic equations of motion that incorporate the actual wheel-terrain speed to estimate the gross velocity of the vehicle. Based on the empirical slippage measured by the Visual Odometry software of the rover, this algorithm computes two factors for the slip model by minimizing the distance of the predicted and actual vehicle location, and then uses the model to predict the next drives. This technique, which has been deployed to operate the MER rovers in the extended mission periods, can accurately predict the rover position and attitude, mitigating the risk and uncertainties in the path planning on high-slope areas.

Yen, Jeng↗
NASA NTRS1982

AgRISTARS. Supporting research: Algorithms for scene modelling

The requirements for a comprehensive analysis of LANDSAT or other visual data scenes are defined. The development of a general model of a scene and a computer algorithm for finding the particular model for a given scene is discussed. The modelling system includes a boundary analysis subsystem, which detects all the boundaries and lines in the image and builds a boundary graph; a continuous variation analysis subsystem, which finds gradual variations not well approximated by a boundary structure; and a miscellaneous features analysis, which includes texture, line parallelism, etc. The noise reduction capabilities of this method and its use in image rectification and registration are discussed.

Rassbach, M. E.↗
DOE OSTI2019

Analytics for Investigation of Disease Outbreaks: Web-Based Analytics Facilitating Situational Awareness in Unfolding Disease Outbreaks

Background: Information from historical infectious disease outbreaks provides real-world data about outbreaks and their impacts on affected populations. These data can be used to develop a picture of an unfolding outbreak in its early stages, when incoming information is sparse and isolated, to identify effective control measures and guide their implementation. Objective: This study aimed to develop a publicly accessible Web-based visual analytic called Analytics for the Investigation of Disease Outbreaks (AIDO) that uses historical disease outbreak information for decision support and situational awareness of an unfolding outbreak. Methods: We developed an algorithm to allow the matching of unfolding outbreak data to a representative library of historical outbreaks. This process provides epidemiological clues that facilitate a user’s understanding of an unfolding outbreak and facilitates informed decisions about mitigation actions. Disease-specific properties to build a complete picture of the unfolding event were identified through a data-driven approach. A method of analogs approach was used to develop a short-term forecasting feature in the analytic. The 4 major steps involved in developing this tool were (1) collection of historic outbreak data and preparation of the representative library, (2) development of AIDO algorithms, (3) development of user interface and associated visuals, and (4) verification and validation. Results: The tool currently includes representative historical outbreaks for 39 infectious diseases with over 600 diverse outbreaks. We identified 27 different properties categorized into 3 broad domains (population, location, and disease) that were used to evaluate outbreaks across all diseases for their effect on case count and duration of an outbreak. Statistical analyses revealed disease-specific properties from this set that were included in the disease-specific similarity algorithm. Although there were some similarities across diseases, we found that statistically important properties tend to vary, even between similar diseases. This may be because of our emphasis on including diverse representative outbreak presentations in our libraries. AIDO algorithm evaluations (similarity algorithm and short-term forecasting) were conducted using 4 case studies and we have shown details for the Q fever outbreak in Bilbao, Spain (2014), using data from the early stages of the outbreak. Using data from only the initial 2 weeks, AIDO identified historical outbreaks that were very similar in terms of their epidemiological picture (case count, duration, source of exposure, and urban setting). The short-term forecasting algorithm accurately predicted case count and duration for the unfolding outbreak. Conclusions: AIDO is a decision support tool that facilitates increased situational awareness during an unfolding outbreak and enables informed decisions on mitigation strategies. AIDO analytics are available to epidemiologists across the globe with access to internet, at no cost. In this study, we presented a new approach to applying historical outbreak data to provide actionable information during the early stages of an unfolding infectious disease outbreak.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Post-processing interstitialcy diffusion from molecular dynamics simulations

An algorithm to rigorously trace the interstitialcy diffusion trajectory in crystals is developed. The algorithm incorporates unsupervised learning and graph optimization which obviate the need to input extra domain specific information depending on crystal or temperature of the simulation. The algorithm is implemented in a flexible framework as a post-processor to molecular dynamics (MD) simulations. We describe in detail the reduction of interstitialcy diffusion into known computational problems of unsupervised clustering and graph optimization. We also discuss the steps, computational efficiency and key components of the algorithm. Using the algorithm, thermal interstitialcy diffusion from low to near-melting point temperatures is studied. We encapsulate the algorithms in a modular framework with functionality to calculate diffusion coefficients, migration energies and other trajectory properties. The study validates the algorithm by establishing the conformity of output parameters with experimental values and provides detailed insights for the interstitialcy diffusion mechanism. The algorithm along with the help of supporting visualizations and analysis gives convincing details and a new approach to quantifying diffusion jumps, jump-lengths, time between jumps and to identify interstitials from lattice atoms. -- Graphical abstract:.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1977

Resampling study

The author has identified the following significant results. The nearest neighbor and cubic convolution resampling algorithms were applied to a variety of images extracted from LANDSAT MSS data. A comparison of the results demonstrated that (1) cubic convolution can cause spreading of small features and can introduce noticeable overshoot (ringing) into the data; (2) cubic convolution attenuates the high spatial frequencies compared to the original and nearest neighbor resampled data; and (3) cubic convolution generally produces photographic products of superior visual quality. The effects of the resampling algorithms on multispectral classification were not conclusively determined due to the small number of images tested.

Ferneyhough, D. G.↗
NASA NTRS1992

A knowledge based system for scientific data visualization

A knowledge-based system, called visualization tool assistant (VISTA), which was developed to assist scientists in the design of scientific data visualization techniques, is described. The system derives its knowledge from several sources which provide information about data characteristics, visualization primitives, and effective visual perception. The design methodology employed by the system is based on a sequence of transformations which decomposes a data set into a set of data partitions, maps this set of partitions to visualization primitives, and combines these primitives into a composite visualization technique design. Although the primary function of the system is to generate an effective visualization technique design for a given data set by using principles of visual perception the system also allows users to interactively modify the design, and renders the resulting image using a variety of rendering algorithms. The current version of the system primarily supports visualization techniques having applicability in earth and space sciences, although it may easily be extended to include other techniques useful in other disciplines such as computational fluid dynamics, finite-element analysis and medical imaging.

Senay, Hikmet↗
DOE OSTI2024

An Accelerated Clip Algorithm for Unstructured Meshes: A Batch-Driven Approach

The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.

Tsalikis, Spiros↗
DOE OSTI2016

SeekAView: An Intelligent Dimensionality Reduction Strategy for Navigating High-Dimensional Data Spaces

Dealing with the curse of dimensionality is a key challenge in high-dimensional data visualization. We present SeekAView to address three main gaps in the existing research literature. First, automated methods like dimensionality reduction or clustering suffer from a lack of transparency in letting analysts interact with their outputs in real-time to suit their exploration strategies. The results often suffer from a lack of interpretability, especially for domain experts not trained in statistics and machine learning. Second, exploratory visualization techniques like scatter plots or parallel coordinates suffer from a lack of visual scalability: it is difficult to present a coherent overview of interesting combinations of dimensions. Third, the existing techniques do not provide a flexible workflow that allows for multiple perspectives into the analysis process by automatically detecting and suggesting potentially interesting subspaces. In SeekAView we address these issues using suggestion based visual exploration of interesting patterns for building and refining multidimensional subspaces. Compared to the state-of-the-art in subspace search and visualization methods, we achieve higher transparency in showing not only the results of the algorithms, but also interesting dimensions calibrated against different metrics. We integrate a visually scalable design space with an iterative workflow guiding the analysts by choosing the starting points and letting them slice and dice through the data to find interesting subspaces and detect correlations, clusters, and outliers. We present two usage scenarios for demonstrating how SeekAView can be applied in real-world data analysis scenarios.

Krause, Josua↗
DOE OSTI2018

Advanced Imaging of the Left Atrium with Cardiac Magnetic Resonance: A Review of Current and Emerging Methods and Clinical Applications

Purpose of Review: The thin wall of the left atrium (LA) is difficult to visualize. The high spatial and temporal resolution of cardiac magnetic resonance (CMR) allows for the most accurate assessment of left atrial structure, function, and tissue characterization. This review will describe emerging methods used to image the LA with CMR, and will discuss associated clinical applications. Recent Findings: LA function can now be described in a dynamic fashion with feature-tracking algorithms. Novel methods have been created to augment visualization of late gadolinium enhancement (LGE) in the LA, and left atrial fibrosis can be further quantified with T1 mapping algorithms. The advancement in how we image the LA with CMR has implications in atrial fibrillation (AF) and cardiomyopathic processes. Summary: A nuanced understanding of left atrial pathology is emerging with the rapid advancement of CMR technology, which has implications in the risk stratification and treatment of several cardiovascular disease states.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
NASA NTRS2005

Combined Feature Based and Shape Based Visual Tracker for Robot Navigation

We have developed a combined feature based and shape based visual tracking system designed to enable a planetary rover to visually track and servo to specific points chosen by a user with centimeter precision. The feature based tracker uses invariant feature detection and matching across a stereo pair, as well as matching pairs before and after robot movement in order to compute an incremental 6-DOF motion at each tracker update. This tracking method is subject to drift over time, which can be compensated by the shape based method. The shape based tracking method consists of 3D model registration, which recovers 6-DOF motion given sufficient shape and proper initialization. By integrating complementary algorithms, the combined tracker leverages the efficiency and robustness of feature based methods with the precision and accuracy of model registration. In this paper, we present the algorithms and their integration into a combined visual tracking system.

Deans, J.↗
DOE OSTI2015

Industrial Inspection with Open Eyes: Advance with Machine Vision Technology

Machine vision systems have evolved significantly with the technology advances to tackle the challenges from modern manufacturing industry. A wide range of industrial inspection applications for quality control are benefiting from visual information captured by different types of cameras variously configured in a machine vision system. This chapter screens the state of the art in machine vision technologies in the light of hardware, software tools, and major algorithm advances for industrial inspection. The inspection beyond visual spectrum offers a significant complementary to the visual inspection. The combination with multiple technologies makes it possible for the inspection to achieve a better performance and efficiency in varied applications. The diversity of the applications demonstrates the great potential of machine vision systems for industry.

acoustic↗
DOE OSTI2019

Visualization System for Evolutionary Neural Networks for Deep Learning

Deep learning is actively used in a wide range of fields for scientific discovery. To effectively apply deep learning to a particular problem, it is important to select an appropriate network architecture and other hyper-parameters (at each layer). Evolving architectures and hyper-parameters using a genetic algorithm is one current approach to search the huge space of all possible configurations to find those more optimal for the problem. However, examining an evolutionary process and tuning the genetic algorithm are challenging, pushing most users to treat the process as a black box. To address this challenge, we propose a visualization system for evolutionary neural networks for deep learning. The key feature of our visualization system is to provide a visual analytics environment for evaluating a genetic algorithm in order to improve the underlying operations to reduce time to find good solutions. Our system is able to not only visualize how a genetic algorithm traverses its search space but also allows users to examine evolving networks in-depth to get insights to improve performance through interactive visualization components.

Chae, Junghoon↗
DOE OSTI2017

SNF Data Visualization on the Centralized Used Fuel Resource for Information Exchange (CURIE) Website

To better inform stakeholders regarding the nature of spent nuclear fuel (SNF) at utility sites, an online data visualization system has been created for the U.S. Department of Energy's Office of Nuclear Energy (DOENE). The data visualization system is part of the Centralized Used Fuel Resource for Information Exchange (CURIE) website, hosted by the Oak Ridge National Laboratory (ORNL) for DOE-NE. The visualization employs a database that is part of an analysis tool known as the Used Nuclear Fuel Storage, Transportation and Disposal Analysis Resource and Data System (UNF-ST[and]DARDS). Because many of the previous document management and sharing tools related to SNF have been terminated (or are inaccessible), a new tool, the CURIE, was developed for DOE-NE and launched on March 1, 2013 at http://curie.ornl.gov. In addition to supporting DOE SNF programs, CURIE is a national resource that is accessible to industry, vendor, federal, and laboratory partners, as well as other stakeholders. CURIE's architecture was initially based on previous work that supported DOE's Bioenergy Technologies Office on the Bioenergy Knowledge Discovery Framework (KDF). The site uses an open-source search engine, Apache Solr, which provides intuitive search results based on a faceted search method similar to that used by Amazon.com{sup R}. This algorithm helps to ensure that finding documents and data is straightforward. SNF data visualization capability was added to the CURIE website which provides a capability to post and access documents and data related to the management of SNF. CURIE currently maintains over 4,100 documents and the Siting Experience Database (SED), which was developed in response to a near-term recommendation by the Blue Ribbon Commission on America's Nuclear Future (BRC). The SED is a database of the experience that has been gained and relevant documentation that has been produced in efforts to site nuclear waste facilities, both in the US and abroad. Most of these documents are publicly accessible. In addition, CURIE maintains a current calendar of related events, an SNF image gallery, featured documents, and external links to related databases and websites. CURIE also maintains private groups (or communities) to facilitate collaborative development through sharing and editing documents that are not publicly available. There are more than 250 registered users in 23 different communities within CURIE.ORNL has also been developing UNF-ST[and]DARDS to provide a controlled source of technical data for various waste management system analysis/evaluation tools, access to key technical data, and analysis capabilities for characterizing the SNF inventory. UNF-ST[and]DARDS also provides enhanced capabilities to assess safety, risk, and uncertainty throughout the integrated waste management system. This paper describes the UNF-ST[and]DARDS data available for visualization and the associated visualization techniques used by CURIE to display this data.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS1995

Using Visual Programming to Simulate, Test, and Display a Telemetry Stream

Advantages of using visual programming to create, modify, test and display a telemetry stream are presented. Commercial visual programming software is being used to test new algorithms as part of the ground support for the Galileo spacecraft Test Bed.

visual programming real-time data display text-bas↗
DOE OSTI2024

The VTK-m User's Guide (V. 2.2)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

3D Display of Events on a Stack of CCDs and OSCURA MCMs Copper Box Redesign

A 3D event display algorithm was successfully implemented using CERN root to visualize muons, electrons, and photons within the CCD's from the OSCURA testing setup. The copper box from this setup was also redesigned to accommodate up to 21 MCMs, enabling a multi-layer sensor tracker orientation. This setup and algorithm aims to explore and search for millicharged particles (mCPs) in accelerators, leading to improved particle tracking precision and reduced background events.

Meza Quintero, Oscar↗
DOE OSTI2021

Deep Dive Topic: Analysis

This section focuses on analysis of I/O behavior and the feedback resulting from that analysis. We define analysis of I/O behavior as interpreting and deriving meaning from I/O instrumentation data. We define feedback as the product of the analysis process. Feedback can be thought of as the link between analysis and the subsequent response to that analysis, such as I/O tuning or policy decisions (see Section 4.4).Analysis and feedback may be consumed by either human stakeholders or machine algorithms. If it is to be consumed by human stakeholders, then the analysis process will likely emphasize understandable language and visualization techniques. If it is to be consumed by machine algorithms, then it will likely emphasize the use of machine-parsable, consistent formats that are suitable for ingestion by policy engines and data-mining tools.

Snyder, Shane↗
NASA NTRS2016

IN31A-1734 Development and Evaluation of a Gridded CrIS/ATMS Visualization for Operational Forecasting

A collaborative effort between SPoRT, CIMSS, CIRA, GINA, and NOAA has produced a unique gridded visualization of real-time CrIS/ATMS sounding products. This product uses the NUCAPS retrieval algorithm and polar2grid software to generate plan-view and cross-section visualization for forecast challenges associated with cold air aloft and convective potential. Forecasters at select partner offices have been able to view the Gridded NUCAPS products in AWIPS alongside other operational data products with generally favorable feedback.

aviation↗