Search NASA⌕ Search

SEARCH · Search NASA

Results for “Pattern Recognition Algorithm”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Image Database Exploration: Progress and Challenges

In this paper we discuss the general problem of automated image database exploration, the particular aspects of image databases which distinguish them from other databases, and how this impacts the application of off-the-shelf learning algorithms to problems of this nature. Current progress will be illustrated using two large-scale image exploration projects at JPL. The paper concludes with a discussion of current and future challenges.

image database exploration pattern recognition tec↗
NASA NTRS1994

Design of a composite filter realizable on practical spatial light modulators

Hybrid optical correlator systems use two spatial light modulators (SLM's), one at the input plane and the other at the filter plane. Currently available SLM's such as the deformable mirror device (DMD) and liquid crystal television (LCTV) SLM's exhibit arbitrarily constrained operating characteristics. The pattern recognition filters designed with the assumption that the SLM's have ideal operating characteristic may not behave as expected when implemented on the DMD or LCTV SLM's. Therefore it is necessary to incorporate the SLM constraints in the design of the filters. In this report, an iterative method is developed for the design of an unconstrained minimum average correlation energy (MACE) filter. Then using this algorithm a new approach for the design of a SLM constrained distortion invariant filter in the presence of input SLM is developed. Two different optimization algorithms are used to maximize the objective function during filter synthesis, one based on the simplex method and the other based on the Hooke and Jeeves method. Also, the simulated annealing based filter design algorithm proposed by Khan and Rajan is refined and improved. The performance of the filter is evaluated in terms of its recognition/discrimination capabilities using computer simulations and the results are compared with a simulated annealing optimization based MACE filter. The filters are designed for different LCTV SLM's operating characteristics and the correlation responses are compared. The distortion tolerance and the false class image discrimination qualities of the filter are comparable to those of the simulated annealing based filter but the new filter design takes about 1/6 of the computer time taken by the simulated annealing filter design.

Rajan, P. K.↗
DOE OSTI2021

Evaluating Automated Face Identity-Masking Methods with Human Perception and a Deep Convolutional Neural Network

Face de-identification (or “masking”) algorithms have been developed in response to the prevalent use of video recordings in public places. Here, we evaluated the success of face identity masking for human perceivers and a deep convolutional neural network (DCNN). Eight de-identification algorithms were applied to videos of drivers’ faces, while they actively operated a motor vehicle. These masks were pre-selected to be applicable to low-quality video and to maintain coarse information about facial actions. Humans studied high-resolution images to learn driver identities and were tested on their recognition of active drivers in low-resolution videos. Faces in the videos were either unmasked or were masked by one of the eight algorithms. When participants were tested immediately after learning (Experiment 1), all masks reduced identification, with six of eight masks reducing identification to extremely poor performance. In a second experiment, two of the most effective masks were tested after a delay of 7 or 28 days. The delay did not further reduce identification of the masked faces. In all masked conditions, participants maintained stringent decision criteria, with low confidence in recognition, further indicating the effectiveness of the masks. Next, the DCNN performed an identity-matching task between high-resolution images and masked videos—a task analogous to that done by humans. The pattern of accuracy for the DCNN mirrored some, but not all, aspects of human performance, highlighting the need to test the effectiveness of identity masking for both humans and machines. The DCNN was also tested on its ability to match identity between masked and unmasked versions of the same video, based only on the face. DCNN performance for the eight masks offers insight into the nature of the information in faces that is coded in these networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantized Information in Spectral Cyberspace

The constant-Q Gabor atom is developed for spectral power, information, and uncertainty quantification from time–frequency representations. Stable multiresolution spectral entropy algorithms are constructed with continuous wavelet and Stockwell transforms. The recommended processing and scaling method will depend on the signature of interest, the desired information, and the acceptable levels of uncertainty of signal and noise features. Selected Lamb wave signatures and information spectra from the 2022 Tonga eruption are presented as representative case studies. Resilient transformations from physical to information metrics are provided for sensor-agnostic signal processing, pattern recognition, and machine learning applications.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRS1986

Optical processing and Space Station automation

Optical information processing research aimed at Space Station automation applications is reviewed. The emphasis of the NASA Ames Research Center program is on intelligent optical pattern recognition and optical control processing. Attention is given to the primary functions of an overall scene understanding system: distortion-invariant optical feature generation, dimensionality reduction, object classification, and contextual information processing. A method of using synthetic discriminant functions to facilitate learning in a high-speed optical correlator is described. A discussion is presented of candidate analog and digital architectures for the optical implementation of state-estimation algorithms needed for the control of high-dimension dynamic systems. The multivariate system chosen for the optical control technology demonstration - a segmented, adaptive mirror and interferometrically based wavefront sensor - is also described.

Ennis, D. J.↗
DOE OSTI2014

SciDAC Institute for Ultra-Scale Visualization: Activity Recognition for Ultra-Scale Visualization

Understanding the science behind ultra-scale simulations requires extracting meaning from data sets of hundreds of terabytes or more. Developing scalable parallel visualization algorithms is a key step enabling scientists to interact and visualize their data at this scale. However, at extreme scales, the datasets are so huge, there is not even enough time to view the data, let alone explore it with basic visualization methods. Automated tools are necessary for knowledge discovery -- to help sift through the information and isolate characteristic patterns, thereby enabling the scientist to study local interactions, the origin of features and their evolution in large volumes of data. These tools must be able to operate on data of this scale and work with the visualization process. In this project, we developed a framework for activity detection to allow scientists to model and extract spatio-temporal patterns from time-varying data.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, we cast the clustering problem into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. We constructed an appropriate objective function whose minimum will characterize a good possibilistic partition of the data, and we derived the membership and prototype update equations from necessary conditions for minimization of our criterion function. In this paper, we show the ability of this approach to detect linear and quartic curves in the presence of considerable noise.

Keller, James M.↗
NASA NTRS1993

Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, the clustering problem was cast into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. An appropriate objective function whose minimum will characterize a good possibilistic partition of the data was constructed, and the membership and prototype update equations from necessary conditions for minimization of our criterion function were derived. The ability of this approach to detect linear and quartic curves in the presence of considerable noise is shown.

Keller, James M.↗
DOE OSTI2014

X-ray diagnostic developments in the perspective of DEMO

Soft X-ray diagnostics at present are not adequate for a burning plasma experiment, neither in term of hardware nor as diagnostic conception. Detectors have to be radiation tolerant, easily shielded, with low sensitivity to neutrons and gammas and with energy discrimination. Layout and viewing capability should be more flexible, thanks to the use also of optical devices, going toward a configuration intermediate between discrete tomography and pure imaging. The general conception of these diagnostics should therefore evolve in the direction of pattern recognition for a real time feedback. This work is focused on the diagnostic developments undertaken at the ENEA- Frascati X-ray Laboratory, following in particular three directions: gas detector for fast and advanced high density tomography, C-MOS solid state imaging detectors for slow control and X-ray polycapillary optics. GEM gas detectors in photon counting mode (noise free) were developed in the range 1-30 keV having high efficiency, high time resolution (up to microseconds), energy discrimination in bands and optical flexibility. Discrimination of X-rays, neutrons and gammas has been demonstrated, thanks to the combination of intrinsic gain and discrimination thresholds, at neutron fluxes (10{sup 7} n/s*cm{sup 2}) comparable with the expected ones at the ports of ITER. GEM detectors are also extremely flexible in the design, allowing optimization of the measurements and solutions for shielding or minimization of the effect of background radiation. Two solid state C-MOS imagers working in photon counting mode, one based on Si semiconductor (Medipix-2, range 5-30 keV) and the other one having a CdTe sensor (Pixirad, range 2-100 keV) have been characterized in laboratory. C-MOS imagers have features and performances thoroughly complementary to the GEM detector and, thanks to their higher pixel density, could be used as remote imaging detectors coupled to optics. X-ray polycapillary lenses have been therefore studied in the laboratory both as imaging optical device (full lens) or to define a line of sight (cylinder lens); the preliminary results are encouraging toward the goal of using these lenses to transport X-ray radiation far from the reactor. Reflective or diffractive X-ray optics can be also an option for tomography. A GEM detector has been installed at KSTAR and in the next future hopefully the other approaches will be tested there: once their feasibility will be demonstrated, the issue of the improvement of the radiation tolerance will be faced and the development of algorithms for data analysis as well.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Muon track reconstruction in a segmented bolometric array using multi-objective optimization

Recent advances in segmented solid-state detector arrays for rare-event searches have allowed the technology to approach the ton-scale in detector mass and the scale of meters in size. Often focused around searches for neutrinoless double-beta decay or direct dark matter detection, such experiments also have the capability to search for exotic particles that leave track-like signatures across their volume. However, the segmented nature of such detector arrays often sets the spatial resolution and makes the problem of reconstructing track-like paths non-trivial. Here, in this paper, we present an algorithm that improves reconstruction of track-like events in segmented detectors using multi-objective optimization — a computational technique that optimizes more than one cost function at a time without specifying a quantitative weighting between them. Such a technique allows the reconstruction of tracks through a detector and the determination of path-lengths through individual elements. When combined with the reconstructed energy depositions in each element this allows for a calculation of the stopping power of track-like particles and opens the door to searches for particles with abnormal stopping power like monopoles or lightly-ionizing particles (LIPs). Results are presented which evaluate the precision of the reconstruction tools as they currently stand against Monte Carlo generated data. The algorithm is presented in the context of the CUORE experiment, but has applications to other segmented calorimeter detectors.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

VERIFICATION OF TRISO FUEL BURNUP USING MACHINE LEARNING ALGORITHMS

Pebble Bed Reactors are fueled with fuel pebbles that are circulated multiple times through the reactor vessel before discharge. During the normal operation of a PBR, ejected pebbles are returned to the reactor or discharged depending on the fuel burnup and physical condition of the pebbles. The burnup measurement is usually based on detected radiation signatures of fission products accumulated in the pebble fuel over burnup. Previous research has shown that height of photopeaks of fission products, such as 134Cs, 137Cs, 154Eu, etc., can be used independently or in combination to infer or predict the level of burnup in the fuel. However, it remains challenging to measure such complex sources due to self-shielding effects, strong radiation background and intervening materials. Another operational challenge is the required high throughput of burnup measurement, which necessitates limited measurement time and thus impacts quality of measured gamma-ray spectra. Hence, advanced spectral analysis methods are needed to analyze the noisy gamma spectra and predict the burnup values. We propose to use machine learning (ML) method to interpret gamma-ray spectra and predict the burnup values of the pebbles. ML has achieved widespread success and adoption across a few domains that require pattern recognition and analysis in varied data types. In this work, we apply three proven ML approaches - multilayer perceptrons, convolutional neural networks, and transformers - to the task of predicting fuel burnup from measured gamma spectra, and compile a dataset of simulated spectra for training and validation of the ML models. In this paper, we will discuss the network architecture of these three ML approaches and compare the performance of the simplest of these (MLP) to a standard linear regression.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2021

Validation of the Sentinel-5 Precursor TROPOMI cloud data with Cloudnet, Aura OMI O 2 –O 2 , MODIS, and Suomi-NPP VIIRS

Accurate knowledge of cloud properties is essential to the measurement of atmospheric composition from space. In this work we assess the quality of the cloud data from three Copernicus Sentinel-5 Precursor (S5P) TROPOMI cloud products: (i) S5P OCRA/ROCINN_CAL (Optical Cloud Recognition Algorithm/Retrieval of Cloud Information using Neural Networks;Clouds-As-Layers), (ii) S5P OCRA/ROCINN_CRB (Clouds-as-Reflecting Boundaries), and (iii) S5P FRESCO-S (Fast Retrieval Scheme for Clouds from Oxygen absorption bands – Sentinel). Target properties of this work are cloud-top height and cloud optical thickness (OCRA/ROCINN_CAL), cloud height (OCRA/ROCINN_CRB and FRESCO-S), and radiometric cloud fraction (all three algorithms). The analysis combines (i) the examination of cloud maps for artificial geographical patterns, (ii) the comparison to other satellite cloud data (MODIS, NPP-VIIRS, and OMI O2–O2), and (iii) ground-based validation with respect to correlative observations (30 April 2018 to 27 February 2020) from the Cloudnet network of ceilometers, lidars, and radars. Zonal mean latitudinal variation of S5P cloud properties is similar to that of other satellite data. S5P OCRA/ROCINN_CAL agrees well with NPP VIIRS cloud-top height and cloud optical thickness and with Cloudnet cloud-top height, especially for the low (mostly liquid) clouds. For the high clouds, S5P OCRA/ROCINN_CAL cloud-top height is below the cloud-top height of VIIRS and of Cloudnet, while its cloud optical thickness is higher than that of VIIRS. S5P OCRA/ROCINN_CRB and S5P FRESCO cloud height are well below the Cloudnet cloud mean height for the low clouds but match on average better with the Cloudnet cloud mean height for the higher clouds. As opposed to S5P OCRA/ROCINN_CRB and S5P FRESCO, S5P OCRA/ROCINN_CAL is well able to match the lowest CTH mode of the Cloudnet observations. Peculiar geographical patterns are identified in the cloud products and will be mitigated in future releases of the cloud data products.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Verification of Triso Fuel Burnup Using Machine Learning Algorithms

Pebble Bed Reactors are fueled with fuel pebbles that are circulated multiple times through the reactor vessel before discharge. During the normal operation of a PBR, ejected pebbles are returned to the reactor or discharged depending on the fuel burnup and physical condition of the pebbles. The burnup measurement is usually based on detected radiation signatures of fission products accumulated in the pebble fuel over burnup. Previous research has shown that height of photopeaks of fission products, such as 134 Cs, 137 Cs, 154 Eu, etc., can be used independently or in combination to infer or predict the level of burnup in the fuel. However, it remains challenging to measure such complex sources due to self-shielding effects, strong radiation background and intervening materials. Another operational challenge is the required high throughput of burnup measurement, which necessitates limited measurement time and thus impacts quality of measured gamma-ray spectra. Hence, advanced spectral analysis methods are needed to analyze the noisy gamma spectra and predict the burnup values. We propose to use machine learning (ML) method to interpret gamma-ray spectra and predict the burnup values of the pebbles. ML has achieved widespread success and adoption across a few domains that require pattern recognition and analysis in varied data types. In this work, we apply three proven ML approaches - multilayer perceptrons, convolutional neural networks, and transformers - to the task of predicting fuel burnup from measured gamma spectra, and compile a dataset of simulated spectra for training and validation of the ML models. In this paper, we will discuss the network architecture of these three ML approaches and compare the performance of the simplest of these (MLP) to a standard linear regression.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS2005

Gesture Based Control and EMG Decomposition

This paper presents two probabilistic developments for use with Electromyograms (EMG). First described is a new-electric interface for virtual device control based on gesture recognition. The second development is a Bayesian method for decomposing EMG into individual motor unit action potentials. This more complex technique will then allow for higher resolution in separating muscle groups for gesture recognition. All examples presented rely upon sampling EMG data from a subject's forearm. The gesture based recognition uses pattern recognition software that has been trained to identify gestures from among a given set of gestures. The pattern recognition software consists of hidden Markov models which are used to recognize the gestures as they are being performed in real-time from moving averages of EMG. Two experiments were conducted to examine the feasibility of this interface technology. The first replicated a virtual joystick interface, and the second replicated a keyboard. Moving averages of EMG do not provide easy distinction between fine muscle groups. To better distinguish between different fine motor skill muscle groups we present a Bayesian algorithm to separate surface EMG into representative motor unit action potentials. The algorithm is based upon differential Variable Component Analysis (dVCA) [l], [2] which was originally developed for Electroencephalograms. The algorithm uses a simple forward model representing a mixture of motor unit action potentials as seen across multiple channels. The parameters of this model are iteratively optimized for each component. Results are presented on both synthetic and experimental EMG data. The synthetic case has additive white noise and is compared with known components. The experimental EMG data was obtained using a custom linear electrode array designed for this study.

Wheeler, Kevin R.↗
NASA NTRS1990

Instrumentation and robotic image processing using top-down model control

A top-down image processing scheme is described. A three-dimensional model of a robotic working environment, with robot manipulators, workpieces, cameras, and on-the-scene visual enhancements is employed to control and direct the image processing, so that rapid, robust algorithms act in an efficient manner to continually update the model. Only the model parameters are communicated, so that savings in bandwidth are achieved. This image compression by modeling is especially important for control of space telerobotics. The background for this scheme lies in an hypothesis of human vision put forward by the senior author and colleagues almost 20 years ago - the Scanpath Theory. Evidence was obtained that repetitive sequences of saccadic eye movements, the scanpath, acted as the checking phase of visual pattern recognition. Further evidence was obtained that the scanpaths were apparently generated by a cognitive model and not directly by the visual image. This top-down theory of human vision was generalized in some sense to the frame in artificial intelligence. Another source of the concept arose from bioengineering instrumentation for measuring the pupil and eye movements with infrared video cameras and special-purpose hardware.

Stark, Lawrence↗
DOE OSTI2013

LINEBACkER: Bio-inspired Data Reduction Toward Real Time Network Traffic Analysis

Abstract—One essential component of resilient cyber applications is the ability to detect adversaries and protect systems with the same flexibility adversaries will use to achieve their goals. Current detection techniques do not enable this degree of flexibility because most existing applications are built using exact or regular-expression matching to libraries of rule sets. Further, network traffic defies traditional cyber security approaches that focus on limiting access based on the use of passwords and examination of lists of installed or downloaded programs. These approaches do not readily apply to network traffic occurring beyond the access control point, and when the data in question are combined control and payload data of ever increasing speed and volume. Manual analysis of network traffic is not normally possible because of the magnitude of the data that is being exchanged and the length of time that this analysis takes. At the same time, using an exact matching scheme to identify malicious traffic in real time often fails because the lists against which such searches must operate grow too large. In this work, we introduce an alternative method for cyber network detection based on similarity-measuring algorithms for gene sequence analysis. These methods are ideal because they were designed to identify similar but nonidentical sequences. We demonstrate that our method is generally applicable to the problem of network traffic analysis by illustrating its use in two different areas both based on different attributes of network traffic. Our approach provides a logical framework for organizing large collections of network data, prioritizing traffic of interest to human analysts, and makes it possible to discover traffic signatures without the bias introduced by expert-directed signature generation. Pattern recognition on reduced representations of network traffic offers a fast, efficient, and more robust way to detect anomalies.

Teuton, Jeremy R.↗
NASA NTRS2017

Planetary Crater Detection and Registration Using Marked Point Processes, Graph Cut Algorithms, and Wavelet Transforms

This paper addresses the problem of semi-automatic image registration on planetary images. A joint feature-based and area-based approach is proposed. Firstly, the most relevant craters are extracted from the two images to register, and then, registration is performed in two steps. The first step matches the craters extracted from the images based on a generalized Hausdorff distance. In the second step, the mutual information between the two images is maximized to achieve high registration accuracy. Craters are detected by a stochastic-geometry approach based on a marked point process model and of a multiple-birth-and-cut energy minimization algorithm. The experimental validation is carried out with 13 images for the crater extraction stage, and with 20 semi-synthetic pairs of images with ground truth and several images extracted from actual multi-temporal lunar scenes for the registration phase.

Image Processing; Pattern Recognition↗
NASA NTRS2001

Spatial/Spectral Identification of Endmembers from AVIRIS Data using Mathematical Morphology

During the last several years, a number of airborne and satellite hyperspectral sensors have been developed or improved for remote sensing applications. Imaging spectrometry allows the detection of materials, objects and regions in a particular scene with a high degree of accuracy. Hyperspectral data typically consist of hundreds of thousands of spectra, so the analysis of this information is a key issue. Mathematical morphology theory is a widely used nonlinear technique for image analysis and pattern recognition. Although it is especially well suited to segment binary or grayscale images with irregular and complex shapes, its application in the classification/segmentation of multispectral or hyperspectral images has been quite rare. In this paper, we discuss a new completely automated methodology to find endmembers in the hyperspectral data cube using mathematical morphology. The extension of classic morphology to the hyperspectral domain allows us to integrate spectral and spatial information in the analysis process. In Section 3, some basic concepts about mathematical morphology and the technical details of our algorithm are provided. In Section 4, the accuracy of the proposed method is tested by its application to real hyperspectral data obtained from the Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) imaging spectrometer. Some details about these data and reference results, obtained by well-known endmember extraction techniques, are provided in Section 2. Finally, in Section 5 we expose the main conclusions at which we have arrived.

Plaza, Antonio↗