Exhaustive hierarchical near neighbor operations on an image

Image analysis – Histogram processing – For setting a threshold

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

382 37, 382 55, G06K 900

Patent

active

053053958

ABSTRACT:
Near neighbor data is produced hierarchically for each pixel of an image. Each pixel's near neighbor data indicates the presence of an approximate near neighbor pixel in each of four quadrants with respect to the pixel, and can also indicate distance and orientation to the near neighbor pixel. The near neighbor data can be produced by parallel processing units, with each processing unit producing, for a respective pixel, a near neighbor data item at every level of the hierarchy. Each near neighbor data item can indicate the presence of an approximate near neighbor in a respective region of the image. A near neighbor data item for a higher level region can be produced by selecting between near neighbor pixels indicated by near neighbor data items for subregions at the next lower level, by choosing the near neighbor pixel that is nearer. The quadrants can be asymmetric so that each pixel is not included in any of its four quadrants and so that the quadrants do not overlap. To provide accurate near neighbor data for a black pixel, the near neighbor data can be shifted to the black pixel from the adjacent pixels, each at the origin of one of its quadrants. Offsets in the near neighbor data can also be adjusted accordingly. Each processing unit can store a bit vector such that the bit vectors together indicate the paths between neighbor pixels and owner pixels, to facilitate subsequent communication between owners and neighbors. Each bit of the bit vector can indicate, for each level of the hierarchy, which of the processing unit's children is on the path at the next lower level. A path defined in this manner can be followed to shift focus from a current focus pixel to one of its near neighbors.

REFERENCES:
patent: 2838602 (1958-06-01), Sprick
patent: 2983822 (1961-05-01), Brouillette, Jr.
patent: 3297989 (1967-01-01), Atchley et al.
patent: 3339179 (1967-08-01), Shelton, Jr. et al.
patent: 3605093 (1971-09-01), Parks et al.
patent: 4208652 (1980-06-01), Marshall
patent: 4371865 (1983-02-01), Moulton
patent: 4799270 (1989-01-01), Kim et al.
patent: 4802230 (1989-01-01), Horowitz
patent: 5022091 (1991-06-01), Carlson
patent: 5054094 (1991-10-01), Barski
patent: 5193125 (1993-03-01), Mahoney
Borgefors, G., "Distance Transformations in Digital Images", Computer Vision Graphics and Imaging Processing, vol. 34, (1986), pp. 344-371.
Ahuja, N., and Schachter, B. J., Pattern Models, John Wiley and Sons, New York, 1983, Chapter 1, pp. 1-73.
Mahoney, J. V., Image Chunking: Defining Spatial Building Blocks for Scene Analysis, Dep't. of Elec. Eng. and Comp. Sci., M.I.T., 1987, ("the Mahoney thesis"), pp. 31-37.
Mahoney, J. V., "Exhaustive Directional Neighbor Linking and its Role in Image Analysis", Canadian Psychology/Psychologie Canadienne, May 1989, vol. 30, No. 2a, p. 440, Abstract.
Koch, C., and Ullman, S., "Selecting One Among the Many: A Simple Network Implementing Shifts in Selective Visual Attention", MIT Artificial Intelligence Laboratory, A.I. Memo 770, Jan. 1984, pp. 1-18.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Exhaustive hierarchical near neighbor operations on an image does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Exhaustive hierarchical near neighbor operations on an image, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exhaustive hierarchical near neighbor operations on an image will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-26654

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.