Search NASA⌕ Search

SEARCH · Search NASA

Results for “Pattern recognition”

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 1,009 records · Page 56

Forward Drift Chambers for the GlueX experiment

The GlueX experiment will search for exotic mesons produced by 9 GeV linearly polarized photon beam from the 12 GeV CEBAF machine. A hermetic solenoid-based detector system that includes tracking and calorimetry has been constructed. The Forward Drift Chamber (FDC) system consists of 24 circular planar drift chambers of 1 m diameter. Additional information from cathode strips, placed at both sides of the wire planes, is required to achieve efficient pattern recognition in the presence of high background rates in forward direction, resulting in 12,500 readout channels in total. The detection of relatively low energy photons by the electro-magnetic calorimeters imposes severe constraints on the amount of the material used in the FDC. Challenges in the production of this low-mass detector will be discussed. The FDC has been completed and recently installed in the bore of the solenoid magnet. Results from the tests of the whole detector system will be presented.

Pentchev, Lubomir↗

Forward Drift Chamber for the GlueX experiment

The GlueX experiment will search for exotic mesons produced by 9 GeV linearly polarized photon beam from the 12 GeV CEBAF machine. A hermetic solenoid-based detector system that includes tracking and calorimetry is in the final construction phase. The Forward Drift Chamber consists of 24 circular planar drift chambers of 1 m diameter. Additional cathode strip information is required to achieve efficient pattern recognition in forward direction, resulting in 12,000 readout channels in total. Description and results from the tests of the completed detector will be presented. Challenges related to the specific features of the detector will be discussed. A small modification of the standard geometry allowed us to study the possibility for PID by cluster counting and investigate some gas properties based on single electron detection.

Pentchev, Lubomir↗

Forward Drift Chamber for the GlueX experiment

The GlueX experiment will search for exotic mesons produced by 9 GeV linearly polarized photon beams from the 12GeV CEBAF machine. Hermetic solenoid-based detector system that includes tracking and calorimetry is in the final construction phase. The Forward Drift Chamber consists of 24 circular planar drift chambers of $1~m$ diameter. Additional cathode strip information is required to achieve efficient pattern recognition in forward direction, resulting in 12,000 readout channels in total. Description and results from the tests of the completed detector will be presented. Challenges related to the specific features of the detector will be discussed.

Pentchev, Lubomir↗

Optimisation of the Search for CP-symmetry Violation at the Deep Underground Neutrino Experiment

The Deep Underground Neutrino Experiment (DUNE) is a next-generation long baseline experiment, which will be situated in South Dakota. Its detectors will utilise liquid-argon time projection chamber technology, which is able to capture neutrino interactions with an incredible spatial and calorimetric resolution. With what will become the world’s most intense neutrino beam, a highly capable near detector, and four (10kt fducial mass) far detector modules, DUNE will be able to achieve an ambitious physics programme. Most notably, DUNE will determine whether charge-parity symmetry is broken in neutrino oscillations - a finding that would have significant implications for the understanding of the matter-antimatter asymmetry in our Universe.This thesis presents the optimisation of a CP-violation analysis at DUNE using thePandora pattern-recognition software. The analysis assumes a 3.5 year exposure (1.36 × 1023 protons on target) to a neutrino and an antineutrino beam (7 year total). Only the predicted data of the far detector modules is used; near detector samples are not included. The initial sensitivity to CP-violation is found to be 3.8σ+0.9σ−1.1σ in an estimate that includes oscillation parameter uncertainties, systematic uncertainties and statistical fluctuations, and assumes a normal-ordering of the neutrino mass hierarchy. The performance of the Pandora event reconstruction is linked to that of the analysis, which is found to be limited by the reconstruction of the initial track-like region of electrons and photons. The ShowerRefinement algorithm is developed in response to this and its implementation into the analysis workflow results in an improved sensitivity to CP-violation of 4.6σ+0.9σ−1.0σ. With a perfected neutrino interaction vertex placement, this is further increased to 5.1σ+1.0σ−1.1σ.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Status of DUNE Offline Computing

We summarize the status of Deep Underground Neutrino Experiment (DUNE) Offline Software and Computing program. We describe plans for the computing infrastructure needed to acquire, catalog, reconstruct, simulate and analyze the data from the DUNE experiment and its prototypes in pursuit of the experiment's physics goals of precision measurements of neutrino oscillation parameters, detection of astrophysical neutrinos, measurement of neutrino interaction properties and searches for physics beyond the Standard Model. In contrast to traditional HEP computational problems, DUNE's Liquid Argon Time Projection Chamber data consist of simple but very large (many GB) data objects which share many characteristics with astrophysical images. We have successfully reconstructed and simulated data from 4% prototype detector runs at CERN. The data volume from the full DUNE detector, when it starts commissioning late in this decade will present memory management challenges in conventional processing but significant opportunities to use advances in machine learning and pattern recognition as a frontier user of High Performance Computing facilities capable of massively parallel processing. Our goal is to develop infrastructure resources that are flexible and accessible enough to support creative software solutions as HEP computing evolves.

43 PARTICLE ACCELERATORS↗

Generalizing mkFit and its Application to HL-LHC

mkFit is an implementation of the Kalman filter-based track reconstruction algorithm that exploits both thread- and data-level parallelism. In the past few years the project transitioned from the R&D phase to deployment in the Run-3 offline workflow of the CMS experiment. The CMS tracking performs a series of iterations, targeting reconstruction of tracks of increasing difficulty after removing hits associated to tracks found in previous iterations. mkFit has been adopted for several of the tracking iterations, which contribute to the majority of reconstructed tracks. When tested in the standard conditions for production jobs, speedups in track pattern recognition are on average of the order of 3.5x for the iterations where it is used (3-7x depending on the iteration). Multiple factors contribute to the observed speedups, including vectorization and a lightweight geometry description, as well as improved memory management and single precision. Efficient vectorization is achieved with both the icc and the gcc (default in CMSSW) compilers and relies on a dedicated library for small matrix operations, Matriplex, which has recently been released in a public repository. While the mkFit geometry description already featured levels of abstraction from the actual Phase-1 CMS tracker, several components of the implementations were still tied to that specific geometry. We have further generalized the geometry description and the configuration of the run-time parameters, in order to enable support for the Phase-2 upgraded tracker geometry for the HL-LHC and potentially other detector configurations. The implementation strategy and high-level code changes required for the HL-LHC geometry are presented. Speedups in track building from mkFit imply that track fitting becomes a comparably time consuming step of the tracking chain.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Artificial Neural Network Representation of Dynamic Criticality Excursion Experiment Data

This paper outlines time dependent considerations in applying the artificial neural network (ANN) paradigm to dynamic nuclear criticality excursion experiment data. The ANN amongst a variety of uses, can apply to function fitting of multiple input-multiple output data sets, pattern recognition, cluster analysis, and time series prediction. The ANN is a component of Machine Learning (ML) data analysis. The practical application of ML to criticality safety has been funded through the Y-12 Plant Directed Research and Demonstration (PDRD) program to support criticality safety and emergency planning efforts. The initial effort considered function fitting of criticality excursion data. Recent efforts successfully extended the ANN to criticality safety code validation. The initial ANN work applied to criticality excursions centered around multivariate function fitting of static (tabular) data taken from the French Consequences Radiologiques d'un Accident de Criticite (CRAC) and SILENE reactor campaigns. The former report (LeCorche) summarized important tabular data for the first 44 CRAC experiments. The initial ANN was trained to specific time-independent inputs, then applied to predict peak fission rate and total fissions for a wide variety of fissile solutions process conditions. This work extends that effort to apply the ANN paradigm to dynamic prediction of time-dependent criticality excursion experiment data. A dynamic criticality excursion in fissile solution represents a complex multiphysics phenomenon. Factors include among other things, coupled neutronic, multiphase fluid flow, temperature, pressure, acoustic shock, boiling heat transfer, reactivity feedback, and radiolytic gas considerations. There have been many efforts to model (over time) as coupled ordinary and (space) as partial differential equations (ODE, PDE). The ANN representation noted here does not rely on solving explicit ODE or PDEs. Rather the intent is to demonstrate that as a time series, the criticality excursion can be predicted by training specific ANN architectures to experimental input and output time series exclusively. The rationale for extending this work to the time-dependent regime is important in developing a 'criticality excursion emulator' solely on the basis of learning characteristics from experiment dynamic data. An emulator is different than a computer code simulator driven by the solution of ODEs and PDEs given select 'tuning parameters' that match outputs to experiments. A criticality excursion emulator, derived exclusively from an ANN or ML, could predict most likely excursion characteristics, trained from historic dynamic experiment data, presented with input values within the range of those experiments. The work noted shows that generic time-series ANN architectures can be satisfactorily applied to the prediction of dynamic, extremely chaotic criticality excursion power given an initial time dependent input series. In reality, an excursion emulator could be driven by user-supplied initial (t=0), time independent or constant values to generate time dependent outputs. Thus ongoing work includes developing a custom ANN such that initial dynamic conditions would be predicted. Those results then serve as inputs to a customized ANN architecture currently in development. (author)

42 ENGINEERING↗

A new track finding algorithm based on a multi-dimensional extension of the Hough Transform

We introduce a new pattern recognition algorithm for track finding in High Energy Physics Experiments based on an extension of the Hough Transform to multiple dimensions. A remarkable property of this algorithm is that the execution time is simply proportional to the total number of the hits to be processed, making it particularly attractive for high occupancy situations. The algorithm needs to be trained using a sufficiently large set of simulated tracks. The same track finding algorithm can be used for very different detector geometries and only the set of simulated tracks used for training needs to be changed. The particular structure of the algorithm also lends itself naturally to parallel hardware implementations which, combined with its intrinsic flexibility, should provide a most powerful tool for triggering at future colliders.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Recognition of a Mononucleosomal Histone Modification Pattern by BPTF via Multivalent Interactions

Little is known about how combinations of histone marks are interpreted at the level of nucleosomes. The second PHD finger of human BPTF is known to specifically recognize histone H3 when methylated on lysine 4 (H3K4me2/3). Here, we examine how additional heterotypic modifications influence BPTF binding. Using peptide surrogates, three acetyllysine ligands are indentified for a PHD-adjacent bromodomain in BPTF via systematic screening and biophysical characterization. Although the bromodomain displays limited discrimination among the three possible acetyllysines at the peptide level, marked selectivity is observed for only one of these sites, H4K16ac, in combination with H3K4me3 at the mononucleosome level. In support, these two histone marks constitute a unique trans-histone modification pattern that unambiguously resides within a single nucleosomal unit in human cells, and this module colocalizes with these marks in the genome. Together, our data call attention to nucleosomal patterning of covalent marks in dictating critical chromatin associations.

59 BASIC BIOLOGICAL SCIENCES↗

Optical recognition of statistical patterns

Optical implementation of the Fukunaga-Koontz transform (FKT) and the Least-Squares Linear Mapping Technique (LSLMT) is described. The FKT is a linear transformation which performs image feature extraction for a two-class image classification problem. The LSLMT performs a transform from large dimensional feature space to small dimensional decision space for separating multiple image classes by maximizing the interclass differences while minimizing the intraclass variations. The FKT and the LSLMT were optically implemented by utilizing a coded phase optical processor. The transform was used for classifying birds and fish. After the F-K basis functions were calculated, those most useful for classification were incorporated into a computer generated hologram. The output of the optical processor, consisting of the squared magnitude of the F-K coefficients, was detected by a T.V. camera, digitized, and fed into a micro-computer for classification. A simple linear classifier based on only two F-K coefficients was able to separate the images into two classes, indicating that the F-K transform had chosen good features. Two advantages of optically implementing the FKT and LSLMT are parallel and real time processing.

Lee, S. H.↗

Investigation of Error Patterns in Geographical Databases

The objective of the research conducted in this project is to develop a methodology to investigate the accuracy of Airport Safety Modeling Data (ASMD) using statistical, visualization, and Artificial Neural Network (ANN) techniques. Such a methodology can contribute to answering the following research questions: Over a representative sampling of ASMD databases, can statistical error analysis techniques be accurately learned and replicated by ANN modeling techniques? This representative ASMD sample should include numerous airports and a variety of terrain characterizations. Is it possible to identify and automate the recognition of patterns of error related to geographical features? Do such patterns of error relate to specific geographical features, such as elevation or terrain slope? Is it possible to combine the errors in small regions into an error prediction for a larger region? What are the data density reduction implications of this work? ASMD may be used as the source of terrain data for a synthetic visual system to be used in the cockpit of aircraft when visual reference to ground features is not possible during conditions of marginal weather or reduced visibility. In this research, United States Geologic Survey (USGS) digital elevation model (DEM) data has been selected as the benchmark. Artificial Neural Networks (ANNS) have been used and tested as alternate methods in place of the statistical methods in similar problems. They often perform better in pattern recognition, prediction and classification and categorization problems. Many studies show that when the data is complex and noisy, the accuracy of ANN models is generally higher than those of comparable traditional methods.

Dryer, David↗

Face recognition system and method using face pattern words and face pattern bytes

The present invention provides a novel system and method for identifying individuals and for face recognition utilizing facial features for face identification. The system and method of the invention comprise creating facial features or face patterns called face pattern words and face pattern bytes for face identification. The invention also provides for pattern recognitions for identification other than face recognition. The invention further provides a means for identifying individuals based on visible and/or thermal images of those individuals by utilizing computer software implemented by instructions on a computer or computer system and a computer readable medium containing instructions on a computer system for face recognition and identification.

97 MATHEMATICS AND COMPUTING↗

Self-Amplified Optical Pattern Recognizer

Self-amplified optical pattern recognizers developed for use in recognition of patterns, in optical computing, and in optoelectronic neural networks. In recognizer, photorefractive crystal serves as medium in which one holographically records diffraction-grating filter representing pattern with which recognition sought. Apparatus "self-amplified" because signal amplified within filter to many orders of magnitude greater than in prior optical pattern recognizers. Basic principle of operation applicable to many types of correlation filters, including (but not limited to) Vander Lugt matched filters, joint-transform filters, and phase-only filters.

Liu, Hua-Kuang↗

Spatiotemporal pattern detection, generation, and computation with circuits

Abstract Implementations of neurons, delays, and synapse circuits are presented with simulations. These neural elements are used to create two small spiking neural networks, the Rate-Window and Order-Biased clusters, which are capable of detecting simple two-spike spatiotemporal patterns. A simple pattern detecting network (SPDN) is created by combining the Rate-Window and Order-Biased clusters, where clusters are small spiking neural networks, and its simple pattern detection ability is demonstrated in simulation. The SPDN is used to implement a complex pattern detecting network (CPDN) and its complex pattern detection ability is demonstrated in simulation. Methods for generating arbitrary spatiotemporal patterns are presented. The CPDN and spatiotemporal pattern generation methods are then used to implement a novel spatiotemporal computing paradigm based on detecting and responding to spatiotemporal symbols. A simulation of a spatiotemporal half adder is presented to demonstrate the computing paradigm.

97 - MATHEMATICS AND COMPUTING↗