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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

NASA NTRS1990

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↗

NASA NTRS1989

Image understanding and the man-machine interface II; Proceedings of the Meeting, Los Angeles, CA, Jan. 17, 18, 1989

Image understanding concepts and models, image understanding systems and applications, advanced digital processors and software tools, and advanced man-machine interfaces are among the topics discussed. Particular papers are presented on such topics as neural networks for computer vision, object-based segmentation and color recognition in multispectral images, the application of image algebra to image measurement and feature extraction, and the integration of modeling and graphics to create an infrared signal processing test bed.

Barrett, Eamon B.↗

NASA NTRS1990

Image recovery from edge primitives

A method for extracting edge primitives from Mach-band patterns is presented together with a method for recovering image representations of features outlined by the edge boundaries. The accuracy, stability, and resolution of these representations are assessed. Since these representations are most commonly used in characterizing targets, this method of low-level processing offers new opportunities for computer vision and high data-compressing coding. Two bandpass filters are considered, the spatially invariant Laplacian of Gaussian filter and spatially variant intensity-dependent spatial (IDS) summation. It is shown that the recovery from the IDS bandpass data is particularly advantageous in applications for which robustness to local and temporal variations in illumination is important. It is concluded that the edge primitives extracted from bandpassed images can be an efficient way to store, transmit, and represent images.

Alter-Gartenberg, Rachel↗

NASA NTRS1990

Evaluation of an elastic curve technique for finding the auroral oval from satellite images automatically

An automated algorithm for finding the inner boundary based on recently proposed computer vision technique is described. The algorithm is analogous to solving the equations of motion for an elastic curve, where the forces are provided by the image. The resulting equilibrium position of the elastic curve provides an automated method for finding the shape and location of the inner boundary of the auroral oval. Two methods for the evaluation of the automated algorithm, both based on the comparisons with manual measurements, are developed. The first method compares the areas within the automated and the manual boundaries. The second method measures the overlap between the interiors of the two boundaries. The expected variation between two sets of manual measurements is used to set an upper bound to the allowed discrepancy between the automated results and a single set of manual measurements. The algorithm, when tested with 71 satellite images, is found to perform best for those images without overlap between the aurora and the dayside hemisphere.

Samadani, Ramin↗

NASA NTRS1991

The flight telerobotic servicer and technology transfer

The Flight Telerobotic Servicer (FTS) project at the Goddard Space Flight Center is developing an advanced telerobotic system to assist in and reduce crew extravehicular activity (EVA) for Space Station Freedom (SSF). The FTS will provide a telerobotic capability in the early phases of the SSF program and will be employed for assembly, maintenance, and inspection applications. The current state of space technology and the general nature of the FTS tasks dictate that the FTS be designed with sophisticated teleoperational capabilities for its internal primary operating mode. However, technologies such as advanced computer vision and autonomous planning techniques would greatly enhance the FTS capabilities to perform autonomously in less structured work environments. Another objective of the FTS program is to accelerate technology transfer from research to U.S. industry.

Andary, James F.↗

NASA NTRS1989

Image wavelet decomposition and applications

The general problem of computer vision has been investigated for more that 20 years and is still one of the most challenging fields in artificial intelligence. Indeed, taking a look at the human visual system can give us an idea of the complexity of any solution to the problem of visual recognition. This general task can be decomposed into a whole hierarchy of problems ranging from pixel processing to high level segmentation and complex objects recognition. Contrasting an image at different representations provides useful information such as edges. An example of low level signal and image processing using the theory of wavelets is introduced which provides the basis for multiresolution representation. Like the human brain, we use a multiorientation process which detects features independently in different orientation sectors. So, images of the same orientation but of different resolutions are contrasted to gather information about an image. An interesting image representation using energy zero crossings is developed. This representation is shown to be experimentally complete and leads to some higher level applications such as edge and corner finding, which in turn provides two basic steps to image segmentation. The possibilities of feedback between different levels of processing are also discussed.

Treil, N.↗

NASA NTRS1991

A graph theoretic approach to scene matching

The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.

Ranganath, Heggere S.↗

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.↗