Method and apparatus for representing and identifying feature descriptors utilizing a compressed histogram of gradients

Patent metadata

Field	Value
Publication number	US-9710492-B2
Application number	US-61751409-A
Country	US
Kind code	B2
Filing date	Nov 12, 2009
Priority date	Nov 12, 2008
Publication date	Jul 18, 2017
Grant date	Jul 18, 2017

Abstract

A method, apparatus and computer program product may be provided for generating a plurality of compressed feature descriptors that can be represented by a relatively small number of bits, thereby facilitating transmission and storage of the feature descriptors. A method, apparatus and computer program product may also be provided for permitting a compressed representation of a feature descriptor to be compared with a plurality of compressed representations of feature descriptors of respective predefined features. By permitting the comparison to be performed utilizing compressed representations of feature descriptors, a respective feature descriptor may be identified without having to first decompress the feature descriptor, thereby potentially increasing the efficiency with which feature descriptors may be identified.

First claim

What is claimed is:

1. A method comprising:
dividing an image into a plurality of image regions;
determining a plurality of gradients for each of a plurality of cells of an image region, wherein the image region is divided into the plurality of cells prior to determining the plurality of gradients;
selecting a bin configuration, wherein selecting a bin configuration comprises selecting a bin configuration having a bin positioned at a location coinciding with the gradient having a greatest probability;
assigning the gradients for a respective cell to a respective one of a plurality of bins of the bin configuration that has been selected;
determining a plurality of feature descriptors, wherein each feature descriptor includes a representation of a distribution of gradients between the plurality of bins of a respective cell; and
compressing the plurality of feature descriptors comprising the gradient distributions of the respective cells.

2. A method according to claim 1 further comprising entropy coding compressed representations of the plurality of feature descriptors.

3. A method according to claim 1 further comprising providing for at least one of transmission or storage of compressed representations of the plurality of feature descriptors.

4. A method according to claim 1 wherein selecting a bin configuration further comprises selecting a bin configuration that is skewed in a common direction as the distribution of gradients.

5. A method according to claim 1 wherein compressing the plurality of feature descriptors comprises utilizing tree coding to compress the plurality of feature descriptors.

6. An apparatus comprising at least one processor and at least one memory storing computer program code, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to cause the apparatus at least to:
divide an image into a plurality of image regions;
determine a plurality of gradients for each of a plurality of cells of an image region, wherein the image region is divided into the plurality of cells prior to determining the plurality of gradients;
select a bin configuration by selecting a bin configuration having a bin positioned at a location coinciding with the gradient having a greatest probability;
assigning the gradients for a respective cell to a respective one of a plurality of bins of the bin configuration that has been selected;
determine a plurality of feature descriptors, wherein each feature descriptor includes a representation of a distribution of gradients between the plurality of bins of a respective cell; and
compress the plurality of feature descriptors comprising the gradient distributions of the respective cells.

7. An apparatus according to claim 6 wherein the at least one memory and stored computer program code are further configured, with the at least one processor, to entropy code compressed representations of the plurality of feature descriptors.

8. An apparatus according to claim 6 wherein the at least one memory and stored computer program code are further configured, with the at least one processor, to provide for at least one of transmission or storage of compressed representations of the plurality of feature descriptors.

9. An apparatus according to claim 6 wherein the at least one memory and stored computer program code are further configured, with the at least one processor, to select a bin configuration that is skewed in a common direction as the distribution of gradients.

10. An apparatus according to claim 6 wherein the at least one memory and stored computer program code are configured, with the at least one processor, to compress the plurality of feature descriptors by utilizing tree coding to compress the plurality of feature descriptors.

11. A method comprising:
comparing a compressed representation of a feature descriptor with a plurality of predetermined compressed representations of feature descriptors of respective predefined features, wherein the feature descriptors include a representation of a distribution of gradients; and
based upon comparison results, identifying the compressed representation of a feature descriptor to represent a predefined feature without first decompressing the feature descriptor.

12. A method according to claim 11 wherein comparing a compressed representation of a feature descriptor comprises determining a distance between the compressed representation of a feature descriptor and each predetermined compressed representation of a feature descriptor of a respective predefined feature.

13. A method according to claim 12 wherein identifying the compressed representation of a feature descriptor comprises identifying the predefined feature represented by the predetermined compressed representation of a feature descriptor that is separated by a distance less than a predefined threshold from the compressed representation of a feature descriptor.

14. A method according to claim 11 further comprising providing information regarding the predefined feature.

15. An apparatus comprising at least one processor and at least one memory storing computer program code, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to cause the apparatus at least to:
compare a compressed representation of a feature descriptor with a plurality of predetermined compressed representations of feature descriptors of respective predefined features, wherein the feature descriptors include a representation of a distribution of gradients; and
based upon comparison results, identify the compressed representation of a feature descriptor to represent a predefined feature without first decompressing the feature descriptor.

16. An apparatus according to claim 15 wherein the at least one memory and stored computer program code are configured, with the at least one processor, to compare a compressed representation of a feature descriptor by determining a distance between the compressed representation of a feature descriptor and each predetermined compressed representation of a feature descriptor of a respective predefined feature.

17. An apparatus according to claim 16 wherein the at least one memory and stored computer program code are configured, with the at least one processor, to identify the compressed representation of a feature descriptor by identifying the predefined feature represented by the predetermined compressed representation of a feature descriptor that is separated by a distance less than a predefined threshold from the compressed representation of a feature descriptor.

18. An apparatus according to claim 15 wherein the at least one memory and stored computer program code are further configured, with the at least one processor, to provide information regarding the predefined feature.

Assignees

• Grzeszczuk Radek
• Chandrasekhar Vijay
• Takacs Gabriel
• Girod Bernd
• Nokia Technologies Oy

Inventors

• Grzeszczuk Radek
• Chandrasekhar Vijay
• Takacs Gabriel
• Girod Bernd

Classifications

• G06V10/50

  by performing operations within image blocks; by using histograms, e.g. histogram of oriented gradients [HoG]; by summing image-intensity values; Projection analysis · CPC title

• G06F16/5838 Primary

  using colour · CPC title

• H04N19/14

  Coding unit complexity, e.g. amount of activity or edge presence estimation (H04N19/146 takes precedence) · CPC title

• G06K9/4642

  Physics · mapped topic

• G06T9/40

  Tree coding, e.g. quadtree, octree · CPC title