US5987459A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Image and document management system for content-based retrieval
Assignee: University of Minnesota System
•
Filing: 1997-03-14
•
Granted: 1999-11-16
•
Expires: 2017-03-14
Abstract
Abstract A computerized image and document management system for tent-based retrieval integrating content-based retrieval support directly into the compressed files. The system minimizes a weighted sum of the expected size of the compressed files and the expected query response time. Object searching of documents stored by the system is possible on a scalable resolution basis. The system includes a novel object representation based on embedded prototypes that provides for high-quality browsing of retrieval images at low bit rates.
Inventors
- 👤 Mitchell D. Swanson
- 👤 Ahmed H. Tewfik
- 👤 Srinath Hosur
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 16:20
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/50; G06F16/58; G06F16/583; G06F16/5854; G06F16/51; G06F16/5838; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99936; Y10S707/99939
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
75 words
A computerized method for storing data in an electronically stored file for later retrieval, the method comprising the steps of: extracting a plurality of query objects from at least one input file; coding a set of codewords in a particular order, each codeword corresponding to a query object and having a particular length; determining instances of each query object within the at least one input file; and, compressing non-query object data within each input file.
Claim 2
Dependent Claim
75 words
A computerized method for storing data in an electronically stored file for later retrieval, the method comprising the steps of: extracting a plurality of query objects from at least one input file; coding a set of codewords in a particular order, each codeword corresponding to a query object and having a particular length; determining instances of each query object within the at least one input file; and, compressing non-query object data within each input file.
Claim 3
Dependent Claim
34 words
The computerized method of claim 1, wherein the particular length of each codeword and the particular order of the set of codewords are optimized to minimize an expected length of the electronically stored file.
Claim 4
Dependent Claim
37 words
The computerized method of claim 1, wherein the particular length of each codeword and the particular order of the set of codewords are optimized to minimize an expected query response time in searching the electronically stored file.
Claim 5
Dependent Claim
47 words
The computerized method of claim 1, wherein the particular length of each codeword and the particular order of the set of codewords are optimized both to minimize an expected length of the electronically stored file and an expected query response time in searching the electronically stored file.
Claim 6
Dependent Claim
18 words
The computerized method of claim 1, wherein each codeword corresponds to a multiresolution representation of each query object.
Claim 7
Dependent Claim
27 words
The computerized method of claim 1, wherein each codeword has a particular length n, and is unique compared to the first n characters of every other codeword.
Claim 8
Dependent Claim
67 words
A computerized method for decoding an electronically stored file having a file header of concatenated codewords corresponding to query objects, data denoting a plurality of instances of the objects within the file, and non-query object data, the method comprising the steps of: decoding the query objects from the concatenated codewords; and, inserting each query object within the non-query object data at each instance of the query object.
Claim 9
Dependent Claim
67 words
A computerized method for decoding an electronically stored file having a file header of concatenated codewords corresponding to query objects, data denoting a plurality of instances of the objects within the file, and non-query object data, the method comprising the steps of: decoding the query objects from the concatenated codewords; and, inserting each query object within the non-query object data at each instance of the query object.
Claim 10
Dependent Claim
24 words
The computerized method of claim 7, wherein the non-query object data is compressed, and further comprising the step of decompressing the non-query object data.
Claim 11
Dependent Claim
107 words
A computerized method for browsing an electronically stored file having a file header of concatenated codewords corresponding to multiresolution representations of query objects, data denoting a plurality of instances of the objects within the file, and non-query object data, the method comprising the steps of: decoding at least one query object from the concatenated codewords at a particular resolution; matching each query object of the at least one query object to a corresponding prototype object for the particular resolution; and, inserting the corresponding prototype object for the particular resolution of each query object of the at least one query object at each instance of the query object.
Claim 12
Dependent Claim
107 words
A computerized method for browsing an electronically stored file having a file header of concatenated codewords corresponding to multiresolution representations of query objects, data denoting a plurality of instances of the objects within the file, and non-query object data, the method comprising the steps of: decoding at least one query object from the concatenated codewords at a particular resolution; matching each query object of the at least one query object to a corresponding prototype object for the particular resolution; and, inserting the corresponding prototype object for the particular resolution of each query object of the at least one query object at each instance of the query object.
Claim 13
Dependent Claim
41 words
A data structure for electronically storing a file comprising: a file header of concatenated codewords, each codeword corresponding to a query object; a set of indices denoting a plurality of instances of the objects within the file; and, non-query object data.
Claim 14
Dependent Claim
41 words
A data structure for electronically storing a file comprising: a file header of concatenated codewords, each codeword corresponding to a query object; a set of indices denoting a plurality of instances of the objects within the file; and, non-query object data.
Claim 15
Dependent Claim
13 words
The data structure of claim 10, wherein the non-query object data is compressed.
Claim 16
Dependent Claim
18 words
The data structure of claim 10, wherein each codeword corresponds to a multiresolution representation of each query object.
Claim 17
Dependent Claim
107 words
A computerized method for storing at least one image in an electronically stored file for later retrieval, the method comprising the steps of: blocking each image into a plurality of blocks smaller than the image; defining one or more objects of the image using a segmentation algorithm; associating each object with a number of the blocks to form a superblock corresponding to the object; applying a wavelet transform to each superblock to generate query objects; coding a set of codewords in a particular order, each codeword corresponding to a query object and having a particular length; and, determining the instances of each query object within each image.
Claim 18
Dependent Claim
107 words
A computerized method for storing at least one image in an electronically stored file for later retrieval, the method comprising the steps of: blocking each image into a plurality of blocks smaller than the image; defining one or more objects of the image using a segmentation algorithm; associating each object with a number of the blocks to form a superblock corresponding to the object; applying a wavelet transform to each superblock to generate query objects; coding a set of codewords in a particular order, each codeword corresponding to a query object and having a particular length; and, determining the instances of each query object within each image.
Claim 19
Dependent Claim
17 words
The computerized method of claim 13, further comprising the step of coding non-superblocked regions of each image.
Claim 20
Dependent Claim
18 words
The computerized method of claim 13, wherein each codeword corresponds to a multiresolution representation of each query object.
Claim 21
Dependent Claim
19 words
The computerized method of claim 15, wherein the multiresolution representation of each query object includes a plurality of subbands.
Claim 22
Dependent Claim
22 words
The computerized method of claim 16, wherein the step of coding maps the plurality of subbands to finite dictionaries using vector quantization.
Claim 23
Dependent Claim
39 words
The computerized method of claim 15, further comprising the step of mapping one of a like subset of query objects at a particular resolution as a prototype object for the like subset of query objects at the particular resolution.
Claim 24
Dependent Claim
65 words
A computerized method for searching for a desired object within an electronically stored file of at least one image comprising the steps of: associating the desired object with a number of blocks to form a superblock corresponding to the object; applying a wavelet transform to the superblock to generate a query object; searching the electronically stored file for the query object on a resolution-by-resolution basis.
Claim 25
Dependent Claim
65 words
A computerized method for searching for a desired object within an electronically stored file of at least one image comprising the steps of: associating the desired object with a number of blocks to form a superblock corresponding to the object; applying a wavelet transform to the superblock to generate a query object; searching the electronically stored file for the query object on a resolution-by-resolution basis.
Claim 26
Dependent Claim
49 words
The computerized method of claim 19, wherein the step of searching comprises the steps of: searching each image for the query object at a first resolution; and, searching the images in which the query object was found at the first resolution for the query object at a second resolution.
Claim 27
Dependent Claim
38 words
The computerized method of claim 20, wherein the step of searching further comprises the step of searching the images in which the query object was found at the second resolution for the query object at a third resolution.
References Cited (Backward Citations)
US4495620A
Cited
US4969041A
Cited
US5010405A
Cited
US5325290A
Cited
US5060262A
Cited
US5465308A
Cited
US5315098A
Cited
US5386240A
Cited
US5579471A
Cited
US5379345A
Cited
EP0635798A1
Cited
US5461426A
Cited
US5515296A
Cited
JPH07160731A
Cited
EP0657831A1
Cited
US5465269A
Cited
US5450490A
Cited
US5473631A
Cited
US5710916A
Cited
US5710719A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-11-15 | 2003-05-17 | 2003-11-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-11-15 | 2007-05-17 | 2007-11-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-11-15 | 2011-05-17 | 2011-11-16 | $7700.00 | Window Closed / Lapsed |