Search method in a hierarchical object structure

Data processing: artificial intelligence – Neural network – Structure

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C706S050000

Reexamination Certificate

active

06882991

ABSTRACT:
The invention relates to a method of searching a predetermined number of objects which are closest to an example, in a hierarchical object structure which is obtained by using a hierarchical object classification method.The proposed method consists of going through the hierarchical structure starting from the root, descending as far as the first node closest to the searched example of which a number of leaves lower than the number of lacking results depend, and then going back up to the brother node of this node which is closest to the searched example, so as to add other results and so on and so forth until said predetermined number is arrived at. Application: MPEG-7 descriptions.

REFERENCES:
patent: 5832182 (1998-11-01), Zhang et al.
patent: WO9923578 (1998-10-01), None
Khaled Alsabti et al, “An Efficeint K-Means Clustering Algorithm”, IPPS/SPDP Workshop on High Performance Data Mining, 1998, Orlando FL.
S. Pramanik et al; “An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in the Dimensions”, Proceedings of ICMCS99: IEEE Multimedia Systems '99: International Conference on Multimedia Comuting and Systems, Florence, Italy, Jun. 7-11, 1999, pp. 865-869, vol. 1, XP002174907.

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

Search method in a hierarchical object structure does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Search method in a hierarchical object structure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search method in a hierarchical object structure will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3441601

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