Partition min-hash for partial-duplicate image determination
First Claim
1. A method comprising:
- receiving a first image at a computing device through a network;
dividing the first image into a plurality of partitions by the computing device;
for each partition of the first image, generating one or more min-hash sketches for the partition by the computing device;
storing the generated one or more min-hash sketches for each partition of the first image by the computing device;
dividing the first image into a grid of elements;
determining one or more min-hashes of each element; and
storing the computed one or more min-hashes of each element.
2 Assignments
0 Petitions
Accused Products
Abstract
Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images.
30 Citations
20 Claims
-
1. A method comprising:
-
receiving a first image at a computing device through a network; dividing the first image into a plurality of partitions by the computing device; for each partition of the first image, generating one or more min-hash sketches for the partition by the computing device; storing the generated one or more min-hash sketches for each partition of the first image by the computing device; dividing the first image into a grid of elements; determining one or more min-hashes of each element; and storing the computed one or more min-hashes of each element. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method comprising:
-
receiving a first image at a computing device; determining a plurality of features of the first image by the computing device; generating a min-hash sketch of the first image by the computing device; determining a geometric relationship for a pair of features from the plurality of determined features of the first image by the computing device; associating the geometric relationship with the sketch by the computing device; storing the min-hash sketch and the associated geometric relationship for the first image by the computing device; receiving a second image; generating a min-hash sketch of the second image; determining if the min-hash sketch of the first image matches the min-hash sketch of the second image; and if it is determined that the min-hash sketch of the first image matches the min-hash sketch of the second image; determining a plurality of features from the of the second image; determining a geometric relationship for a pair of features from the plurality of determined features of the second image; and determining if the geometric relationship for the pair of features from the first image matches the geometric relationship for the pair of features from the second image, and if so, determining that the first image matches the second image. - View Dependent Claims (10, 18)
-
-
11. A system comprising:
-
at least one computing device; and an image matcher adapted to; receive a first image; divide the first image into a plurality of partitions, wherein the partitions are overlapping partitions; for each partition of the first image, generate one or more min-hash sketches for the partition; and store the generated min-hash sketches for each partition of the first image. - View Dependent Claims (12, 13, 14, 15, 16, 17, 19, 20)
-
Specification