Search NASASearch

SEARCH · Search NASA

Results for “Pattern vision”

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 19 records

Spatial profiling of the interplay between cell type- and vision-dependent transcriptomic programs in the visual cortex

How early sensory experience during “critical periods” of postnatal life affects the organization of the mammalian neocortex at the resolution of neuronal cell types is poorly understood. We previously reported that the functional and molecular profiles of layer 2/3 (L2/3) cell types in the primary visual cortex (V1) are vision-dependent [S. Chenget al.,Cell185, 311–327.e24 (2022)]. Here, we characterize the spatial organization of L2/3 cell types with and without visual experience. Spatial transcriptomic profiling based on 500 genes recapitulates the zonation of L2/3 cell types along the pial–ventricular axis in V1. By applying multitasking theory, we suggest that the spatial zonation of L2/3 cell types is linked to the continuous nature of their gene expression profiles, which can be represented as a 2D manifold bounded by three archetypal cell types. By comparing normally reared and dark reared L2/3 cells, we show that visual deprivation-induced transcriptomic changes comprise two independent gene programs. The first, induced specifically in the visual cortex, includes immediate-early genes and genes associated with metabolic processes. It manifests as a change in cell state that is orthogonal to cell-type-specific gene expression programs. By contrast, the second program impacts L2/3 cell-type identity, regulating a subset of cell-type-specific genes and shifting the distribution of cells within the L2/3 cell-type manifold. Through an integrated analysis of spatial transcriptomics with single-nucleus RNA-seq data, we describe how vision patterns cortical L2/3 cell types during the critical period.

Science & Technology - Other Topics

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

Electroacoustical imaging technique for encoding incoherent radiance fields as Gabor elementary signals

A technique is presented for directly encoding incoherent radiance fields as Gabor elementary signals. This technique uses an electro-acoustic sensor to modulate the electronic charges induced by the incident radiance field with the electric fields generated by Gaussian modulated sinusoidal acoustic waves. The resultant signal carries the amplitude and phase information required for localizing spatial frequencies of the radiance field. These localized spatial frequency representations provide a link between the either geometric or Fourier transform representations currently used in computer vision and pattern recognition.

Fales, C. L.

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.

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.

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.

What does the eye see best?

The quantum efficiency of the human eye is measured for detecting a wide variety of spatiotemporal patterns using foveal vision in bright light. The performance of an ideal visual detector whose weighting function is matched to the signal is analyzed in the abstract, and the conditions of a two-interval forced-choice experiment are described. The best stimulus found is a small, briefly exposed circular patch of sinusoidal grating having a spatial frequency of about 7 c/deg, drifting at about 4 Hz. It is proposed that this is the weighting function of the most efficient human contrast detector. This function resembles the receptive field sensitivity profiles of many cortical neurons. The detectors resemble those derived from other recent experiments on both detection and discrimination and may account for a broad range of previous psychophysical results.

Watson, A. B.

Data compression in digitized lines

The problem of data compression is very important in digital photogrammetry, computer assisted cartography, and GIS/LIS. In addition, it is also applicable in many other fields such as computer vision, image processing, pattern recognition, and artificial intelligence. Consequently, there are many algorithms available to solve this problem but none of them are considered to be satisfactory. In this paper, a new method of finding critical points in a digitized curve is explained. This technique, based on the normalized symmetric scattered matrix, is good for both critical points detection and data compression. In addition, the critical points detected by this algorithm are compared with those by zero-crossings.

Thapa, Khagendra

Advancing 3D surface imaging: single-axis structured light illumination plenoptic camera with machine learning integration

Structured light illumination (SLI) is a configurable 3D surface imaging modality that can function largely independently of surface texture. At the same time, machine learning (ML) approaches are providing new ways to capture relevant information from SLI patterns, avoiding the need to develop advanced computer vision algorithms. By projecting an optical pattern onto a surface and measuring the apparent distortion of that pattern, one can determine surface topography from a single image. Common realizations of SLI 3D imaging use off-axis SLI to allow for parallax-based determination of depth; however, in constrained geometries, the ability to make single-axis measurements can be of major benefit. While plenoptic imaging (PI) cameras have long been developed for the purpose of single-axis 3D imaging, they are generally reliant on the surface texture of the measured object, thus making them unreliable in certain experimental conditions. Therefore, we present a single-axis 3D SLI plenoptic camera, which combines the single-axis benefits of PI technology while using coaxial SLI to maintain indifference to surface conditions. We also present a study of the camera capabilities paired with the development of several algorithms, including traditional feature tracking methods as well as ML methods, which are found to enhance resolution and range. We report depth sensitivity down to 0.2% $\frac{dz}{z_0}$. The single-axis SLI 3D plenoptic camera demonstrates potential applicability for in-situ topographical measurements under a wide range of conditions including, but not limited to, objects without trackable surface texture, high temperatures, and constrained geometry environments.

Imaging systems

Mars Rover imaging systems and directional filtering

Computer literature searches were carried out at Duke University and NASA Langley Research Center. The purpose is to enhance personal knowledge based on the technical problems of pattern recognition and image understanding which must be solved for the Mars Rover and Sample Return Mission. Intensive study effort of a large collection of relevant literature resulted in a compilation of all important documents in one place. Furthermore, the documents are being classified into: Mars Rover; computer vision (theory); imaging systems; pattern recognition methodologies; and other smart techniques (AI, neural networks, fuzzy logic, etc).

Wang, Paul P.

RU-net for automatic characterization of TRISO fuel cross sections

During irradiation, phenomena such as kernel swelling and buffer densification may impact the performance of tristructural isotropic (TRISO) particle fuel. Post-irradiation microscopy is often used to identify these irradiation-induced morphologic changes. However, each fuel compact generally contains thousands of TRISO particles. Manually performing the work to get statistical information on these phenomena is cumbersome and subjective. Here, to reduce the subjectivity inherent in that process and to accelerate data analysis, we used convolutional neural networks (CNNs) to automatically segment cross-sectional images of microscopic TRISO layers. CNNs are a class of machine-learning algorithms specifically designed for processing structured grid data. They have gained popularity in recent years due to their remarkable performance in various computer vision tasks, including image classification, object detection, and image segmentation. In this research, we generated a large irradiated TRISO layer dataset with more than 2,000 microscopic images of cross-sectional TRISO particles and the corresponding annotated images. Based on these annotated images, we used different CNNs to automatically segment different TRISO layers. These CNNs include RU-Net (developed in this study), as well as three existing architectures: U-Net, Residual Network (ResNet), and Attention U-Net. The preliminary results show that the model based on RU-Net performs best in terms of Intersection over Union (IoU). Using CNN models, we can expedite the analysis of TRISO particle cross sections, significantly reducing the manual labor involved and improving the objectivity of the segmentation results.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS

Block segmentation in feature space for realtime object detection in high granularity images

Computer vision has applications in object detection, image recognition and classification, and object tracking. One of the challenges of computer vision is the presence of useful information at multiple distance scales. Filtering techniques may sacrifice details at small scales in order to prioritize the analysis of large-scale features of the image. We present a strategy for coarse-graining multidimensional data while maintaining fine-grained detail for subsequent analysis. The algorithm is based on fixed-size block segmentation in the feature space. We apply this strategy to solve the long-standing challenge of detecting particle trajectories at the Large Hadron Collider in real time.

Computer vision

Optical processing for range and attitude determination

A rugged, miniaturized, optical cross-correlator that recognizes a single object is particularly suitable for performing a single-vision function, such as pattern recognition for semi-autonomous navigation, landing, and docking of vehicles to a pre-designated landing mark. The optical cross-correlator, with a video input from a simple imaging system and the output of the optical correlation plane processed using the standard star tracker software, produces sufficient information for a spacecraft's terminal homing navigation system to complete a docking maneuver.

Scholl, M. S.

PopGNN: Graph Neural Network-Based Flexible Future Population Forecasting Model

Accurate population forecasts is important to plan critical infrastructure and services, from housing and education to healthcare and transport. However, traditional population prediction studies have only employed traditional machine learning models limited to capture complex spatial interdependencies and patterns. Althogh recently computer vision-based framework was introduced with with promising accuracy, it has critical limitations for real-world planning applications: it function only at fixed spatial resolutions, restricting their use in diverse boundaries such as census tracts, neighborhoods, or administrative zones. Therefore, this study suggests a Graph Neural Network (GNN)-based population prediction framework, called PopGNN. This model recorded remarkable performance compared with state-of-the-art models and traditional baseline models in the grid and administrative boundaries. Furthermore, our framework achieved comparable predictive accuracy to a computer vision-based model in both the South Korea and Tennessee case studies. Consequently, this study is valuable in that a single model can provide accurate population forecasts that address diverse planning demands, ranging from granular grid-level estimates for precise service allocation and facility location planning to aggregate administrative-level forecasts for macro-scale regional policy and resource distribution.

97 MATHEMATICS AND COMPUTING

An overview of computer vision

An overview of computer vision is provided. Image understanding and scene analysis are emphasized, and pertinent aspects of pattern recognition are treated. The basic approach to computer vision systems, the techniques utilized, applications, the current existing systems and state-of-the-art issues and research requirements, who is doing it and who is funding it, and future trends and expectations are reviewed.

Gevarter, W. B.

Image-plane processing of visual information

Shannon's theory of information is used to optimize the optical design of sensor-array imaging systems which use neighborhood image-plane signal processing for enhancing edges and compressing dynamic range during image formation. The resultant edge-enhancement, or band-pass-filter, response is found to be very similar to that of human vision. Comparisons of traits in human vision with results from information theory suggest that: (1) Image-plane processing, like preprocessing in human vision, can improve visual information acquisition for pattern recognition when resolving power, sensitivity, and dynamic range are constrained. Improvements include reduced sensitivity to changes in lighter levels, reduced signal dynamic range, reduced data transmission and processing, and reduced aliasing and photosensor noise degradation. (2) Information content can be an appropriate figure of merit for optimizing the optical design of imaging systems when visual information is acquired for pattern recognition. The design trade-offs involve spatial response, sensitivity, and sampling interval.

Huck, F. O.

Multiscale vector fields for image pattern recognition

A uniform processing framework for low-level vision computing in which a bank of spatial filters maps the image intensity structure at each pixel into an abstract feature space is proposed. Some properties of the filters and the feature space are described. Local orientation is measured by a vector sum in the feature space as follows: each filter's preferred orientation along with the strength of the filter's output determine the orientation and the length of a vector in the feature space; the vectors for all filters are summed to yield a resultant vector for a particular pixel and scale. The orientation of the resultant vector indicates the local orientation, and the magnitude of the vector indicates the strength of the local orientation preference. Limitations of the vector sum method are discussed. Investigations show that the processing framework provides a useful, redundant representation of image structure across orientation and scale.

Low, Kah-Chan

NASA in the 21st century: A vision of greatness

Notions of greatness are discussed that have guided NASA in the past, values are presented that might be delivered by NASA in the future, and the the skills required for NASA to execute a vision of greatness are examined. Three possible patterns of space development by NASA are reviewed: (1) a mission to protect the ecology of the Earth; (2) the engineering of the technologies critical to space transportation and a healthy, productive life in space; and (3) the management of a major nonterrestrial resource project. Potential sources of funds are discussed along with opportunities for sustainable collaboration, and the life cycle of NASA's funding responsibility for its space development program.

Murphy, Kathleen J.