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,027 records · Page 57

Fast Feature-Recognizing Optoelectronic System

Proposed optoelectronic system recognizes features or classifies images by processing outputs of photosensors rapidly, in parallel, through circuits developed in research on neural networks. Array of photoconductive elements serve as photomodulated connections in electronic neural network, which provides high speed data compression to generate feature vector. System able to "learn" new patterns for subsequent recognition. Potential applications in robotic vision systems and pattern recognition.

Thakoor, S.↗

Performance of heavy-flavour jet identification in Lorentz-boosted topologies in proton-proton collisions at √(s) = 13 TeV

Measurements in the highly Lorentz-boosted regime provoke increased interest in probing the Higgs boson properties and in searching for particles beyond the standard model at the LHC. In the CMS Collaboration, various boosted-object tagging algorithms, designed to identify hadronic jets originating from a massive particle decaying to bb̅ or cc̅, have been developed and deployed across a range of physics analyses. This paper highlights their performance on simulated events, and summarizes novel calibration techniques using proton-proton collision data collected at √(s) = 13 TeV during the 2016–2018 LHC data-taking period. Three dedicated methods are used for the calibration in multijet events, leveraging either machine learning techniques, the presence of muons within energetic boosted jets, or the reconstruction of hadronically decaying high-energy Z bosons. The calibration results, obtained through a combination of these approaches, are presented and discussed.

Pattern recognition↗

Energy calibration of germanium detectors for the Majorana Demonstrator

The Majorana Demonstrator was a search for neutrinoless double-beta decay (0νββ) in the 76 Ge isotope. It was staged at the 4850-foot level of the Sanford Underground Research Facility (SURF) in Lead, SD. The experiment consisted of 58 germanium detectors housed in a low background shield and was calibrated once per week by deploying a 228 Th line source for 1 to 2 hours. The energy scale calibration determination for the detector array was automated using custom analysis tools. We describe the offline procedure for calibration of the Demonstrator germanium detectors, including the simultaneous fitting of multiple spectral peaks, estimation of energy scale uncertainties, and the automation of the calibration procedure.

47 OTHER INSTRUMENTATION↗

Neural networks: Alternatives to conventional techniques for automatic docking

Automatic docking of orbiting spacecraft is a crucial operation involving the identification of vehicle orientation as well as complex approach dynamics. The chaser spacecraft must be able to recognize the target spacecraft within a scene and achieve accurate closing maneuvers. In a video-based system, a target scene must be captured and transformed into a pattern of pixels. Successful recognition lies in the interpretation of this pattern. Due to their powerful pattern recognition capabilities, artificial neural networks offer a potential role in interpretation and automatic docking processes. Neural networks can reduce the computational time required by existing image processing and control software. In addition, neural networks are capable of recognizing and adapting to changes in their dynamic environment, enabling enhanced performance, redundancy, and fault tolerance. Most neural networks are robust to failure, capable of continued operation with a slight degradation in performance after minor failures. This paper discusses the particular automatic docking tasks neural networks can perform as viable alternatives to conventional techniques.

Vinz, Bradley L.↗

Insect taste receptors relevant to host identification by recognition of secondary metabolite patterns of non-host plants

Highlights: • Three putative bitter gustatory receptor of silkworm respond to several secondary metabolites in non-host plants. • Secondary metabolites responsive to the gustatory receptor are representative feeding-deterrents in non-host plants. • One feeding-deterrent gustatory receptor respond to multiple feeding deterrents. • Feeding deterrent receptors are expressed in silkworm mouthparts. • Representative secondary metabolite of a non-host plant, coumarin exactly had a suppressive effect on food intake of silkworm. The taste sensing system is crucial for food recognition in insects and other animals. It is commonly believed that insect gustatory receptors (Grs) expressed in gustatory organs are indispensable for host plant selection. Many behavioral studies have shown that mono- or oligo-phagous lepidopteran insects use the balance between feeding attractants and feeding deterrents in host plants and that these are sensed by taste organs for host plant recognition. However, the molecular mechanism underlying taste recognition, especially of feeding deterrents, remains to be elucidated. To better understand this mechanism, we studied orphan Grs, including Bombyx mori Gr (BmGr) 16, BmGr18, and BmGr53, from the mono-phagous insect, Bombyx mori. Using Calcium imaging in mammalian cells, we first confirmed in lepidoptera insects that three of the putative bitter Grs widely responded to structurally different feeding deterrents. Although the phylogenetic distance of these Grs was considerable, they responded to partially overlapping deterrents of plant secondary metabolites. These findings suggest that not only these three Grs but also most of the Grs that have been assigned to putative bitter Grs are feeding-deterrent receptors that play a role in host plant recognition.

60 APPLIED LIFE SCIENCES↗

An Organic Model for Detecting Cyber Events

Cyber entities in many ways mimic the behavior of organic systems. Individuals or groups compete for limited resources using a variety of strategies and effective strategies are re-used and refined in later ‘generations’. Traditionally this drift has made detection of malicious entities very difficult because 1) recognition systems are often built on exact matching to a pattern that can only be ‘learned’ after a malicious entity reveals itself and 2) the enormous volume and variation in benign entities is an overwhelming source of previously unseen entities that often confound detectors. To turn the tables of complexity on the would-be attackers, we have developed a method for mapping the sequence of behaviors in which cyber entities engage to strings of text and analyze these strings using modified bioinformatics algorithms. Bioinformatics algorithms optimize the alignment between text strings even in the presence of mismatches, insertions or deletions and do not require an a priori definition of the patterns one is seeking. Nor does it require any type of exact matching. This allows the data itself to suggest meaningful patterns that are conserved between cyber entities. We demonstrate this method on data generated from network traffic. The impact of this approach is that it can rapidly calculate similarity measures of previously unseen cyber entities in terms of well-characterized entities. These measures may also be used to organize large collections of data into families, making it possible to identify motifs indicative of each family.

97 MATHEMATICS AND COMPUTING↗

Recognizing Patterns In Log-Polar Coordinates

Log-Hough transform is basis of improved method for recognition of patterns - particularly, straight lines - in noisy images. Takes advantage of rotational and scale invariance of mapping from Cartesian to log-polar coordinates, and offers economy of representation and computation. Unification of iconic and Hough domains simplifies computations in recognition and eliminates erroneous quantization of slopes attributable to finite spacing of Cartesian coordinate grid of classical Hough transform. Equally efficient recognizing curves. Log-Hough transform more amenable to massively parallel computing architectures than traditional Cartesian Hough transform. "In-place" nature makes it possible to apply local pixel-neighborhood processing.

Weiman, Carl F. R.↗

Studying the Sky/Planets Can Drown You in Images: Machine Learning Solutions at JPL/Caltech

JPL is working to develop a domain-independent system capable of small-scale object recognition in large image databases for science analysis. Two applications discussed are the cataloging of three billion sky objects in the Sky Image Cataloging and Analysis Tool (SKICAT) and the detection of possibly one million small volcanoes visible in the Magellan synthetic aperture radar images of Venus (JPL Adaptive Recognition Tool, JARTool).

geomorphology↗

Creative-Dynamics Approach To Neural Intelligence

Paper discusses approach to mathematical modeling of artificial neural networks exhibiting complicated behaviors reminiscent of creativity and intelligence of biological neural networks. Neural network treated as non-Lipschitzian dynamical system - as described in "Non-Lipschitzian Dynamics For Modeling Neural Networks" (NPO-17814). System serves as tool for modeling of temporal-pattern memories and recognition of complicated spatial patterns.

Zak, Michail A.↗

Assessing the Dynamics and Complexity of Disease Pathogenicity Using 4-Dimensional Immunological Data

Investigating disease pathogenesis and personalized prognostics are major biomedical needs. Because patients sharing the same diagnosis can experience different outcomes, such as survival or death, physicians need new personalized tools, including those that rapidly differentiate several inflammatory phases. To address these topics, a pattern recognition-based method (PRM) that follows an inverse problem approach was designed to assess, in <10 min, eight concepts: synergy , pleiotropy , complexity , dynamics , ambiguity , circularity , personalized outcomes , and explanatory prognostics (pathogenesis). By creating thousands of secondary combinations derived from blood leukocyte data, the PRM measures synergic, pleiotropic, complex and dynamic data interactions, which provide personalized prognostics while some undesirable features—such as false results and the ambiguity associated with data circularity-are prevented. Here, this method is compared to Principal Component Analysis (PCA) and evaluated with data collected from hantavirus-infected humans and birds that appeared to be healthy. When human data were examined, the PRM predicted 96.9 % of all surviving patients while PCA did not distinguish outcomes. Demonstrating applications in personalized prognosis, eight PRM data structures sufficed to identify all but one of the survivors. Dynamic data patterns also distinguished survivors from non-survivors, as well as one subset of non-survivors, which exhibited chronic inflammation. When the PRM explored avian data, it differentiated immune profiles consistent with no, early, or late inflammation. Yet, PCA did not recognize patterns in avian data. Findings support the notion that immune responses, while variable, are rather deterministic: a low number of complex and dynamic data combinations may be enough to, rapidly, unmask conditions that are neither directly observable nor reliably forecasted.

60 APPLIED LIFE SCIENCES↗

Patterns and plasticity in RNA-protein interactions enable recruitment of multiple proteins through a single site

mRNA control hinges on the specificity and affinity of proteins for their RNA binding sites. Regulatory proteins must bind their own sites and reject even closely related noncognate sites. In the PUF [Pumilio and fem-3 binding factor (FBF)] family of RNA binding proteins, individual proteins discriminate differences in the length and sequence of binding sites, allowing each PUF to bind a distinct battery of mRNAs. Here, we show that despite these differences, the pattern of RNA interactions is conserved among PUF proteins: the two ends of the PUF protein make critical contacts with the two ends of the RNA sites. Despite this conserved 'two-handed' pattern of recognition, the RNA sequence is flexible. Among the binding sites of yeast Puf4p, RNA sequence dictates the pattern in which RNA bases are flipped away from the binding surface of the protein. Small differences in RNA sequence allow new modes of control, recruiting Puf5p in addition to Puf4p to a single site. This embedded information adds a new layer of biological meaning to the connections between RNA targets and PUF proteins.

59 BASIC BIOLOGICAL SCIENCES↗

Orthogonal Patterns In A Binary Neural Network

Report presents some recent developments in theory of binary neural networks. Subject matter relevant to associate (content-addressable) memories and to recognition of patterns - both of considerable importance in advancement of robotics and artificial intelligence. When probed by any pattern, network converges to one of stored patterns.

Baram, Yoram↗

Speech variability effects on recognition accuracy associated with concurrent task performance by pilots

In the present study of the responses of pairs of pilots to aircraft warning classification tasks using an isolated word, speaker-dependent speech recognition system, the induced stress was manipulated by means of different scoring procedures for the classification task and by the inclusion of a competitive manual control task. Both speech patterns and recognition accuracy were analyzed, and recognition errors were recorded by type for an isolated word speaker-dependent system and by an offline technique for a connected word speaker-dependent system. While errors increased with task loading for the isolated word system, there was no such effect for task loading in the case of the connected word system.

Simpson, C. A.↗

Improving image segmentation by learning region affinities

We utilize the context information of other regions in hierarchical image segmentation to learn new regions affinities. It is well known that a single choice of quantization of an image space is highly unlikely to be a common optimal quantization level for all categories. Each level of quantization has its own benefits. Therefore, we utilize the hierarchical information among different quantizations as well as spatial proximity of their regions. The proposed affinity learning takes into account higher order relations among image regions, both local and long range relations, making it robust to instabilities and errors of the original, pairwise region affinities. Once the learnt affinities are obtained, we use a standard image segmentation algorithm to get the final segmentation. Moreover, the learnt affinities can be naturally unutilized in interactive segmentation. Experimental results on Berkeley Segmentation Dataset and MSRC Object Recognition Dataset are comparable and in some aspects better than the state-of-art methods.

47 OTHER INSTRUMENTATION↗

The three-dimensional structure and recognition mechanism of Manduca sexta peptidoglycan recognition protein-1

Peptidoglycan recognition proteins (PGRPs) recognize bacteria through their unique cell wall constituent, peptidoglycans (PGs). PGRPs are conserved from insects to mammals and all function in antibacterial defense. In the tobacco hornworm Manduca sexta, PGRP1 and microbe binding protein (MBP) interact with PGs and hemolymph protease-14 precursor (proHP14) to yield active HP14. HP14 triggers a serine protease network that produces active phenoloxidase (PO), Spätzle, and other cytokines to stimulate immune responses. PGRP1 binds preferentially to diaminopimelic acid (DAP)-PGs of Gram-negative bacteria and Gram-positive Bacillus and Clostridium species than Lys-PGs of other Gram-positive bacteria. In this study, we synthesized DAP- and Lys-muramyl pentapeptide (MPP) and monitored their associations with M. sexta PGRP1 by surface plasmon resonance. The K d values (0.57 μM for DAP-MPP and 45.6 μM for Lys-MPP) agree with the differential recognition of DAP- and Lys-PGs. To reveal its structural basis, we produced the PGRP1 in insect cells and determined its structure at a resolution of 2.1 Å. The protein adopts a fold similar to those from other PGRPs with a classical L-shaped PG-binding groove. A unique loop lining the shallow groove suggests a different ligand-binding mechanism. In summary, this study provided new insights into the PG recognition by PGRPs, a critical first step that initiates the serine protease cascade.

59 BASIC BIOLOGICAL SCIENCES↗