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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Topological analysis of X-ray CT data for the recognition and trending of subtle changes in microstructure under material aging

X-ray computed tomography (CT) is an established non-destructive tool for 3D imaging of multiphasic composites. Numerous applications of X-ray CT in medical diagnosis and materials characterization have been reported, many involving field-specific innovations in the imaging technology itself. Yet, quantitative summarization to link image features to properties of interest has been rare. Here we address this issue by employing state-of-the-art technics in scalar field topology for the summarization of X-ray CT images of an example biphasic system. By varying processing-parameters we create different microstructures, evolve them through accelerated thermal aging, CT-image them pre- and post-aged, and demonstrate the ability of our image summarization method to systematically track process- and age-related changes, which can often be very subtle. A novel aspect of the algorithm involves recognition over multiple resolution levels, which provides deeper insight into the pattern relationship between grain-like features and their neighbors. The method is general, adaptable to diverse image reconstruction methods and materials systems, and particularly useful in applications where practical constraints on the sample-size limits the reliable use of more complex models, e.g., convolutional neural networks.

36 MATERIALS SCIENCE↗
DOE OSTI2017

Computer-Aided Diagnosis of Lung Nodules in Computed Tomography by Using Phylogenetic Diversity, Genetic Algorithm, and SVM

Lung cancer is pointed as the major cause of death among patients with cancer throughout the world. This work is intended to develop a methodology for diagnosis of lung nodules using images from the Image Database Consortium and Image Database Resource Initiative (LIDC-IDRI). The proposed methodology uses image processing and pattern recognition techniques. In order to differentiate between the patterns of malignant and benign nodules, we used phylogenetic diversity by means of particular indexes, that are: intensive quadratic entropy, extensive quadratic entropy, average taxonomic distinctness, total taxonomic distinctness, and pure diversity indexes. After that, we applied the genetic algorithm for selection of the best model. In the tests’ stage, we applied the proposed methodology to 1405 (394 malignant and 1011 benign) nodules. The proposed work presents promising results at the classification into malignant and benign, achieving accuracy of 92.52%, sensitivity of 93.1% and specificity of 92.26%. The results demonstrated a good rate of correct detections using texture features. Since a precocious detection allows a faster therapeutic intervention, thus a more favorable prognostic to the patient, we propose herein a methodology that contributes to the area in this aspect.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2022

Reconstruction of Large Radius Tracks with the Exa.TrkX pipeline

Particle tracking is a challenging pattern recognition task at the Large Hadron Collider (LHC) and the High Luminosity-LHC. Conventional algorithms, such as those based on the Kalman Filter, achieve excellent performance in reconstructing the prompt tracks from the collision points. However, they require dedicated configuration and additional computing time to efficiently reconstruct the large radius tracks created away from the collision points. We developed an end-to-end machine learning-based track finding algorithm for the HL-LHC, the Exa.TrkX pipeline. The pipeline is designed so as to be agnostic about global track positions. In this work, we study the performance of the Exa.TrkX pipeline for finding large radius tracks. Trained with all tracks in the event, the pipeline simultaneously reconstructs prompt tracks and large radius tracks with high efficiencies. This new capability offered by the Exa.TrkX pipeline may enable us to search for new physics in real time.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2018

Particle Flow and PUPPI in the Level-1 Trigger at CMS for the HL-LHC

With the planned addition of tracking information to the Compact Muon Solenoid (CMS) Level-1 trigger for the High-Luminosity Large Hadron Collider (HL-LHC), the trigger algorithms can be completely reconceptualized. We explore the feasibility of using particle flow-like reconstruction and pileup per particle identification (PUPPI) pileup mitigation at the hardware trigger level. This represents a new type of multi-subdetector pattern recognition challenge for the HL-LHC. We present proof-of-principle studies on both physics and hardware-resource performance of a prototype algorithm for use by CMS in the HL-LHC era.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Graph Neural Networks for Particle Reconstruction in High Energy Physics detectors

Pattern recognition problems in high energy physics are notably different from traditional machine learning applications in computer vision. Reconstruction algorithms identify and measure the kinematic properties of particles produced in high energy collisions and recorded with complex detector systems. Two critical applications are the reconstruction of charged particle trajectories in tracking detectors and the reconstruction of particle showers in calorimeters. These two problems have unique challenges and characteristics, but both have high dimensionality, high degree of sparsity, and complex geometric layouts. Graph Neural Networks (GNNs) are a relatively new class of deep learning architectures which can deal with such data effectively, allowing scientists to incorporate domain knowledge in a graph structure and learn powerful representations leveraging that structure to identify patterns of interest. In this work we demonstrate the applicability of GNNs to these two diverse particle reconstruction problems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2014

CrowdPhase: crowdsourcing the phase problem

The idea of attacking the phase problem by crowdsourcing is introduced. Using an interactive, multi-player, web-based system, participants work simultaneously to select phase sets that correspond to better electron-density maps in order to solve low-resolution phasing problems. The human mind innately excels at some complex tasks that are difficult to solve using computers alone. For complex problems amenable to parallelization, strategies can be developed to exploit human intelligence in a collective form: such approaches are sometimes referred to as ‘crowdsourcing’. Here, a first attempt at a crowdsourced approach for low-resolution ab initio phasing in macromolecular crystallography is proposed. A collaborative online game named CrowdPhase was designed, which relies on a human-powered genetic algorithm, where players control the selection mechanism during the evolutionary process. The algorithm starts from a population of ‘individuals’, each with a random genetic makeup, in this case a map prepared from a random set of phases, and tries to cause the population to evolve towards individuals with better phases based on Darwinian survival of the fittest. Players apply their pattern-recognition capabilities to evaluate the electron-density maps generated from these sets of phases and to select the fittest individuals. A user-friendly interface, a training stage and a competitive scoring system foster a network of well trained players who can guide the genetic algorithm towards better solutions from generation to generation via gameplay. CrowdPhase was applied to two synthetic low-resolution phasing puzzles and it was shown that players could successfully obtain phase sets in the 30° phase error range and corresponding molecular envelopes showing agreement with the low-resolution models. The successful preliminary studies suggest that with further development the crowdsourcing approach could fill a gap in current crystallographic methods by making it possible to extract meaningful information in cases where limited resolution might otherwise prevent initial phasing.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Expected tracking performance of the ATLAS Inner Tracker at the High-Luminosity LHC

The high-luminosity phase of LHC operations (HL-LHC), will feature a large increase in simultaneous proton-proton interactions per bunch crossing up to 200, compared with a typical leveling target of 64 in Run 3. Such an increase will create a very challenging environment in which to perform charged particle trajectory reconstruction, a task crucial for the success of the ATLAS physics program, and will exceed the capabilities of the current ATLAS Inner Detector (ID). A new all-silicon Inner Tracker (ITk) will replace the current ID in time for the start of the HL-LHC. To ensure successful use of the ITk capabilities in Run 4 and beyond, the ATLAS tracking software has been successfully adapted to achieve state-of-the-art track reconstruction in challenging high-luminosity conditions with the ITk detector. This paper presents the expected tracking performance of the ATLAS ITk based on the latest available developments since the ITk technical design reports.

47 OTHER INSTRUMENTATION↗
DOE OSTI2013

Pattern recognition techniques to reduce backgrounds in the search for the {sup 136}Xe double beta decay with gaseous TPCs

The observation of the neutrinoless double beta decay may provide essential information on the nature of neutrinos. Among the current experimental approaches, a high pressure gaseous TPC is an attractive option for the search of double beta decay due to its good energy resolution and the detailed topological information of each event. We present in this talk a detailed study of the ionization topology of the {sup 136}Xe double beta decay events in a High Pressure Xenon TPC, as well as that of the typical competing backgrounds. We define some observables based on graph theory concepts to develop automated discrimination algorithms. Our criteria are able to reduce the background level by about three orders of magnitude in the region of interest of the {sup 136}Xe Q{sub ββ} for a signal acceptance of 40%. This result provides a quantitative assessment of the benefit of topological information offered by gaseous TPCs for double beta decay search, and proves that it is a promising feature in view of future experiments in the field. Possible ideas for further improvement in the discrimination algorithms and the dependency of these results with the gas diffusion and readout granularity will be also discussed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2018

Verification Data Pattern Recognition and Change Detection at the Neutron Instrument Level

As the pressure on International Atomic Energy Agency (IAEA) safeguards resources increases, there is a drive to essentially “do more with less.” New ways of using current verification instrumentation and visualizing the collected data are needed, coupled with maintaining and sustaining the current safeguards instrumentation fleet. This paper explores how to innovate with current safeguards neutron instrumentation using data-driven algorithms at the instrument level. A concept is described for upgrading current neutron counting systems with modern electronics by leveraging electronics developments in other fields (e.g., high-energy physics) to facilitate full list mode data acquisition and, therefore, expand existing analyses to pattern recognition and change detection at the instrument level. The aim is to advance correlated neutron counting by improving the reliability of detecting nuclear material diversion and, at the same time, to improve the sustainability of those systems. It is likely that upgrading existing systems with new hardware and software is more cost-effective than replacing systems with other novel systems that might meet this need. A specific project example is highlighted in which a system was upgraded by retrofitting the standard uranium neutron collar detector with new electronics; as a result, verification data can be analyzed in new ways. A new neutron analysis method, the “List Mode Response Matrix,” has been developed to analyze every pulse train from the detector array and thus enable the verification of spatial information about the assay item for safeguards inspections. This project has improved the reliability of resolving individual fuel pin locations within a given fresh fuel assembly and the percentage of partial defects detected. Herein, the overall concept of upgrading current neutron counting systems is discussed with respect to the potential increase in analysis capabilities. In addition, the details and results of the list mode collar project are discussed.

Worrall, Louise G.↗
DOE OSTI2020

FPGA-based tracking for the CMS Level-1 trigger using the tracklet algorithm

The high instantaneous luminosities expected following the upgrade of the Large Hadron Collider (LHC) to the High-Luminosity LHC (HL-LHC) pose major experimental challenges for the CMS experiment. A central component to allow efficient operation under these conditions is the reconstruction of charged particle trajectories and their inclusion in the hardware based trigger system. There are many challenges involved in achieving this: a large input data rate of about 20–40 Tb/s; processing a new batch of input data every 25 ns, each consisting of about 15,000 precise position measurements and rough transverse momentum measurements of particles (“stubs”); performing the pattern recognition on these stubs to find the trajectories; and producing the list of trajectory parameters within 4 µs. Here, this paper describes a proposed solution to this problem, specifically, it presents a novel approach to pattern recognition and charged particle trajectory reconstruction using an all-FPGA solution. The results of an end-to-end demonstrator system, based on Xilinx Virtex-7 FPGAs, that meets timing and performance requirements are presented along with a further improved, optimized version of the algorithm together with its corresponding expected performance.

47 OTHER INSTRUMENTATION↗
DOE OSTI2017

A historical survey of algorithms and hardware architectures for neural-inspired and neuromorphic computing applications

In this study, biological neural networks continue to inspire new developments in algorithms and microelectronic hardware to solve challenging data processing and classification problems. Here in this research, we survey the history of neural-inspired and neuromorphic computing in order to examine the complex and intertwined trajectories of the mathematical theory and hardware developed in this field. Early research focused on adapting existing hardware to emulate the pattern recognition capabilities of living organisms. Contributions from psychologists, mathematicians, engineers, neuroscientists, and other professions were crucial to maturing the field from narrowly-tailored demonstrations to more generalizable systems capable of addressing difficult problem classes such as object detection and speech recognition. Algorithms that leverage fundamental principles found in neuroscience such as hierarchical structure, temporal integration, and robustness to error have been developed, and some of these approaches are achieving world-leading performance on particular data classification tasks. Additionally, novel microelectronic hardware is being developed to perform logic and to serve as memory in neuromorphic computing systems with optimized system integration and improved energy efficiency. Key to such advancements was the incorporation of new discoveries in neuroscience research, the transition away from strict structural replication and towards the functional replication of neural systems, and the use of mathematical theory frameworks to guide algorithm and hardware developments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Quantum Associative Memory in Hep Track Pattern Recognition

We have entered the Noisy Intermediate-Scale Quantum Era. A plethora of quantum processor prototypes allow evaluation of potential of the Quantum Computing paradigm in applications to pressing computational problems of the future. Growing data input rates and detector resolution foreseen in High-Energy LHC (2030s) experiments expose the often high time and/or space complexity of classical algorithms. Quantum algorithms can potentially become the lower-complexity alternatives in such cases. In this work we discuss the potential of Quantum Associative Memory (QuAM) in the context of LHC data triggering. We examine the practical limits of storage capacity, as well as store and recall errorless efficiency, from the viewpoints of the state-of-the-art IBM quantum processors and LHC real-time charged track pattern recognition requirements. We present a software prototype implementation of the QuAM protocols and analyze the topological limitations for porting the simplest QuAM instances to the public IBM 5Q and 14Q cloud-based superconducting chips.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Developing and Implementing the Data Mining Algorithms in RAVEN

The RAVEN code is becoming a comprehensive tool to perform probabilistic risk assessment, uncertainty quantification, and verification and validation. The RAVEN code is being developed to support many programs and to provide a set of methodologies and algorithms for advanced analysis. Scientific computer codes can generate enormous amounts of data. To post-process and analyze such data might, in some cases, take longer than the initial software runtime. Data mining algorithms/methods help in recognizing and understanding patterns in the data, and thus discover knowledge in databases. The methodologies used in the dynamic probabilistic risk assessment or in uncertainty and error quantification analysis couple system/physics codes with simulation controller codes, such as RAVEN. RAVEN introduces both deterministic and stochastic elements into the simulation while the system/physics code model the dynamics deterministically. A typical analysis is performed by sampling values of a set of parameter values. A major challenge in using dynamic probabilistic risk assessment or uncertainty and error quantification analysis for a complex system is to analyze the large number of scenarios generated. Data mining techniques are typically used to better organize and understand data, i.e. recognizing patterns in the data. This report focuses on development and implementation of Application Programming Interfaces (APIs) for different data mining algorithms, and the application of these algorithms to different databases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

An FPGA-based Pattern Recognition Associative Memory

Pattern recognition associative memory (PRAM) devices are parallel processing engines which are used to tackle the complex combinatorics of track nding algorithms, particularly for silicon based tracking triggers. PRAM development has been mostly limited to the realm of ASICs, which often leads to lengthy and expensive design cycles. FPGAs allow for quick iterations, making them an ideal hardware platform for designing and evaluating new PRAM features before committing to silicon. In this paper we present our FPGA-based PRAM designs and discuss how logic blocks which were originally developed for ASICs have been redesigned to take advantage of modern FPGA architectures.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Beyond 4D tracking: using cluster shapes for track seeding

Tracking is one of the most time consuming aspects of event reconstruction at the Large Hadron Collider (LHC) and its high-luminosity upgrade (HL-LHC). Innovative detector technologies extend tracking to four-dimensions by including timing in the pattern recognition and parameter estimation. However, present and future hardware already have additional information that is largely unused by existing track seeding algorithms. The shape of pixel-clusters provides an additional dimension for track seeding that can significantly reduce the combinatorial challenge of track finding. We use neural networks to show that cluster shapes can reduce significantly the rate of fake combinatorical backgrounds while preserving a high efficiency. We demonstrate this using the information in cluster singlets, doublets and triplets. Numerical results are presented with simulations from the TrackML challenge.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

SLOPE daily and 250 m gross primary productivity (GPP) for the CONUS, 2000-2019, Carbon Monitoring System (CMS)

The SatelLite Only Photosynthesis Estimation (SLOPE) GPP product is a daily, 250 m GPP dataset covering the Contiguous United States (CONUS) from 2000 to present with 1 day latency. Gross primary productivity (GPP) quantifies the amount of carbon dioxide (CO2) fixed by plants through photosynthesis. Although as a key quantity of terrestrial ecosystems, there is a lack of high-spatial-and-temporal-resolution, real-time, and observation-based GPP products. This product has been developed to address this critical gap, leveraging a number of MODIS land and atmosphere products. There are three distinct features of the SLOPE GPP production algorithm. (1) SLOPE couples machine learning models with MODIS atmosphere and land products to accurately estimate PAR. (2) SLOPE couples highly efficient and pragmatic gap-filling and filtering algorithms with surface reflectance acquired by both Terra and Aqua MODIS satellites to derive a soil-adjusted NIRv (SANIRv) dataset. (3) SLOPE couples a temporal pattern recognition approach with a long-term Crop Data Layer (CDL) product to predict dynamic C4 crop fraction. PAR, SANIRv and C4 fraction are used to drive a parsimonious model with only two slope parameters to estimate GPP along with a quantitative uncertainty on a per-pixel and daily basis. The slope GPP product has a R2 = 0.84 and a root-mean-square error (RMSE) of 1.65 gC m-2 d-1, evaluated against from 50 AmeriFlux eddy covariance sites (332 site-years). Archived data from 2000 to 2019 are publicly available at the NASA's Oak Ridge National Laboratory Distributed Active Archive Center (ORNL DAAC). Data from 2020 are available from the authors upon request. All data are projected in the standard MODIS Land Integerized Sinusoidal tile map projection. Each processing tile is in size of 4800 pixels by 4800 pixels, representing approximately 1200 km by 1200 km land region. In addition to the GPP product, SLOPE PAR, SANIRV, and C4 fraction, along with their uncertainties, are also released.

Jiang, Chongya↗
DOE OSTI2021

A daily, 250 m and real-time gross primary productivity product (2000–present) covering the contiguous United States

Abstract. Gross primary productivity (GPP) quantifies the amount of carbon dioxide (CO2) fixed by plants through photosynthesis. Although as a key quantity of terrestrial ecosystems, there is a lack of high-spatial-and-temporal-resolution, real-time and observation-based GPP products. To address this critical gap, here we leverage a state-of-the-art vegetation index, near-infrared reflectance of vegetation (NIRV), along with accurate photosynthetically active radiation (PAR), to produce a SatelLite Only Photosynthesis Estimation (SLOPE) GPP product for the contiguous United States (CONUS). Compared to existing GPP products, the proposed SLOPE product is advanced in its spatial resolution (250 m versus >500 m), temporal resolution (daily versus 8 d), instantaneity (latency of 1 d versus >2 weeks) and quantitative uncertainty (on a per-pixel and daily basis versus no uncertainty information available). These characteristics are achieved because of several technical innovations employed in this study: (1) SLOPE couples machine learning models with MODIS atmosphere and land products to accurately estimate PAR. (2) SLOPE couples highly efficient and pragmatic gap-filling and filtering algorithms with surface reflectance acquired by both Terra and Aqua MODIS satellites to derive a soil-adjusted NIRV (SANIRV) dataset. (3) SLOPE couples a temporal pattern recognition approach with a long-term Cropland Data Layer (CDL) product to predict dynamic C4 crop fraction. Through developing a parsimonious model with only two slope parameters, the proposed SLOPE product explains 85 % of the spatial and temporal variations in GPP acquired from 49 AmeriFlux eddy-covariance sites (324 site years), with a root-mean-square error (RMSE) of 1.63 gC m−2 d−1. The median R2 over C3 and C4 crop sites reaches 0.87 and 0.94, respectively, indicating great potentials for monitoring crops, in particular bioenergy crops, at the field level. With such a satisfactory performance and its distinct characteristics in spatiotemporal resolution and instantaneity, the proposed SLOPE GPP product is promising for biological and environmental research, carbon cycle research, and a broad range of real-time applications at the regional scale. The archived dataset is available at https://doi.org/10.3334/ORNLDAAC/1786 (download page: https://daac.ornl.gov/daacdata/cms/SLOPE_GPP_CONUS/data/, last access: 20 January 2021) (Jiang and Guan, 2020), and the real-time dataset is available upon request.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Welding Defect Classification from Simulated Ultrasonic Signals

Nondestructive testing is widely used to detect and to size up discontinuities embedded in a material. Among the several ultrasonic techniques, time of flight diffraction (TOFD) combines high speed inspection, high sizing reliability and low rate of incorrect results. However, the classification of defects through ultrasound signals acquired by the TOFD technique depends heavily on the knowledge and experience of the operator and thus, this classification is still frequently questioned. Besides, this task requires long processing time due to the large amount of data to be analyzed. Nevertheless, computational tools for pattern recognition can be employed to analyze a high amount of data with large efficiency. In the present work, simulation of ultrasound propagation in two-dimensional media containing, each one, different kinds of modeled discontinuities which mimic defects in welded joints were performed. Clustering (k-means) and classification (principal component analysis and k-nearest neighbors) algorithms were employed to associate each simulated ultrasound signal with its corresponding modeled defects. The results for each method were analyzed, discussed and compared. The results are very promising.

42 ENGINEERING↗