 |
|
|
|
|
|
 Title: |
US5734893:
Progressive content-based retrieval of image and video with adaptive and iterative refinement
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Li, Chung-Sheng; Ossining, NY
Turek, John Joseph Edward; South Nyack, NY
Castelli, Vittorio; White Plains, NY
Chen, Ming-Syan; Yorktown Heights, NY
|
| Assignee: |
IBM Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
1998-03-31
/ 1995-09-28
|
| Application Number: |
US1995000535500
|
| IPC Code: |
Advanced:
G06F 17/30;
Core:
more...
IPC-7:
G06F 17/30;
|
| ECLA Code: |
G06F17/30S4P4; G06F17/30M1; G06F17/30S4P8A;
|
| U.S. Class: |
Current:
707/004;
382/203;
707/005;
707/E17.02;
Original:
395/615;
395/604;
395/605;
382/203;
|
| Field of Search: |
395/605,604,10,602,615,603,611
382/201,203
|
| Government Interest: |
The United States Government has rights in this invention pursuant to Contract No. NASA/CAN NCC5-101 awarded by NASA.
|
| Priority Number: |
| 1995-09-28 |
US1995000535500 |
|
| Abstract: |
A method and apparatus for minimizing the time required to obtain results for a content based query in a data base. More specifically, with this invention, the data base is partitioned into a plurality of groups. Then, a schedule or sequence of groups is assigned to each of the operations of the query, where the schedule represents the order in which an operation of the query will be applied to the groups in the schedule. Each schedule is arranged so that each application of the operation operates on the group which will yield intermediate results that are closest to final results.
|
| Attorney, Agent or Firm: |
Cameron, Douglas ;
Dougherty, Anne Vachon ;
|
| Primary / Asst. Examiners: |
Black, Thomas G.; Robinson, Greta L.
|
| INPADOC Legal Status: |
Show legal status actions
|
| Family: |
None
|
First Claim:
Show all 23 claims |
Having thus described our invention, what we claim as new and desire to secure by Letters Patents is:
1. A method of processing a content based query in a database, said method comprising:
- partitioning said database into groups of data; and
- assigning a schedule to each operation of a plurality of operations of said query, said schedule representing an order of said groups upon which each said operation is applied, said order in said schedule being arranged so that by each application of each said operation according to said schedule, a group is chosen to minimize the difference between the current result and a final result which will yield intermediate results closest to said final result.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 43 U.S. patent(s) that reference this one
|
|
|
|
|
|
|
| Foreign References: |
None
|
| Other Abstract Info: |
DERABS G98-230177
DERG98-230177
|
| Other References: |
Bimbo et al., "Sequence Retrieval by Contents through Spatio Temporal Indexing", IEEE on CD-ROM, pp. 88-92, Aug. 24, 1993.
Hou et al., "Medical Image Retrieval by Spatial Features", IEEE on CD-ROM, pp. 1364-1369, Oct. 18, 1992.
Hirzalla et al., "A Multimedia Query User Interface", IEEE on CD-ROM, pp. 590-593, Sep. 5, 1995.
|
|
 Nominate this for the Gallery...
|
|
