Search NASASearch

Engineering topics

Johnson, Gordon G.

Publications and source records attributed to Johnson, Gordon G..

Hexagonal Pixels and Indexing Scheme for Binary Images

A scheme for resampling binaryimage data from a rectangular grid to a regular hexagonal grid and an associated tree-structured pixel-indexing scheme keyed to the level of resolution have been devised. This scheme could be utilized in conjunction with appropriate image-data-processing algorithms to enable automated retrieval and/or recognition of images. For some purposes, this scheme is superior to a prior scheme that relies on rectangular pixels: one example of such a purpose is recognition of fingerprints, which can be approximated more closely by use of line segments along hexagonal axes than by line segments along rectangular axes. This scheme could also be combined with algorithms for query-image-based retrieval of images via the Internet. A binary image on a rectangular grid is generated by raster scanning or by sampling on a stationary grid of rectangular pixels. In either case, each pixel (each cell in the rectangular grid) is denoted as either bright or dark, depending on whether the light level in the pixel is above or below a prescribed threshold. The binary data on such an image are stored in a matrix form that lends itself readily to searches of line segments aligned with either or both of the perpendicular coordinate axes. The first step in resampling onto a regular hexagonal grid is to make the resolution of the hexagonal grid fine enough to capture all the binaryimage detail from the rectangular grid. In practice, this amounts to choosing a hexagonal-cell width equal to or less than a third of the rectangular- cell width. Once the data have been resampled onto the hexagonal grid, the image can readily be checked for line segments aligned with the hexagonal coordinate axes, which typically lie at angles of 30deg, 90deg, and 150deg with respect to say, the horizontal rectangular coordinate axis. Optionally, one can then rotate the rectangular image by 90deg, then again sample onto the hexagonal grid and check for line segments at angles of 0deg, 60deg, and 120deg to the original horizontal coordinate axis. The net result is that one has checked for line segments at angular intervals of 30deg. For even finer angular resolution, one could, for example, then rotate the rectangular-grid image +/-45deg before sampling to perform checking for line segments at angular intervals of 15deg.

Johnson, Gordon G.

Mathematical Foundation for Plane Covering Using Hexagons

This work is to indicate the development and mathematical underpinnings of the algorithms previously developed for covering the plane and the addressing of the elements of the covering. The algorithms are of interest in that they provides a simple systematic way of increasing or decreasing resolution, in the sense that if we have the covering in place and there is an image superimposed upon the covering, then we may view the image in a rough form or in a very detailed form with minimal effort. Such ability allows for quick searches of crude forms to determine a class in which to make a detailed search. In addition, the addressing algorithms provide an efficient way to process large data sets that have related subsets. The algorithms produced were based in part upon the work of D. Lucas "A Multiplication in N Space" which suggested a set of three vectors, any two of which would serve as a bases for the plane and also that the hexagon is the natural geometric object to be used in a covering with a suggested bases. The second portion is a refinement of the eyeball vision system, the globular viewer.

Johnson, Gordon G.

Near surface analysis

This is a study to assist in the understanding of earth near surface structure. Higher order moments are used to detect the density distribution as well as to seek patterns found in geological structures. It is shown how higher order moments at points outside a mass structure are determined as well as how to recover the mass distribution from the higher order moments. It is interesting to note that the first moment at a point P outside the mass structure, V(sub O)(P), is the entire mass and the second moment, V(sub 1)(P), is the potential at P due to the mass structure. Usually only the mass and the potential function are used to determine the density distribution in a body. An infinite function sequence (V(sub n)(P))(sub n=0)(sup infinity) is required to uniquely determine the density distribution.

Johnson, Gordon G.

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

Dynamic pattern matcher using incomplete data

This invention relates generally to pattern matching systems, and more particularly to a method for dynamically adapting the system to enhance the effectiveness of a pattern match. Apparatus and methods for calculating the similarity between patterns are known. There is considerable interest, however, in the storage and retrieval of data, particularly, when the search is called or initiated by incomplete information. For many search algorithms, a query initiating a data search requires exact information, and the data file is searched for an exact match. Inability to find an exact match thus results in a failure of the system or method.

Johnson, Gordon G.

Some vision algorithms

The ability to determine the contents of a scene by a machine has obvious applications. There are reasons for seeking horizontal, vertical and diagonal line segments of varying lengths in order to interpret the content of a scene. Such line segments aid in determining edges that determine the boundaries of objects within the scene. Algorithms for each of the above as well as for data compacting are presented.

Johnson, Gordon G.

Solar prediction and intelligent machines

The solar prediction program is aimed at reducing or eliminating the need to throughly understand the process previously developed and to still be able to produce a prediction. Substantial progress was made in identifying the procedures to be coded as well as testing some of the presently coded work. Another project involves work on developing ideas and software that should result in a machine capable of learning as well as carrying on an intelligent conversation over a wide range of topics. The underlying idea is to use primitive ideas and construct higher order ideas from these, which can then be easily related one to another.

Johnson, Gordon G.