Fast and efficient search method for graphical data
US5159647A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Mar 4, 1991 |
| Grant date | Oct 27, 1992 |
| Priority date | — |
| Expiry date | Mar 4, 2011 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06V30/2504
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
By processing the highest-resolution graphical data (e.g., image data) pertaining to relevant-objects defined by the graphical data into abstracted multiple-attribute information that is stored in a group of nodes of the lowest level of a hierarchy of data arrays (e.g., the leaf nodes of a complete data tree file), the present invention processes the data of each of these hierarchy of data arrays backward toward a single node of the highest level of the hierarchy of data arrays (e.g., the root node of a complete data tree file), to derive an attribute vector of all the abstracted multiple-attribute information at this single node. The derived attribute vector is then used to guide a search down the hierarchy of data arrays from the single node of its highest level toward at least a selected one of the group of nodes of its lowest level (which, by way of example, may correspond to the location of a likely relevant object). In this manner, a search made over a relatively large spatial domain for a relatively small relevant object can be converted into a search for the relevant object as described in the attribute domain of the hierarchy of data arrays, where such means as direct inde…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.