Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2008-04-01
2008-04-01
Breene, John (Department: 2162)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07353224
ABSTRACT:
Massive amounts of multimedia data are stored in databases supporting web pages and servers, including text, graphics, video and audio. Searching and finding matching multimedia images can be time and computationally intensive. A method for storing and retrieving image data includes computing a descriptor, such an a Fourier-Mellin Transform (FMT), corresponding to a multidimensional space indicative of each of the stored images and organizing each of the descriptors according to a set similarity metric. The set similarity metric is based on Locality-Sensitive Hashing (LSH), and orders descriptors near to other descriptors in the database. The set similarity metric employs set theory which allows distance between descriptors to be computed consistent with LSH. A target image for which a match is sought is then received, and a descriptor indicative of the target image is computed. The database is referenced, or mapped, to determine close matches in the database. Mapping includes selecting a candidate match descriptor from among the descriptors in the database and employing a distance metric derived from the similarity metric to determine if the candidate match descriptor is a match to the target descriptor.
REFERENCES:
patent: 6049797 (2000-04-01), Guha et al.
patent: 6598054 (2003-07-01), Schuetze et al.
patent: 6751343 (2004-06-01), Ferrell et al.
patent: 6754667 (2004-06-01), Kim et al.
Derrode et al, Invariant content-based image retrieval using a complete set of Fourier Mellin descriptors, Jul. 1999, IEEE, pp. 877-881.
Gotze et al, Invariant object recognition with discriminant features based on local Fast-Fourier Mellin Transform, Sep. 3-7, 2000, IEEE, pp. 948-951.
Syracuse Univewrsity, A study of the overlap among document representations, 1983 ACM, pp. 106-114.
Indyk, P., and Motwani, R., “Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality (preliminary version),” pp. 1-13 and i-vii,Proceedings of 30thSymposium on Theory of Computing, (Dec. 30, 1999).
Gionis, A., et al., “Similarity Search in High Dimensions via Hashing,” Proceedings of the 25thVLDB (Very Large Database) Conference, Edinburgh, Scotland, (1999).
Broder, A.Z., “On the resemblance and containment of documents,”IEEE Computer Society, pp. 21-29, (1998).
Bracewell, R., “Relatives of the Fourier transform,”The Fourier Transform and Its Applications, McGraw-Hill, New York, NY, pp. 241-274 (1978).
Chen Trista P.
Murali Thiruvadaimaruthur M.
Sukthankar Rahul
Breene John
Ehichioya Fred I
Hewlett--Packard Development Company, L.P.
LandOfFree
System and method for efficiently finding near-similar... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for efficiently finding near-similar..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for efficiently finding near-similar... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2752303