# US 2016/0253359 A1 · Efficient image matching for large sets of images

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2016/0253359 A1
- Document ID: US20160253359A1
- Status: Published application
- Kind: A1
- Application number: 15/056,947
- Filed: 2016-02-29
- Published: 2016-09-01
- Earliest claimed: 2013-05-07
- Assignees: PicScout (Israel) Ltd.
- Applicants: PicScout (Israel) LTD.
- Inventors: Uri Lavi; Eli Goz; Gregory Begelman
- Web page: https://patentgrep.com/patent/US20160253359A1

## CPC

- G06V 30/2504: {Coarse or fine approaches, e.g. resolution of ambiguities or multiscale approaches}
- G06F 16/137: {Hash-based (content-based indexing of textual data G06F16/31)}
- G06F 16/152: {using file content signatures, e.g. hash values}
- G06F 16/162: {Delete operations (erasing in storage systems G06F3/0652)}
- G06F 16/51: Indexing; Data structures therefor; Storage structures
- G06F 16/532: Query formulation, e.g. graphical querying
- G06F 16/535: Filtering based on additional data, e.g. user or group profiles
- G06F 16/56: having vectorial format
- G06F 16/5854: {using shape and object relationship}
- G06V 10/462: {Salient features, e.g. scale invariant feature transforms [SIFT]}
- G06F 16/55: Clustering; Classification
- G06F 16/5838: {using colour}
- G06V 2201/11: Technique with transformation invariance effect
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system and method to detect similarities between images. The system and method allow comparisons between a query image and one or more catalog images in a manner that is resilient to scanning, scaling, rotating, cropping and other distortions of the query image. The system includes an image processing module that determines and/or calculates principle features of a catalog image and constructs a feature vector using one or more of the principle features. The system also includes a matching module that matches a query image to one or more catalog images. The system finds matches based on a distance measure of features present in the query image and features present in the catalog images.

## Claims

### Claim 1

A method in a computing system for matching a query image against a catalog of images to identify semi-identical images, the method comprising:
maintaining an inverted index to a catalog of images, each image in the catalog of images characterized by vectors associated with principle feature points of the image, the inverted index comprised of hash values of the vectors associated with each image;
receiving a query image that is to be searched against the catalog of images;
characterizing the received query image by:
extracting principal feature points from the query image;
creating vectors characterizing the extracted principal feature points; and
generating hash values for each of the vectors characterizing the query image; and
searching the catalog of images to find semi-identical images to the query image by:
comparing the query image hash values with the inverted index to the catalog of images;
identifying a set of catalog images having a predetermined number of hash values in common with the query image hash values;
identifying a number of geometric inliers in each image in the identified set of catalog images; and
identifying, from the set of catalog images, a set of near-identical images based on images that have a total number of geometric inliers that exceed a threshold value.

### Claim 2 (depends on 1)

The method of claim 1, wherein the hash value of vectors are calculated using a k-d tree.

### Claim 3 (depends on 2)

The method of claim 2, wherein the k-d tree has a predetermined number of vectors.

### Claim 4 (depends on 1)

The method of claim 1, wherein the number of hash values characterizing a catalog image is less than the number of hash values characterizing the query image.

### Claim 5 (depends on 1)

The method of claim 1, wherein the set of near-identical images is further based on normalizing the total number of geometric inliers for an image by the number of hash values characterizing the image.

### Claim 6 (depends on 1)

The method of claim 1, wherein the geometric inliers are identified by a random sample consensus (RANSAC) algorithm.

### Claim 7 (depends on 1)

The method of claim 1, further comprising pre-processing the catalog of images to remove unwanted aspects from images in the catalog.

### Claim 8 (depends on 7)

The method of claim 7, wherein the catalog of images is pre-processed using a support vector machine (SVM) to remove principle feature points associated with an image.

### Claim 9 (depends on 7)

The method of claim 7, wherein the catalog of images is pre-processed by comparison with a catalog of unwanted features to remove unwanted features from an image.

### Claim 10

A computer-readable medium containing instructions that, when executed on a processor, cause the processor to implement a method for matching a query image against a catalog of images to identify semi-identical images, the method comprising:
maintaining an inverted index to a catalog of images, each image in the catalog of images characterized by vectors associated with principle feature points of the image, the inverted index comprised of hash values of the vectors associated with each image;
receiving a query image that is to be searched against the catalog of images;
characterizing the received query image by:
extracting principal feature points from the query image;
creating vectors characterizing the extracted principal feature points; and
generating hash values for each of the vectors characterizing the query image; and
searching the catalog of images to find semi-identical images to the query image by:
comparing the query image hash values with the inverted index to the catalog of images;
identifying a set of catalog images having a predetermined number of hash values in common with the query image hash values;
identifying a number of geometric inliers in each image in the identified set of catalog images; and
identifying, from the set of catalog images, a set of near-identical images based on images that have a total number of geometric inliers that exceed a threshold value.

### Claim 11 (depends on 10)

The computer-readable medium of claim 10, wherein the number of hash values characterizing a catalog image is less than the number of hash values characterizing the query image.

### Claim 12 (depends on 10)

The computer-readable medium of claim 10, wherein the set of near-identical images is further based on normalizing the total number of geometric inliers for an image by the number of hash values characterizing the image.

### Claim 13 (depends on 10)

The computer-readable medium of claim 10, wherein the geometric inliers are identified by a random sample consensus (RANSAC) algorithm.

### Claim 14 (depends on 10)

The computer-readable medium of claim 10, further comprising pre-processing the catalog of images to remove unwanted aspects from images in the catalog.

### Claim 15 (depends on 14)

The computer-readable medium of claim 14, wherein the catalog of images is pre-processed using a support vector machine (SVM) to remove principle feature points associated with an image.

### Claim 16 (depends on 14)

The computer-readable medium of claim 14, wherein the catalog of images is pre-processed by comparison with a catalog of unwanted features to remove unwanted features from an image.
