Unlock instant, AI-driven research and patent intelligence for your innovation.

Image processing apparatus and method for encoding an image descriptor based on a gradient histogram

A gradient histogram and image description technology, applied in the field of image descriptors, can solve problems such as ignoring redundant patterns and complexity, and achieve the effect of computational complexity and high efficiency

Inactive Publication Date: 2016-04-13
NEW LUCK GLOBAL LTD
View PDF3 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0042] Furthermore, this encoding ignores redundant patterns in the relative importance between different elements and is unnecessarily complicated with regard to deciding whether a particular element should be encoded

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Image processing apparatus and method for encoding an image descriptor based on a gradient histogram
  • Image processing apparatus and method for encoding an image descriptor based on a gradient histogram
  • Image processing apparatus and method for encoding an image descriptor based on a gradient histogram

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0085] In a first embodiment of the invention, sub-descriptors are grouped according to their distance from the center of the descriptor.

[0086] For example, one such grouping is in Figure 9 is shown in , where there are three groups, namely, g containing the sub-descriptor with the largest distance to the descriptor center 0 ={v 0 ,v 3 ,v 12 ,v 15}, g containing the subdescriptor with the second largest distance to the descriptor center 1 ={v1 ,v 2 ,v 4 ,v 7 ,v 8 ,v 11 ,v 13 ,v 14}, and g containing the sub-descriptor with the minimum distance to the descriptor center 2 ={v 5 ,v 6 ,v 9 ,v 10}. Within each group, the subdescriptors are sorted in ascending subdescriptor index order, but this is not restrictive and other orders may be used, such as clockwise starting from the topmost leftmost subdescriptor in the group. Within each group, corresponding elements of the group's sub-descriptors are all assigned the same encoding priority.

[0087] Based on thi...

no. 2 example

[0096] In a second embodiment of the invention, sub-descriptors are grouped firstly according to their distance from the center (first condition) and secondly according to their mutual distance (second condition).

[0097] In this context, the distance between sub-descriptors may again take the form of Euclidean distance or another suitable distance metric, such as Manhattan distance.

[0098] A second condition may be, for example, that the group should not contain sub-descriptors whose distance to each other is below a predetermined threshold. Thus, a predetermined threshold may be set to prevent eg grouping adjacent sub-descriptors.

[0099] The purpose of the second condition is to ensure that subdescriptors of different groups are taken from relatively distant positions of the subdescriptor grid whenever possible, thereby increasing the information content of descriptors with a very low number of features. It should be noted that the second condition may not always be sa...

no. 3 example

[0103] In a third embodiment of the present invention, the subdescriptors are grouped according to their distance from the center and the subdescriptors of each group are sorted in an order defined according to their corresponding coding characteristics (such as their corresponding transformations). coded.

[0104] For example, combining image 3 The transformation deployment mode considers the second embodiment of the present invention Figure 17 , it can be seen that within each group, two sub-descriptors are transformed according to transformation A and two sub-descriptors are transformed according to transformation B. Thus, it is possible to set a common encoding order condition that for each group the transform utilization order must be "AABB", i.e. for each sub-descriptor group such that the transform of the first sub-descriptor in the group is transform A, in the group The transform of the second sub-descriptor is also Transform A, the transform of the third sub-descr...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

It is described a method for encoding an image descriptor (H) based on gradient histograms (hp ) into a transformed descriptor (V) comprising transformed subdescriptors (vp ), wherein each gradient histogram (hp) comprises a plurality of histogram bins (hi) and each subdescriptor (vp) comprises a set of values (vj), characterised in that said subdescriptors (vp ) are generated according to an element utilisation order list specifying a subdescriptor index (p)of said set of subdescriptors (vp) and an element index (j) of said set of values (vj).

Description

technical field [0001] The present invention relates to methods for efficiently encoding, transcoding, decoding, and processing image descriptors computed in local regions around image keypoints of interest, and to methods including methods for encoding, transcoding, decoding, and processing such Descriptor components for image processing devices. Background technique [0002] Such image descriptors have found broad applicability in many computer vision applications, including object recognition, content-based image retrieval, and image registration, to name a few. [0003] Existing methods of encoding such descriptors present certain disadvantages. [0004] For example, existing encoding methods produce descriptors that require parsing the entire descriptor to perform transcoding whereby a descriptor of a given descriptor length is transformed into a descriptor of a different descriptor length, or they require parsing the entire Descriptor to perform decoding and comparis...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06K9/46G06T7/40G06V10/50
CPCH04N19/30H04N19/14H04N19/40H04N19/90G06V10/50G06T9/00G06V10/28
Inventor S·帕斯彻拉克斯
Owner NEW LUCK GLOBAL LTD