Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer 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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Experimental modeling of jet-ring turbine disk cooling

The experimental facility and some early results are described from a current research program modeling turbine disk cooling with multiple impinging jets, such as employed on the Space Shuttle Main Engine oxygen turbopump. The study is designed to obtain detailed local convection heat transfer rates on specially constructed turbine disk models that employ either multiple cooling jet impingement near the disk outer radius from a jet ring, or alternatively, single entrance coolant supply into the center of the disk cavity. Jet impingement is an effective scheme for cooling of turbine disks at or near the blade attachment region, but the heat transfer mechanisms and merits relative to other schemes are not well understood. The present study employs two specially constructed full scale plastic model disks, contoured and plane, together with the corresponding stators. Local heat transfer rates are determined by a computer vision system from the response of thin liquid crystal coatings applied to the disk test faces. The present results indicate that multiple jet impingement directed at the blade attachment region results in higher cooling rates in that region than does the same flow supplied to the disk center, but this conclusion must be regarded as tentative.

Metzger, D. E.↗
NASA NTRS1990

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 NTRS1991

Structural stereopsis - Potential for automatic stereo camera calibration

The paper describes the use of extended edge features as a source of primitives for structural stereopsis and considers the design of a system for autonomous camera calibration. It is shown that the structural approach permits greater use of spatial relational constraints, eliminating the coarse-to-fine tracking of point-based algorithms. Experimental results concerning matching and calibration on real images using Laplacian-of-Gaussian contour fragments as primitives in structural stereopsis are presented, and results in graph-theoretic representation and inexact matches, analytical photogrammetry, and other computer vision and image analysis problem domains are examined. Such a system might be used in aerial photogrammetry and cartography, and robotic vision systems; however, the system is still very much under development.

Boyer, Kim L.↗
NASA NTRS1992

Self-organization via active exploration in robotic applications

We describe a neural network based robotic system. Unlike traditional robotic systems, our approach focussed on non-stationary problems. We indicate that self-organization capability is necessary for any system to operate successfully in a non-stationary environment. We suggest that self-organization should be based on an active exploration process. We investigated neural architectures having novelty sensitivity, selective attention, reinforcement learning, habit formation, flexible criteria categorization properties and analyzed the resulting behavior (consisting of an intelligent initiation of exploration) by computer simulations. While various computer vision researchers acknowledged recently the importance of active processes (Swain and Stricker, 1991), the proposed approaches within the new framework still suffer from a lack of self-organization (Aloimonos and Bandyopadhyay, 1987; Bajcsy, 1988). A self-organizing, neural network based robot (MAVIN) has been recently proposed (Baloch and Waxman, 1991). This robot has the capability of position, size rotation invariant pattern categorization, recognition and pavlovian conditioning. Our robot does not have initially invariant processing properties. The reason for this is the emphasis we put on active exploration. We maintain the point of view that such invariant properties emerge from an internalization of exploratory sensory-motor activity. Rather than coding the equilibria of such mental capabilities, we are seeking to capture its dynamics to understand on the one hand how the emergence of such invariances is possible and on the other hand the dynamics that lead to these invariances. The second point is crucial for an adaptive robot to acquire new invariances in non-stationary environments, as demonstrated by the inverting glass experiments of Helmholtz. We will introduce Pavlovian conditioning circuits in our future work for the precise objective of achieving the generation, coordination, and internalization of sequence of actions.

Ogmen, H.↗
NASA NTRS1992

Comparison of central axis and jet ring coolant supply for turbine disk cooling on a SSME-HPOTP model

The test facility, test methods and results are presented for an experimental study modeling the cooling of turbine disks in the blade attachment regions with multiple impinging jets, in a configuration simulating the disk cooling method employed on the Space Shuttle Main Engine oxygen turbopump. The study's objective was to provide a comparison of detailed local convection heat transfer rates obtained for a single center-supply of disk coolant with those obtained with the present flight configuration where disk coolant is supplied through an array of 19 jets located near the disk outer radius. Specially constructed disk models were used in a program designed to evaluate possible benefits and identify any possible detrimental effects involved in employing an alternate disk cooling scheme. The study involved the design, construction and testing of two full scale rotating model disks, one plane and smooth for baseline testing and the second contoured to the present flight configuration, together with the corresponding plane and contoured stator disks. Local heat transfer rates are determined from the color display of encapsulated liquid crystals coated on the disk in conjunction with use of a computer vision system. The test program was composed of a wide variety of disk speeds, flowrates, and geometrical configurations, including testing for the effects of disk boltheads and gas ingestion from the gas path region radially outboard of the disk-cavity.

Kim, Y. W.↗
NASA NTRS1993

Adjustable Bracket For Entry Of Welding Wire

Wire-entry bracket on welding torch in robotic welding system provides for adjustment of angle of entry of welding wire over range of plus or minus 30 degrees from nominal entry angle. Wire positioned so it does not hide weld joint in view of through-the-torch computer-vision system part of robot-controlling and -monitoring system. Swiveling bracket also used on nonvision torch on which wire-feed-through tube interferes with workpiece. Angle simply changed to one giving sufficient clearance.

Gilbert, Jeffrey L.↗
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.↗
NASA NTRS1991

Lunar crane system

In many lunar construction scenarios, mechanical cranes in some form will be indispensible in moving large masses around with various degrees of fine positioning. While thorough experience exists in the use of terrestrial cranes new thinking is required about the design of cranes to be used in extraterrestrial construction. The primary driving force for this new thinking is the need to automate the crane system so that space cranes can be operated as telerobotic machines with a large number of automatic capabilities. This is true because in extraterrestrial construction human resources will need to be critically rationed. The design problems of mechanisms and control systems for a lunar crane must deal with at least two areas of performance. First, the automated crane must be capable of maneuvering a large mass, so that when the mass arrives at the target position there are only small vibrations. Secondly, any residue vibrations must be automatically damped out and a fine positioning must be achieved. For extraterrestrial use there are additional challenges to a crane design - for example, to design a crane system so that it can be transformed for other construction uses. This initial project in crane design does not address such additional issues, although they may be the subject of future CSC research. To date the Center has designed and analyzed many mechanisms. The fundamental problem of trade-offs between passively stabilizing the load and actively controlling the load by actuators was extensively studied. The capability of 3D dynamics modeling now exists for such studies. A scaled model of a lunar crane was set up and it has been most fruitful in providing basic understanding of lunar cranes. Due to an interesting scaling match-up, this scaled model exhibits the load vibration frequencies one would expect in the real lunar case. Using the analytical results achieved to date, a laboratory crane system is now being developed as a test bed for verifying a wide variety of mechanisms and control designs. Future development will be aimed at making the crane system a telerobotic test bed into which external sensors such as computer vision systems, and other small robotic devices such as CSC lunar rovers, will be integrated.

Mikulas, Martin M., Jr.↗
NASA NTRS1992

The fusion of information via fuzzy integration

Multisensor fusion is becoming increasingly important in intelligent computer vision systems. In this paper we present the generalized fuzzy integral with respect to an S-decomposable measure as a tool for fusing information from multiple sensors in an object recognition problem. Results from an experiment with automatic target recognition imagery are provided.

Keller, James M.↗
NASA NTRS1991

Energy functions for regularization algorithms

Regularization techniques are widely used for inverse problem solving in computer vision such as surface reconstruction, edge detection, or optical flow estimation. Energy functions used for regularization algorithms measure how smooth a curve or surface is, and to render acceptable solutions these energies must verify certain properties such as invariance with Euclidean transformations or invariance with parameterization. The notion of smoothness energy is extended here to the notion of a differential stabilizer, and it is shown that to void the systematic underestimation of undercurvature for planar curve fitting, it is necessary that circles be the curves of maximum smoothness. A set of stabilizers is proposed that meet this condition as well as invariance with rotation and parameterization.

Delingette, H.↗
NASA NTRS1990

Integrated topology and shape optimization in structural design

Structural optimization procedures usually start from a given design topology and vary its proportions or boundary shapes to achieve optimality under various constraints. Two different categories of structural optimization are distinguished in the literature, namely sizing and shape optimization. A major restriction in both cases is that the design topology is considered fixed and given. Questions concerning the general layout of a design (such as whether a truss or a solid structure should be used) as well as more detailed topology features (e.g., the number and connectivities of bars in a truss or the number of holes in a solid) have to be resolved by design experience before formulating the structural optimization model. Design quality of an optimized structure still depends strongly on engineering intuition. This article presents a novel approach for initiating formal structural optimization at an earlier stage, where the design topology is rigorously generated in addition to selecting shape and size dimensions. A three-phase design process is discussed: an optimal initial topology is created by a homogenization method as a gray level image, which is then transformed to a realizable design using computer vision techniques; this design is then parameterized and treated in detail by sizing and shape optimization. A fully automated process is described for trusses. Optimization of two dimensional solid structures is also discussed. Several application-oriented examples illustrate the usefulness of the proposed methodology.

Bremicker, M.↗
NASA NTRS1993

Enhanced image capture through fusion

Image fusion may be used to combine images from different sensors, such as IR and visible cameras, to obtain a single composite with extended information content. Fusion may also be used to combine multiple images from a given sensor to form a composite image in which information of interest is enhanced. We present a general method for performing image fusion and show that this method is effective for diverse fusion applications. We suggest that fusion may provide a powerful tool for enhanced image capture with broad utility in image processing and computer vision.

Burt, Peter J.↗
NASA NTRS1993

Multiple-camera/motion stereoscopy for range estimation in helicopter flight

Aiding the pilot to improve safety and reduce pilot workload by detecting obstacles and planning obstacle-free flight paths during low-altitude helicopter flight is desirable. Computer vision techniques provide an attractive method of obstacle detection and range estimation for objects within a large field of view ahead of the helicopter. Previous research has had considerable success by using an image sequence from a single moving camera to solving this problem. The major limitations of single camera approaches are that no range information can be obtained near the instantaneous direction of motion or in the absence of motion. These limitations can be overcome through the use of multiple cameras. This paper presents a hybrid motion/stereo algorithm which allows range refinement through recursive range estimation while avoiding loss of range information in the direction of travel. A feature-based approach is used to track objects between image frames. An extended Kalman filter combines knowledge of the camera motion and measurements of a feature's image location to recursively estimate the feature's range and to predict its location in future images. Performance of the algorithm will be illustrated using an image sequence, motion information, and independent range measurements from a low-altitude helicopter flight experiment.

Smith, Phillip N.↗
NASA NTRS1994

Feature isolation and quantification of evolving datasets

Identifying and isolating features is an important part of visualization and a crucial step for the analysis and understanding of large time-dependent data sets (either from observation or simulation). In this proposal, we address these concerns, namely the investigation and implementation of basic 2D and 3D feature based methods to enhance current visualization techniques and provide the building blocks for automatic feature recognition, tracking, and correlation. These methods incorporate ideas from scientific visualization, computer vision, image processing, and mathematical morphology. Our focus is in the area of fluid dynamics, and we show the applicability of these methods to the quantification and tracking of three-dimensional vortex and turbulence bursts.

Source record↗
NASA NTRS1994

Unsupervised texture image segmentation by improved neural network ART2

We here propose a segmentation algorithm of texture image for a computer vision system on a space robot. An improved adaptive resonance theory (ART2) for analog input patterns is adapted to classify the image based on a set of texture image features extracted by a fast spatial gray level dependence method (SGLDM). The nonlinear thresholding functions in input layer of the neural network have been constructed by two parts: firstly, to reduce the effects of image noises on the features, a set of sigmoid functions is chosen depending on the types of the feature; secondly, to enhance the contrast of the features, we adopt fuzzy mapping functions. The cluster number in output layer can be increased by an autogrowing mechanism constantly when a new pattern happens. Experimental results and original or segmented pictures are shown, including the comparison between this approach and K-means algorithm. The system written in C language is performed on a SUN-4/330 sparc-station with an image board IT-150 and a CCD camera.

Wang, Zhiling↗
NASA NTRS1994

Truncated Gaussians as tolerance sets

This work focuses on the use of truncated Gaussian distributions as models for bounded data measurements that are constrained to appear between fixed limits. The authors prove that the truncated Gaussian can be viewed as a maximum entropy distribution for truncated bounded data, when mean and covariance are given. The characteristic function for the truncated Gaussian is presented; from this, algorithms are derived for calculation of mean, variance, summation, application of Bayes rule and filtering with truncated Gaussians. As an example of the power of their methods, a derivation of the disparity constraint (used in computer vision) from their models is described. The authors' approach complements results in Statistics, but their proposal is not only to use the truncated Gaussian as a model for selected data; they propose to model measurements as fundamentally in terms of truncated Gaussians.

Cozman, Fabio↗
NASA NTRS1995

Machine learning for a Toolkit for Image Mining

A prototype user environment is described that enables a user with very limited computer skills to collaborate with a computer algorithm to develop search tools (agents) that can be used for image analysis, creating metadata for tagging images, searching for images in an image database on the basis of image content, or as a component of computer vision algorithms. Agents are learned in an ongoing, two-way dialogue between the user and the algorithm. The user points to mistakes made in classification. The algorithm, in response, attempts to discover which image attributes are discriminating between objects of interest and clutter. It then builds a candidate agent and applies it to an input image, producing an 'interest' image highlighting features that are consistent with the set of objects and clutter indicated by the user. The dialogue repeats until the user is satisfied. The prototype environment, called the Toolkit for Image Mining (TIM) is currently capable of learning spectral and textural patterns. Learning exhibits rapid convergence to reasonable levels of performance and, when thoroughly trained, Fo appears to be competitive in discrimination accuracy with other classification techniques.

Delanoy, Richard L.↗