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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

NASA Giovanni: A Tool for Visualizing, Analyzing, and Inter-Comparing Soil Moisture Data

There are many existing satellite soil moisture algorithms and their derived data products, but there is no simple way for a user to inter-compare the products or analyze them together with other related data (e.g., precipitation). An environment that facilitates such inter-comparison and analysis would be useful for validation of satellite soil moisture retrievals against in situ data and for determining the relationships between different soil moisture products. The latter relationships are particularly important for applications users, for whom the continuity of soil moisture data, from whatever source, is critical. A recent example was provided by the sudden demise of EOS Aqua AMSR-E and the end of its soil moisture data production, as well as the end of other soil moisture products that had used the AMSR-E brightness temperature data. The purpose of the current effort is to create an environment, as part of the NASA Giovanni family of portals, that facilitates inter-comparisons of soil moisture algorithms and their derived data products.

Teng, William↗
DOE OSTI2023

Quantum Computing and Visualization: A Disruptive Technological Change Ahead

The focus of this Visualization Viewpoints article is to provide some background on quantum computing (QC), to explore ideas related to how visualization helps in understanding QC, and examine how QC might be useful for visualization with the growth and maturation of both technologies in the future. In a quickly evolving technology landscape, QC is emerging as a promising pathway to overcome the growth limits in classical computing. In some cases, QC platforms offer the potential to vastly outperform the familiar classical computer by solving problems more quickly or that may be intractable on any known classical platform. As further performance gains for classical computing platforms are limited by diminishing Moore’s Law scaling, QC platforms might be viewed as a potential successor to the current field of exascale-class platforms. Importantly, while present-day QC hardware platforms are still limited in scale, the field of quantum computing is robust and rapidly advancing in terms of hardware capabilities, software environments for developing quantum algorithms, and educational programs for training the next generation of scientists and engineers. After a brief introduction to QC concepts, the focus of this article is to explore the interplay between the fields of visualization and QC. First, visualization has played a role in QC by providing the means to show representations of the quantum state of single-qubits in superposition states and multiple-qubits in entangled states. Second, there are a number of ways in which the field of visual data exploration and analysis may potentially benefit from this disruptive new technology though there are challenges going forward.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Visual Analytics of Heterogeneous Data Using Hypergraph Learning

For real-world learning tasks (e.g., classification), graph-based models are commonly used to fuse the information distributed in diverse data sources, which can be heterogeneous, redundant, and incomplete. Thesemodels represent the relations in different datasets as pairwise links. However, these links cannot deal with high-order relations which connect multiple objects (e.g., in public health datasets, more than two patient groups admitted by the same hospital in 2014). In this article, we propose a visual analytics approach forthe classification on heterogeneous datasets using the hypergraph model. The hypergraph is an extension to traditional graphs in which a hyperedge connects multiple vertices instead of just two. We model various high-order relations in heterogeneous datasets as hyperedges and fuse different datasets with a unified hypergraph structure. We use the hypergraph learning algorithm for predicting missing labels in the datasets.To allow users to inject their domain knowledge into the model-learning process, we augment the traditional learning algorithm in a number of ways. In addition, we also propose a set of visualizations which enable the user to construct the hypergraph structure and the parameters of the learning model interactively during the analysis. Here, we demonstrate the capability of our approach via two real-world cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

EnsembleGraph: Interactive Visual Analysis of Spatial-Temporal Behavior for Ensemble Simulation Data

We present a novel visualization framework—EnsembleGraph— for analyzing ensemble simulation data, in order to help scientists understand behavior similarities between ensemble members over space and time. A graph-based representation is used to visualize individual spatiotemporal regions with similar behaviors, which are extracted by hierarchical clustering algorithms. A user interface with multiple-linked views is provided, which enables users to explore, locate, and compare regions that have similar behaviors between and then users can investigate and analyze the selected regions in detail. The driving application of this paper is the studies on regional emission influences over tropospheric ozone, which is based on ensemble simulations conducted with different anthropogenic emission absences using the MOZART-4 (model of ozone and related tracers, version 4) model. We demonstrate the effectiveness of our method by visualizing the MOZART-4 ensemble simulation data and evaluating the relative regional emission influences on tropospheric ozone concentrations. Positive feedbacks from domain experts and two case studies prove efficiency of our method.

ensemble simulation↗
DOE OSTI2016

Robustness of Dynamical Cluster Analysis in a Glass-Forming Metallic Liquid using an Unsupervised Machine Learning Algorithm

We performed dynamical cluster analysis in a Cu-Zr-Al based glass-forming metallic liquid using an unsupervised machine learning algorithm. The size of the dynamical clusters is used to quantify the onset of cooperative dynamics as the underlying mechanism leading to the Arrhenius dynamic crossover in transport coefficients of the metallic liquid. This technique is useful to directly visualize dynamical clusters and quantify their sizes upon cooling. Here, we demonstrate the robustness of this algorithm by performing sensitivity analysis against two key parameters: number of mobility groups and inconsistency coefficient of the hierarchical cluster tree. The results elucidate the optimized range of values for both of these parameters that capture the underlying physical picture of increasing cooperative dynamics appropriately.

36 MATERIALS SCIENCE↗
DOE OSTI2017

The high matrix acquisition technique for imaging of atherosclerotic plaque inflammation in fluorine-18 fluorodeoxyglucose positron emission tomography/computed tomography with time-of-flight: Phantom study

Background: Motion artifact and partial volume effect caused underestimation of coronary plaque inflammation. This study evaluated the high matrix acquisition technique using time-of-flight (TOF) positron emission tomography/computed tomography for imaging of atherosclerotic plaque inflammation with fluorine-18 fluorodeoxyglucose in small and moving phantoms. Methods and Results: All images were reconstructed using a conventional algorithm without TOF (4 × 4 × 4 mm{sup 3} voxel size) and a high matrix algorithm with TOF (2 × 2 × 2 mm{sup 3} voxel size). Microsphere phantoms of 10, 7.9, 6.2, 5.0, and 4.0 mm diameters were acquired in 3-dimensional list-mode for 30 minutes. A heart phantom mimicking cardiac motion consisted of a hot spot simulating a plaque (φ 4 mm, φ 2 mm) on the outside of the left ventricle. In the microsphere and heart phantom study, visual discrimination, maximum activity, and target-to-background ratio using the high matrix algorithm with TOF were better than those using the conventional algorithm without TOF. Conclusion: The high matrix algorithm with TOF improves detection of small targets in phantoms.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2018

Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the new assigned particles for a process always locate in its block. Result shows good load balance and high efficiency of our method.

Zhang, Jiang↗
DOE OSTI2017

Data Visualization Saliency v. 1.0

Evaluating the effectiveness of data visualizations is a challenging undertaking and often relies on one-off human subject studies that test a visualization in the context of one specific task. Researchers across the fields of data science, visualization, and human-computer interaction are calling for foundational tools and principles that could be applied to assessing the effectiveness of data visualizations in a more rapid and generalizable manner. The visual saliency model for data visualizations described here addresses this need for evaluation tools. Visual saliency models assess the visual features (e.g. color, contrast, edges) of an image to predict which areas of that image will draw a viewer’s attention. Providing predictions of where viewers will look in a visualization based on the saliency of the various regions and elements in that image could help designers to assess whether or not their design will draw the viewer’s attention as intended. The Data Visualization Saliency model, a saliency model for data visualizations, consists of two parts: a text saliency map and a modified version of the Itti, Koch and Niebur model [1]. The final saliency map is a linear combination of the two. The text saliency map is created from an algorithm that computes the likelihood of belonging to a text region for each pixel of an input visualization image. The modified Itti model transforms the original input image to a representation in CIE LAB color space, which provides an accurate representation of perceptual color opponency. For a given input data visualization image, the Data Visualization Saliency model computes and returns the visualization saliency map highlighting areas of the data visualization that will draw a viewer’s attention. It also returns the lower level saliency maps for text and the modified Itti model.

Haass, Michael↗
NASA NTRS1992

The cool-star spectral catalog: A uniform collection of IUE SWP-LOs

Over the past decade and a half of its operations, the International Ultraviolet Explorer has recorded low-dispersion spectrograms in the 1150-2000 A interval of more than 800 stars of late spectral type (F-M). The sub-2000 A region contains a number of emission lines that are key diagnostics of physical conditions in the high-excitation chromospheres and subcoronal 'transition zones' of such stars. Many of the sources have been observed a number of times, and the available collection of SWP-LO exposures in the IUE Archives exceeds 4,000. With support from the Astrophysics Data Program, we have assembled the archival material into a catalog of IUE far-UV fluxes of late-type stars. In order to ensure uniform processing of the spectra, we: (1) photometrically corrected the raw vidicon images with a custom version of the 1985 SWP ITF; (2) identified and eliminated, sharp cosmic-ray 'hits' by means of a spatial filter; (3) extracted the spectral traces with the 'optimal' (weighted-slit) strategy; and (4) calibrated them against a well-characterized reference source, the DA white dwarf G191-B2B. Our approach is similar to that adopted by the IUE Project for its 'Final Archive', but our implementation is specialized to the case of chromospheric emission-line sources. We measured the resulting SWP-LO spectra using a semi-autonomous algorithm that establishes a smooth continuum by numerical filtering, and then fits the significant emissions (or absorptions) by means of a constrained Bevington-type multiple-Gaussian procedure. The algorithm assigns errors to the fitted fluxes - or upper limits in the absence of a significant detection - according to a model based on careful measurements of the noise properties of the IUE's intensified SEC cameras. Here, we describe the 'visualization' strategies we adopted to ensure human-review of the semi-autonomous processing and measuring algorithms; the derivation of the noise model and the assignment of errors; and the structure of the final catalog as delivered to the Astrophysics Data System.

Ayres, T.↗
DOE OSTI2021

Inversion of coherent surface scattering images via deep learning network

Coherent surface scattering imaging is a powerful tool for imaging a surface/interface of a thin nanostructure deposited on an opaque substrate. A mathematical conversion of an object image from a scattering pattern is essential for coherent surface scattering imaging to visualize structures of specimens. It has been achieved by using phase retrieval algorithms requiring oversampling in scattering patterns and employing alternating projection approaches. It is a computationally challenging and time-consuming process. In this paper, we demonstrate CSSI-NN, which is a deep learning neural network model to predict images of objects from scattering intensities in coherent surface scattering imaging. This model allowing for the instant outcome from scattering patterns would be tremendously beneficial not only for effective experiments but also for data analysis of phase retrieval.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Situational Awareness of Network System Roles (SANSR)

In a large enterprise it is difficult for cyber security analysts to know what services and roles every machine on the network is performing (e.g., file server, domain name server, email server). Using network flow data, already collected by most enterprises, we developed a proof-of-concept tool that discovers the roles of a system using both clustering and categorization techniques. The tool's role information would allow cyber analysts to detect consequential changes in the network, initiate incident response plans, and optimize their security posture. The results of this proof-of-concept tool proved to be quite accurate on three real data sets. We will present the algorithms used in the tool, describe the results of preliminary testing, provide visualizations of the results, and discuss areas for future work. Without this kind of situational awareness, cyber analysts cannot quickly diagnose an attack or prioritize remedial actions.

cyber security↗
DOE OSTI2016

Enhancements to the RAVEN code in FY16

The RAVEN code has been under development at the Idaho National Laboratory since 2012. Its main goal is to create a multi-purpose platform for the deploying of all the capabilities needed for Probabilistic Risk Assessment, uncertainty quantification, data mining analysis and optimization studies. RAVEN has currently reached a good level of maturity in terms of deployed state-of-art and advanced capabilities. The main subject of this report is to show the activities that have been recently accomplished: • Implementation of ensemble modeling for time-series, and • initial implementation of model validation for surrogate models, and • advanced visualization capability for topology based data analysis The development of ensemble modeling for time-series has been performed in order to begin tackling the needs of those RISMC applications that need to communicate 1-Dimensional information (e.g. power histories, etc.) among different models. In this document the implementation details and an application example is reported. The second subject of this report is about the initial development of methods, within the RAVEN framework, to assess the validity of the predictive capabilities of surrogate models. Indeed, after the construction of a surrogate tight to a certain physical model, it is crucial to assess the goodness of its representation, in order to be confident with its prediction. In this initial activity, a cross-validation technique has been employed. This report will highlight the implementation details and proof its correct implementation by an application example. The final subject of this report is about the implementation of advanced visualization capability in RAVEN, for interactive data analysis. Indeed, RAVEN offers several post-processing capabilities that can structurally decompose data extracted from experimental results offering both data clustering/partitioning and dimensionality reduction techniques. A disadvantage of the workflow available in RAVEN is that it treats these as black box operations and the user is expected to know specific information about their data including the number of partitions to expect in some cases or the “correct” parameter settings for a particular algorithm. In order to overcome this limitation, it has been added an interactive user interface that can be run in RAVEN to explore different parameter settings on the fly specifically for the topological post-processor and allows the user to explore the data interactively. The design of this user interface is generalizable to other algorithms and can be used as a model to generate more dynamic and user-friendly visualization capabilities within RAVEN.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

External Threat Risk Assessment Algorithm (ExTRAA)

Two risk assessment algorithms and philosophies have been augmented and combined to form a new algorit hm, the External Threat Risk Assessment Algorithm (ExTRAA), that allows for effective and statistically sound analysis of external threat sources in relation to individual attack methods . In addition to the attack method use probability and the attack method employment consequence, t he concept of defining threat sources is added to the risk assessment process. Sample data is tabulated and depicted in radar plots and bar graphs for algorithm demonstration purposes. The largest success of ExTRAA is its ability to visualize the kind of r isk posed in a given situation using the radar plot method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Orbits and Masses of Binaries from Speckle Interferometry at SOAR

We present results from Speckle inteferometric observations of 15 visual binaries and one double-line spectroscopic binary, carried out with the HRCam Speckle camera of the SOAR 4.1 m telescope. These systems were observed as a part of an on-going survey to characterize the binary population in the solar vicinity, out to a distance of 250 pc. We obtained orbital elements and mass sums for our sample of visual binaries. The orbits were computed using a Markov Chain Monte Carlo algorithm that delivers maximum likelihood estimates of the parameters, as well as posterior probability density functions that allow us to evaluate their uncertainty. Their periods cover a range from 5 yr to more than 500 yr; and their spectral types go from early A to mid M, implying total system masses from slightly more than 4M{sub ⊙} down to 0.2M {sub ⊙}. They are located at distances between approximately 12 and 200 pc, mostly at low Galactic latitude. For the double-line spectroscopic binary YSC8, we present the first combined astrometric/radial-velocity orbit resulting from a self-consistent fit, leading to individual component masses of 0.897 ± 0.027 M {sub ⊙} and 0.857 ± 0.026 M {sub ⊙}; and an orbital parallax of 26.61 ± 0.29 mas, which compares very well with the Gaia DR2 trigonometric parallax (26.55 ± 0.27 mas). In combination with published photometry and trigonometric parallaxes, we place our objects on an H-R diagram and discuss their evolutionary status. We also present a thorough analysis of the precision and consistency of the photometry available for them.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Target Selection and Validation of DESI Quasars

The Dark Energy Spectroscopic Instrument (DESI) survey will measure large-scale structures using quasars as direct tracers of dark matter in the redshift range 0.9 < z < 2.1 and using Lyα forests in quasar spectra at z > 2.1. We present several methods to select candidate quasars for DESI, using input photometric imaging in three optical bands (g, r, z) from the DESI Legacy Imaging Surveys and two infrared bands (W1, W2) from the Wide-field Infrared Survey Explorer. These methods were extensively tested during the Survey Validation of DESI. In this paper, we report on the results obtained with the different methods and present the selection we optimized for the DESI main survey. The final quasar target selection is based on a random forest algorithm and selects quasars in the magnitude range of 16.5 < r < 23. Visual selection of ultra-deep observations indicates that the main selection consists of 71% quasars, 16% galaxies, 6% stars, and 7% inconclusive spectra. Using the spectra based on this selection, we build an automated quasar catalog that achieves a fraction of true QSOs higher than 99% for a nominal effective exposure time of ~1000 s. With a 310 deg -2 target density, the main selection allows DESI to select more than 200 deg -2 quasars (including 60 deg -2 quasars with z > 2.1), exceeding the project requirements by 20%. The redshift distribution of the selected quasars is in excellent agreement with quasar luminosity function predictions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

A Search of the Full Six Years of the Dark Energy Survey for Outer Solar System Objects

We present a search for outer solar system objects in the 6 yr of data from the Dark Energy Survey (DES). The DES covered a contiguous 5000 deg 2 of the southern sky with ≈80,000 3 deg 2 exposures in the grizY filters between 2013 and 2019. This search yielded 812 trans-Neptunian objects (TNOs), one Centaur and one Oort cloud comet, 458 reported here for the first time. We present methodology that builds upon our previous search on the first 4 yr of data. All images were reprocessed with an optimized detection pipeline that leads to an average completeness gain of 0.47 mag per exposure, as well as improved transient catalog production and algorithms for linkage of detections into orbits. All objects were verified by visual inspection and by the “sub-threshold significance,” the signal-to-noise ratio in the stack of images in which its presence is indicated by the orbit, but no detection was reported. This yields a pure catalog complete to r ≈ 23.8 mag and distances 29 < d < 2500 au. The TNOs have minimum (median) of 7 (12) nights’ detections and arcs of 1.1 (4.2) yr, and will have grizY magnitudes available in a further publication. We present software for simulating our observational biases for comparisons of models to our detections. Initial inferences demonstrating the catalog’s statistical power are: the data are inconsistent with the CFEPS-L7 model for the classical Kuiper Belt; the 16 “extreme” TNOs (a > 150 au, q > 30 au) are consistent with the null hypothesis of azimuthal isotropy; and nonresonant TNOs with q > 38 au, a > 50 au show a significant tendency to be sunward of major mean-motion resonances.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1991

Computational aerodynamics - The next generation

Continued advances in the various elements that comprise the field of computational fluid dynamics (CFD) are promoting a radically different approach to the aerodynamic design and analysis of aerospace vehicles and systems. The elements of CFD generally include numerical algorithm development, transition and turbulence modeling, surface modeling, and grid generation, scientific visualization and validation methodologies. This paper discusses the research progress and prospects for the future in each of these elements within NASA's CFD and Experimental Validation Program. The applicability of computational methods for the purposes of understanding complex flow phenomena, exploring aerodynamic concepts, and providing vehicle-design input is also addressed.

Hessenius, Kristin A.↗
NASA NTRS1992

Graphical interface between the CIRSSE testbed and CimStation software with MCS/CTOS

This research is concerned with developing a graphical simulation of the testbed at the Center for Intelligent Robotic Systems for Space Exploration (CIRSSE) and the interface which allows for communication between the two. Such an interface is useful in telerobotic operations, and as a functional interaction tool for testbed users. Creating a simulated model of a real world system, generates inevitable calibration discrepancies between them. This thesis gives a brief overview of the work done to date in the area of workcell representation and communication, describes the development of the CIRSSE interface, and gives a direction for future work in the area of system calibration. The CimStation software used for development of this interface, is a highly versatile robotic workcell simulation package which has been programmed for this application with a scale graphical model of the testbed, and supporting interface menu code. A need for this tool has been identified for the reasons of path previewing, as a window on teleoperation and for calibration of simulated vs. real world models. The interface allows information (i.e., joint angles) generated by CimStation to be sent as motion goal positions to the testbed robots. An option of the interface has been established such that joint angle information generated by supporting testbed algorithms (i.e., TG, collision avoidance) can be piped through CimStation as a visual preview of the path.

Hron, Anna B.↗