Search NASA⌕ Search

SEARCH · Search NASA

Results for “feature map”

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 91 records · Page 5

PARETO UI 1.1.0 Release

PARETO is an open-source Python-based software package for oilfield produced water management and beneficiary reuse optimization. PARETO supports produced water industry by providing cost-effective water management solutions. This version introduced an updated User Interface (UI) which makes it easier to navigate and understand the solution for industry users. New Features: - Map files are added for visualization - Added output export function button - Water residual view added - Workflow was streamlined - File extension was expanded - Minor bugfix

AS↗

Statistical Exploration of Electronic Structure of Molecules from Quantum Monte-Carlo Simulations

In this report, we present results from analysis of Quantum Monte Carlo (QMC) simulation data with the goal of determining internal structure of a 3N-dimensional phase space of an N-electron molecule. We are interested in mining the simulation data for patterns that might be indicative of the bond rearrangement as molecules change electronic states. We examined simulation output that tracks the positions of two coupled electrons in the singlet and triplet states of an H2 molecule. The electrons trace out a trajectory, which was analyzed with a number of statistical techniques. This project was intended to address the following scientific questions: (1) Do high-dimensional phase spaces characterizing electronic structure of molecules tend to cluster in any natural way? Do we see a change in clustering patterns as we explore different electronic states of the same molecule? (2) Since it is hard to understand the high-dimensional space of trajectories, can we project these trajectories to a lower dimensional subspace to gain a better understanding of patterns? (3) Do trajectories inherently lie in a lower-dimensional manifold? Can we recover that manifold? After extensive statistical analysis, we are now in a better position to respond to these questions. (1) We definitely see clustering patterns, and differences between the H2 and H2tri datasets. These are revealed by the pamk method in a fairly reliable manner and can potentially be used to distinguish bonded and non-bonded systems and get insight into the nature of bonding. (2) Projecting to a lower dimensional subspace ({approx}4-5) using PCA or Kernel PCA reveals interesting patterns in the distribution of scalar values, which can be related to the existing descriptors of electronic structure of molecules. Also, these results can be immediately used to develop robust tools for analysis of noisy data obtained during QMC simulations (3) All dimensionality reduction and estimation techniques that we tried seem to indicate that one needs 4 or 5 components to account for most of the variance in the data, hence this 5D dataset does not necessarily lie on a well-defined, low dimensional manifold. In terms of specific clustering techniques, K-means was generally useful in exploring the dataset. The partition around medoids (pam) technique produced the most definitive results for our data showing distinctive patterns for both a sample of the complete data and time-series. The gap statistic with tibshirani criteria did not provide any distinction across the 2 dataset. The gap statistic w/DandF criteria, Model based clustering and hierarchical modeling simply failed to run on our datasets. Thankfully, the vanilla PCA technique was successful in handling our entire dataset. PCA revealed some interesting patterns for the scalar value distribution. Kernel PCA techniques (vanilladot, RBF, Polynomial) and MDS failed to run on the entire dataset, or even a significant fraction of the dataset, and we resorted to creating an explicit feature map followed by conventional PCA. Clustering using K-means and PAM in the new basis set seems to produce promising results. Understanding the new basis set in the scientific context of the problem is challenging, and we are currently working to further examine and interpret the results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

LANSCE Diagnostic Robot Localization

Los Alamos Neutron Science Center (LANSCE) operates a linear particle accelerator (LINAC) that is used for a number of scientific research projects. Due to the presence of harmful radiation, researchers are not allowed in the beam tunnel during operation. Since the beam tunnel is inaccessible, an autonomous mobile robot is to be developed and deployed in the tunnel, monitoring the accelerator during operation. The robot will present real time data for operators and scientists from sensors such as a video camera, thermal camera, microphones, and muon detectors; allowing for beam diagnostics previously unavailable. Localization is a fundamental step in autonomous navigation of mobile robots, answering the “where am I” question. For this project, an Extended Kalman Filter (EKF) algorithm is implemented as a positional estimator. The EKF relies on an odometric motion model to predict the robot’s position and LIDAR measurement data to update the robot’s position. The measurement model is based on v features extracted from the LIDAR point cluster using the Split-and-Merge algorithm, and the nearest neighbor algorithm associates the features to an a priori feature map of the beam tunnel. The predicted and measured positions are then joined using a weighted value by means of the Kalman gain. The effectiveness of this localization technique is demonstrated using the LabVIEW robotics simulator.

42 ENGINEERING↗

Concentric Spherical GNN for 3D Representation Learning

Learning 3D representations that generalize well to arbitrarily oriented inputs is a challenge of practical importance in applications varying from computer vision to physics and chemistry. We propose a novel multi-resolution convolutional architecture for learning over concentric spherical feature maps, of which the single sphere representation is a special case. Our hierarchical architecture is based on alternatively learning to incorporate both intra-sphere and inter-sphere information. We show the applicability of our method for two different types of 3D inputs, mesh objects, which can be regularly sampled, and point clouds, which are irregularly distributed. We also propose an efficient mapping of point clouds to concentric spherical images, thereby bridging spherical convolutions on grids with general point clouds. We demonstrate the effectiveness of our approach in improving state-of-the-art performance on 3D classification tasks with rotated data.

97 MATHEMATICS AND COMPUTING↗

Updates to USA Structures (Phase 3 Prototype): 2023-2024 Technical Report

The Oak Ridge National Laboratory (ORNL) team has successfully innovated geospatial data feature mapping and postprocessing workflows to support the USA Structures project supported by FEMA. This technical report highlights significant updates, improvements, and innovations for the USA Structures dataset, focusing on nine priority states.

97 MATHEMATICS AND COMPUTING↗

Joint Classification and Data Compression of multidimensional information sources - Application to ERTS

This paper describes a concept of Joint Classification and Data Compression of multidimensional information sources in the context of applications to Earth Resources Technology Satellites. The concept is used to define an Information Extraction System intended to remove data redundancy early in the sensor to user link in both classification and film interpretation applications. The approach uses cascaded partially supervised clustering to extract spectral intensity features from spatially local sources. Data compression is then used to efficiently represent spatial features within the spectral intensity feature map.

Hilbert, E. E.↗

Disharmony of the spheres - Recent trends in planetary surface nomenclature

Inadvisable departures from tradition in naming newly mapped features on Mars, Mercury, and the moon have been implemented and proposed since 1970. Functional need for place names also has become confused with cartographic convenience. Much of the resulting new nomenclature is neither unique, efficient, nor imaginative. The long-standing classical orientation in Solar System geography needs to be firmly reasserted. The Maedler scheme for designating smaller craters on the moon should be retained and extended to the farside. Names of surface features on other bodies might best reflect the traditional connotations of planet and satellite names: for example, most craters on Mars would be named for mythical heroes and military personalities in ancient history, craters on Mercury might commemorate explorers or commercial luminaries, and features on Venus would bear the names of famous women.

Pike, R. J.↗

Joint pattern recognition/data compression concept for ERTS multispectral imaging

This paper describes a new technique which jointly applies clustering and source encoding concepts to obtain data compression. The cluster compression technique basically uses clustering to extract features from the measurement data set which are used to describe characteristics of the entire data set. In addition, the features may be used to approximate each individual measurement vector by forming a sequence of scalar numbers which define each measurement vector in terms of the cluster features. This sequence, called the feature map, is then efficiently represented by using source encoding concepts. A description of a practical cluster compression algorithm is given and experimental results are presented to show trade-offs and characteristics of various implementations. Examples are provided which demonstrate the application of cluster compression to multispectral image data of the Earth Resources Technology Satellite.

Hilbert, E. E.↗

Cluster compression algorithm: A joint clustering/data compression concept

The Cluster Compression Algorithm (CCA), which was developed to reduce costs associated with transmitting, storing, distributing, and interpreting LANDSAT multispectral image data is described. The CCA is a preprocessing algorithm that uses feature extraction and data compression to more efficiently represent the information in the image data. The format of the preprocessed data enables simply a look-up table decoding and direct use of the extracted features to reduce user computation for either image reconstruction, or computer interpretation of the image data. Basically, the CCA uses spatially local clustering to extract features from the image data to describe spectral characteristics of the data set. In addition, the features may be used to form a sequence of scalar numbers that define each picture element in terms of the cluster features. This sequence, called the feature map, is then efficiently represented by using source encoding concepts. Various forms of the CCA are defined and experimental results are presented to show trade-offs and characteristics of the various implementations. Examples are provided that demonstrate the application of the cluster compression concept to multi-spectral images from LANDSAT and other sources.

Hilbert, E. E.↗

Tradeoffs among several synthetic aperture radar image quality parameters - Results of a user survey study

The imagery obtained with the aid of synthetic aperture radars (SAR) has been applied to several remote sensing disciplines such as geologic feature mapping, oceanic phenomena studies, and land use and urban morphology studies. The successful SAR experiment on Seasat and the Shuttle demonstrated the feasibility of global radar mapping at relatively high resolution from a spaceborn platform. The present investigation is concerned with the requirements of and the tradeoffs among several SAR image quality parameters. The results are presented from a survey study concerning the interpretability of a set of SAR images. The data used to generate these images were obtained by the Seasat SAR experiments. Attention is given to image scenes and the simulation experiment, image interpretation survey results, multiple-looks, the number of looks vs resolution, and number of bits vs resolution.

Li, F. K.↗

Fast, long-lived features in the polar stratosphere

The analysis method of Salby (1982) is applied to Stratospheric Sounding Unit brightness temperatures from the TIROS-N and NOAA-6 satellites. The resulting spectra are used to present further evidence for the wave two and three oscillations found by Prata (1984) and to demonstrate the existence of a wave four feature. Maps of synoptic reconstructions of the brightness temperature fields from the spectra are then used to further characterize the warm pools.

Lait, Leslie R.↗

Phoebe: A preliminary control network and rotational elements

A preliminary control network for the Saturnian satellite Phoebe was determined based upon 6 distinct albedo features mapped on 16 Voyager 2 images. Using an existing map and an analytical triangulation program which minimized the measurement error, the north pole of Phoebe was calculated to be alpha sub 0 = 355.0 deg + or - 9.6 deg, delta sub 0 = 68.7 deg + or - 7.9 deg, where alpha sub 0, delta sub 0 are standard equatorial coordinates with equinox J2000 at epoch J2000. The prime meridian of Phoebe was computed to be W = 304.7 deg + 930.833872d, where d is the interval in days from JD 2451545.0 TDB.

Colvin, Tim R.↗

Neural network approach to Space Shuttle Main Engine health monitoring

A neural network was trained to distinguish anomalies in Space Shuttle Main Engine sensor data from noisy normal steady-state sensor data. Power spectra of successive windows of individual sensor data were presented to a neural network using Kohonen's topological feature map training algorithm. The trained network for each sensor was then tested to determine if it would detect anomalies in the sensor data, and if so, the time at which the anomaly would be detected. Power spectra from a few hundred seconds of actual test data from NASA tests 901-364 and 904-044 were used to test the network. In both cases, the neural network detected the onset of anomalous engine behavior at approximately the same time within each test as the onset times reported by NASA and Rocketdyne experts in their post-test analyses.

Whitehead, Bruce A.↗

Self-organization and clustering algorithms

Kohonen's feature maps approach to clustering is often likened to the k or c-means clustering algorithms. Here, the author identifies some similarities and differences between the hard and fuzzy c-Means (HCM/FCM) or ISODATA algorithms and Kohonen's self-organizing approach. The author concludes that some differences are significant, but at the same time there may be some important unknown relationships between the two methodologies. Several avenues of research are proposed.

Bezdek, James C.↗

Two generalizations of Kohonen clustering

The relationship between the sequential hard c-means (SHCM), learning vector quantization (LVQ), and fuzzy c-means (FCM) clustering algorithms is discussed. LVQ and SHCM suffer from several major problems. For example, they depend heavily on initialization. If the initial values of the cluster centers are outside the convex hull of the input data, such algorithms, even if they terminate, may not produce meaningful results in terms of prototypes for cluster representation. This is due in part to the fact that they update only the winning prototype for every input vector. The impact and interaction of these two families with Kohonen's self-organizing feature mapping (SOFM), which is not a clustering method, but which often leads ideas to clustering algorithms is discussed. Then two generalizations of LVQ that are explicitly designed as clustering algorithms are presented; these algorithms are referred to as generalized LVQ = GLVQ; and fuzzy LVQ = FLVQ. Learning rules are derived to optimize an objective function whose goal is to produce 'good clusters'. GLVQ/FLVQ (may) update every node in the clustering net for each input vector. Neither GLVQ nor FLVQ depends upon a choice for the update neighborhood or learning rate distribution - these are taken care of automatically. Segmentation of a gray tone image is used as a typical application of these algorithms to illustrate the performance of GLVQ/FLVQ.

Bezdek, James C.↗

Communications and control for electric power systems

The first section of the report describes the AbNET system, a hardware and software communications system designed for distribution automation (it can also find application in substation monitoring and control). The topology of the power system fixes the topology of the communications network, which can therefore be expected to include a larger number of branch points, tap points, and interconnections. These features make this communications network unlike any other. The network operating software has to solve the problem of communicating to all the nodes of a very complex network in as reliable a way as possible even if the network is damaged, and it has to do so with minimum transmission delays and at minimum cost. The design of the operating protocols is described within the framework of the seven-layer Open System Interconnection hierarchy of the International Standards Organization. Section 2 of the report describes the development and testing of a high voltage sensor based on an electro-optic polymer. The theory of operation is reviewed. Bulk fabrication of the polymer is discussed, as well as results of testing of the electro-optic coefficient of the material. Fabrication of a complete prototype sensor suitable for use in the range 1-20 kV is described. The electro-optic polymer is shown to be an important material for fiber optic sensing applications. Appendix A is theoretical support for this work. The third section of the report presents the application of an artificial neural network, Kohonen's self-organizing feature map, for the classification of power system states. This classifier maps vectors of an N-dimensional space to a 2-dimensional neural net in a nonlinear way preserving the topological order of the input vectors. These mappings are studied using a nonlinear power system model.

Kirkham, H.↗

Monitoring the Microgravity Environment Quality On-Board the International Space Station Using Soft Computing Techniques

This paper presents an artificial intelligence monitoring system developed by the NASA Glenn Principal Investigator Microgravity Services project to help the principal investigator teams identify the primary vibratory disturbance sources that are active, at any moment in time, on-board the International Space Station, which might impact the microgravity environment their experiments are exposed to. From the Principal Investigator Microgravity Services' web site, the principal investigator teams can monitor via a graphical display, in near real time, which event(s) is/are on, such as crew activities, pumps, fans, centrifuges, compressor, crew exercise, platform structural modes, etc., and decide whether or not to run their experiments based on the acceleration environment associated with a specific event. This monitoring system is focused primarily on detecting the vibratory disturbance sources, but could be used as well to detect some of the transient disturbance sources, depending on the events duration. The system has built-in capability to detect both known and unknown vibratory disturbance sources. Several soft computing techniques such as Kohonen's Self-Organizing Feature Map, Learning Vector Quantization, Back-Propagation Neural Networks, and Fuzzy Logic were used to design the system.

Jules, Kenol↗