Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Integration of Ag-CBRAM crossbars and Mott ReLU neurons for efficient implementation of deep neural networks in hardware

In-memory computing with emerging non-volatile memory devices (eNVMs) has shown promising results in accelerating matrix-vector multiplications. However, activation function calculations are still being implemented with general processors or large and complex neuron peripheral circuits. Here, we present the integration of Ag-based conductive bridge random access memory (Ag-CBRAM) crossbar arrays with Mott rectified linear unit (ReLU) activation neurons for scalable, energy and area-efficient hardware (HW) implementation of deep neural networks. We develop Ag-CBRAM devices that can achieve a high ON/OFF ratio and multi-level programmability. Compact and energy-efficient Mott ReLU neuron devices implementing ReLU activation function are directly connected to the columns of Ag-CBRAM crossbars to compute the output from the weighted sum current. We implement convolution filters and activations for VGG-16 using our integrated HW and demonstrate the successful generation of feature maps for CIFAR-10 images in HW. Our approach paves a new way toward building a highly compact and energy-efficient eNVMs-based in-memory computing system.

Mott insulators↗
DOE OSTI2023

Numerical evidence against advantage with quantum fidelity kernels on classical data

Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain classically intractable functions efficiently if the kernel is well aligned with the target function. In the more general case, quantum kernels are known to suffer from exponential “flattening” of the spectrum as the number of qubits grows, preventing generalization and necessitating the control of the inductive bias by hyperparameters. We show that the general-purpose hyperparameter-tuning techniques proposed to improve the generalization of quantum kernels lead to the kernel becoming well approximated by a classical kernel, removing the possibility of quantum advantage. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data that lacks special structure.

Quantum Information, Science & Technology↗
DOE OSTI2023

Fault Detection via Occupation Kernel Principal Component Analysis

Reliable operation of automatic systems is heavily dependent on the ability to detect faults in the underlying dynamics. While traditional model-based methods have been widely used for fault detection, data-driven approaches have garnered increasing attention due to their ease of deployment and minimal need for expert knowledge. In this letter, we present a novel principal component analysis (PCA) method that uses occupation kernels. Occupation kernels result in feature maps that are tailored to the measured data, have inherent noise-robustness due to the use of integration, and can utilize irregularly sampled system trajectories of variable lengths for PCA. The occupation kernel PCA method is used to develop a reconstruction error approach to fault detection and its efficacy is validated using numerical simulations.

42 ENGINEERING↗
DOE OSTI2022

Real-Time Ecodriving Control in Electrified Connected and Autonomous Vehicles Using Approximate Dynamic Programing

Connected and automated vehicles (CAVs), particularly those with a hybrid electric powertrain, have the potential to significantly improve vehicle energy savings in real-world driving conditions. In particular, the ecodriving problem seeks to design optimal speed and power usage profiles based on available information from connectivity and advanced mapping features to minimize the fuel consumption over an itinerary. This paper presents a hierarchical multilayer model predictive control (MPC) approach for improving the fuel economy of a 48 V mild-hybrid powertrain in a connected vehicle environment. Approximate dynamic programing (DP) is used to solve the receding horizon optimal control problem, whose terminal cost is approximated with the base policy obtained from the long-term optimization. The controller was tested virtually (with deterministic and Monte Carlo simulation) across multiple real-world routes, demonstrating energy savings of more than 20%. The controller was then deployed on a test vehicle equipped with a rapid prototyping embedded controller. In-vehicle testing confirm the energy savings obtained in simulation and demonstrate the real-time ability of the controller.

Automation & Control Systems↗
DOE OSTI2025

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↗
DOE OSTI2021

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↗
DOE OSTI2024

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↗
NASA NTRS1975

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.↗
NASA NTRS1976

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.↗
NASA NTRS1975

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.↗
NASA NTRS1977

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.↗
NASA NTRS1983

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.↗
NASA NTRS1988

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.↗
NASA NTRS1989

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.↗
NASA NTRS1990

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.↗
NASA NTRS1991

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.↗
NASA NTRS1993

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.↗