Image processing and object classification
US-9547807-B2 · Jan 17, 2017 · US
US9922270B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9922270-B2 |
| Application number | US-201514622621-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 13, 2015 |
| Priority date | Feb 13, 2014 |
| Publication date | Mar 20, 2018 |
| Grant date | Mar 20, 2018 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Systems and methods of generating a compact visual vocabulary are provided. Descriptor sets related to digital representations of objects are obtained, clustered and partitioned into cells of a descriptor space, and a representative descriptor and index are associated with each cell. Generated visual vocabularies could be stored in client-side devices and used to obtain content information related to objects of interest that are captured.
Opening claim text (preview).
What is claimed is: 1. A global descriptor vocabulary system comprising: a recognition module programmed to perform the step of obtaining a plurality of descriptor sets including descriptors associated with a plurality of digital representations of objects, each descriptor set existing within a descriptor space; and a vocabulary generation engine coupled with the recognition module and programmed to perform the steps of: obtaining the plurality of descriptor sets; clustering the plurality of descriptor sets into regions within the descriptor space; partitioning the descriptor space into a plurality of cells as a function of the clustered regions; assigning an index to each cell of the plurality of cells as a function of a representative descriptor in each cell of the plurality of cells, the representative descriptor being derived from a selected actual descriptor from the plurality of descriptor sets that is closest to an average of all descriptors in a corresponding cell of the descriptor space, wherein each of the assigned indices is of a number of bytes selected based on the amount of cells comprising the plurality of cells; and instantiating a global vocabulary module as a function of the assigned indices and representative descriptors and configured to generate a set of content indices that reference corresponding cells in the descriptor space based on an input set of descriptors. 2. The system of claim 1 , wherein the plurality of descriptor sets comprise image descriptors. 3. The system of claim 1 , wherein the plurality of descriptor sets comprise multi-modal descriptors. 4. The system of claim 1 , wherein the plurality of descriptor sets comprise a homogenous mix of descriptors. 5. The system of claim 1 , wherein the recognition module further comprises an invariant feature identification algorithm. 6. The system of claim 5 , wherein the invariant feature identification algorithm comprises one of the following algorithms: SIFT, FREAK, BRISK, and DAISY. 7. The system of claim 1 , wherein the plurality of descriptor sets have their own descriptor space. 8. The system of claim 1 , wherein the vocabulary generation engine is further programmed to perform the step of clustering the plurality of descriptor sets using at least one of hierarchal k-mean, approximate k-mean, k-means clustering, and histogram binning. 9. The system of claim 1 , wherein the vocabulary generation engine is further programmed to perform the step of partitioning the descriptor space based on Voronoi decomposition. 10. The system of claim 1 , wherein the representative descriptor is in the cell. 11. The system of claim 1 , wherein the global vocabulary module comprises a vocabulary tree. 12. The system of claim 11 , wherein the vocabulary tree comprises at least one of the following: a k-nearest neighbor tree, a spill tree, and a k-d tree. 13. The system of claim 1 , wherein the vocabulary module is further programmed to perform the step of generating the set of content indices using a nearest neighbor classification. 14. The system of claim 13 , wherein the vocabulary module is further programmed to perform the step of calculating the nearest neighbor classification using at least one of a Euclidean distance and a Mahalanobis distance. 15. The system of claim 1 , wherein each of the assigned indices is no more than six bytes. 16. The system of claim 15 , wherein each of the assigned indices is no more than four bytes. 17. The system of claim 16 , wherein each of the assigned indices is no more than three bytes. 18. The system of claim 1 , wherein the global vocabulary module is further programmed to perform the step of constructing a query based on the input set of descriptors. 19. The system of claim 1 , wherein the input set of descriptors comprise image descriptors.
Generating sets of training patterns; Bootstrap methods, e.g. bagging or boosting · CPC title
Generating training patterns; Bootstrap methods, e.g. bagging or boosting · CPC title
Dictionaries · CPC title
Distances to closest patterns, e.g. nearest neighbour classification · CPC title
based on distances to training or reference patterns · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.