Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Matched”

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 217 records · Page 12

Report of subpanel on inter-image matching

Research needs in the area inter-image matching for remote Earth observation systems are defined. Correlation considerations include types of correlation algorithms, preprocessing techniques, limits on subpixed accuracy, relief and atmospheric refraction effects, evaluation of success rate, and evaluation of accuracy. Also recommended are investigations of the interaction of inter-image matching procedures and selection of ground control points for a given sensor; global multisensor control point library feasibility; multiple control point considerations; centralized processing systems; and user systems.

Source record↗

Pressures, forces, moments and shock shapes for a geometrically matched sphere-cone and hyperboloid at Mach 20.3 in helium

An investigation was conducted to compare measured and predicted pressure distributions, forces and moments, and shock shapes on a geometrically matched sphere-cone and hyperboloid. A hyperboloid with a nose radius of 0.5276 in. and an asymptotic angle of 39.9871 deg was matched to a sphere-cone with a nose radius of 0.750 in. and a cone half-angle of 45 deg. Experimental results in helium at a free-stream Mach number of 20.3 and a free-stream unit Reynolds number of 6.83 x 10 to the 6th power per foot were combined with predicted results from a theoretical method to compare the two shapes. Comparisons of experimental results showed small differences in the two shapes, but the prediction method provided better results for the hyperboloid than for the sphere-cone.

Calloway, R. L.↗

A two-stage cross correlation approach to template matching

Two-stage template matching with sum of absolute differences as the similarity measure has been developed by Vanderburg and Rosenfeld (1977). This correspondence shows the development of two-stage template matching with cross correlation as the similarity measure. The threshold value of the first-stage is derived analytically and its validity is verified experimentally. Considerable speed-up over the one-stage process can be obtained by introducing only a small false dismissal probability.

Goshtasby, A.↗

Phase-matching measurements for 10-microns upconversion in AgGaS2

Laboratory data from the upconversion of CO2 laser radiation using an AgGaS2 crystal pumped with a tunable dye laser are reported. Data were taken on the pump wavelength and bandwidth and the crystal acceptance angle for phase-matching. The results were compared with predictions made in terms of the upconversion conservation of energy and momentum and a model of the AgGaS2 refractive index. The trials were run with an annealed crystal apparently free of cracks, twins and optical scattering centers. The measurements indicated that more accurate refractrive-index data are required to be able to predict accurately the laser pump wavelength for phase-matching.

Itabe, T.↗

Asymptotic matching by the symbolic manipulator MACSYMA

The delegation of the labor of calculating higher-order terms in singular perturbation (SP) expansions to a computer by the use of MACSYMA is considered. The method of matched asymptotic expansions is studied in detail for two model SP problems: a model resembling the boundary layer equation with a small parameter multiplying the highest derivatives; and a turning-point problem. It is shown that MACSYMA has successfully performed the higher-order matching in both problems.

Lo, L. L.↗

A pattern-matching algorithm for two-dimensional coordinate lists

A pattern-matching algorithm for two-dimensional coordinate lists is described. The algorithm matches pairs of coordinates in two lists based on the triangles that can be formed from triplets of points in each list. The algorithm is insensitive to coordinate translation, rotation, magnification, or inversion and can tolerate random errors or distortions.

Groth, E. J.↗

Maximum dynamic responses using matched filter theory and random process theory

This paper describes and illustrates two ways of performing time-correlated gust-load calculations. The first is based on Matched Filter Theory; the second on Random Process Theory. The two yield theoretically identical results and both employ novel applications of the theories and unconventional interpretations of the intermediate and final results. Both approaches are computationally fast and are general enough to be applied to dynamic-response problems other than gust loads. A brief mathematical development and example calculations using both Matched Filter Theory and Random Process Theory are presented.

Pototzky, Anthony S.↗

Matching of dissimilar radar images using Marr-Hildreth zero crossings

Two alternatives to the classical method for finding corresponding points in opposite-side synthetic aperture radar imagery are presented. These new methods focus on matching the shapes of large-scale features in the images rather than on correlating high-frequency pixel gray values. One of the methods may be of use in matching radar images to optical images. The large-scale features are extracted using the Marr-Hildreth operator.

Mcconnell, Ross M.↗

Experience with the matched filtered weighted-shift-and-add method

It is presently demonstrated that while the matched filter formulated by Ribak (1986) for the extension of the weighted-shift-and-add (WSA) method successfully reduces photon statistics-dominated specklegrams, the iterative method originally proposed by Ribak does not converge in the case of photon-noisy specklegrams for objects having more than one maxima. Attention is accordingly given to methods for rendering the procedure more 'artificially intelligent'. An error matrix is defined that is useful in evaluating the validity of the results produced by the matched filter extension of the WSA method.

Hege, E. Keith↗

Using AGNESS (A Generalized Network-based Expert System Shell) for matching images

The image correspondence problem is considered the most difficult step in both stereo and motion analysis. Stereo vision is useful in determining the 3-D positions of points on visible surface in a scene. Motion analysis is useful in determining the spatial and temporal relationships of objects in an environment. Besides stereo and motion analysis, there is the image correspondence problem. Most of this work is based on point or local area properties of the observed gray level values in 2-D images. A global and general approach to this problem is described by using a knowledge-based system. The knowledge it uses consists of both physical properties and spatial relationships of the edges and regions extracted from the given images. The physical component depends on features of the edge or region) in isolation. The spatial component involves the set of edges and regions adjacent to a given edge (or region) of the first image and the set of edges and regions adjacent to each potentially matching edge (or region) of the second image; thus the spatial context of each edge or region is considered. A computational network is used to represent this knowledge, it allows the computation of the likelihood of matching two edges or regions with logical and heuristic operators. An expert system shell called AGNESS (A Generalized Network-based Expert System Shell) is used to build a prototype system.

Pong, Ting-Chuen↗

Time-correlated gust loads using Matched-Filter Theory and Random-Process Theory: A new way of looking at things

Two ways of performing time-correlated gust-load calculations are described and illustrated. The first is based on Matched Filter Theory; the second on Random Process Theory. Both approaches yield theoretically identical results and represent novel applications of the theories, are computationally fast, and may be applied to other dynamic-response problems. A theoretical development and example calculations using both Matched Filter Theory and Random Process Theory approaches are presented.

Pototzky, Anthony S.↗

Improved shape-signature and matching methods for model-based robotic vision

Researchers describe new techniques for curve matching and model-based object recognition, which are based on the notion of shape-signature. The signature which researchers use is an approximation of pointwise curvature. Described here is curve matching algorithm which generalizes a previous algorithm which was developed using this signature, allowing improvement and generalization of a previous model-based object recognition scheme. The results and the experiments described relate to 2-D images. However, natural extensions to the 3-D case exist and are being developed.

Schwartz, J. T.↗

Shape matching utilizing indexed hypotheses generation and testing

An indexing mechanism is developed as part of an overall scheme called SMITH (shape matching utilizing indexed hypothesis generation and testing) for two-dimensional model-based object recognition. The approach is based on a dynamic programming implementation of attributed string matching, is computationally efficient, and works effectively for both nonoccluded and occluded shapes. Another advantage of this technique is that models may be inserted or deleted with relatively little cost.

Mehrotra, Rajiv↗

Time-correlated gust loads using matched filter theory and random process theory - A new way of looking at things

This paper describes and illustrates two ways of performing time-correlated gust-load calculations. The first is based on Matched Filter Theory; the second on Random Process Theory. Both approaches yield theoretically identical results and represent novel applications of the theories, are computationally fast, and may be applied to other dynamic-response problems. A theoretical development and example calculations using both Matched Filter Theory and Random Process Theory approaches are presented.

Pototzky, Anthony S.↗

Local parallel models for integration of stereo matching constraints and intrinsic image combination

Parallel relaxation computations such as those of connectionist networks offer a useful model for constraint integration and intrinsic image combination in developing a general-purpose stereo matching algorithm. This paper describes such a stereo algorithm that incorporates hierarchical, surface-structure, and edge-appearance constraints that are redefined and integrated at the level of individual candidate matches. The algorithm produces a high percentage of correct decisions on a wide variety of stereo pairs. Its few errors arise when the correlation measures defined by the constraints are either weakened or ambiguous, as in the case of periodic patterns in the images. Two additional mechanisms are discussed for overcoming the remaining errors.

Stewart, Charles V.↗

Optimal guidance of aero-assisted transfer vehicles based on matched asymptotic expansions

This paper addresses a number of issues related to the matched asymptotic expansions analysis of skip trajectories, or any class of problems that give rise to inner layers that are not associated directly with satisfying boundary conditions. The procedure for matching inner and outer solutions, and using the composite solution to satisfy boundary conditions is rigorously followed in developing a complete algebraic solution to the problem of inclination change with minimum energy loss. Repeated solution of these algebraic equations along the trajectory, treating each current state as an initial state, constitute a feedback guidance algorithm.

Calise, A. J.↗

Dynamic compensatory pattern matching in a fuzzy rule-based control system

A dynamic compensatory matching procedure is suggested as a method to generate an aggregated measure for evaluating the appropriateness of rules for control systems. It is a dynamic weighted matching technique which takes into account incomplete information under real-time requirements. The initial weights of importance of variables are generated with a generalized neural network architecture and a gradient descent algorithm. An intuitive compensatory scheme based on correlations among input variables of training data is adopted so that the system is coherent to a noisy environment.

Sun, Chuen-Tsai↗

Flexible Weighting-And-Matching Scheme For Incomplete Data

Method for partial matching of data makes conventional electronic memory addressable via its contents. When implemented by suitable algorithm, method enables computer system containing memory to search memory for datum making exact or best approximate match to datum in query. Advantages are: requires neither long "learning" time nor "retraining" when additional data stored and attaches to each datum relative importance that can change with time without decreasing speed of retrieval. Responses include exact or approximate recollection, indications of ambiguity, avoidance, and even forgetfulness.

Wang, Lui↗