Highly robust mark point decoding method and system

Patent metadata

Field	Value
Publication number	US-2016239975-A1
Application number	US-201615140534-A
Country	US
Kind code	A1
Filing date	Apr 28, 2016
Priority date	Aug 20, 2014
Publication date	Aug 18, 2016
Grant date	—

Abstract

The present invention provides a highly robust mark point decoding method and system. The decoding method comprises the following steps: step A, estimating a homography matrix and converting perspective projection images of mark points into orthographic projection images; step B, traversing coding segments of the mark points images in a polar coordinate system to obtain a pixel value in a cartesian coordinate system corresponding to each point, and determining the length of each coding segment and the code value thereof in a binary coding sequence, so as to determine the number of code value bits of each coding segment in the binary coding sequence to form a binary coding sequence; step C, performing cyclic shifting on the binary coding sequence, and converting each cyclic-shifted sequence into a decimal coded value, and marking the minimum decimal coded value as a coded value of the mark point.

First claim

What is claimed is:

1 . A highly robust mark point decoding method comprising the following steps:
step A: estimating a homography matrix, and transforming a perspective projection image of a mark point into a orthographic projection image by using an estimated homography matrix; step B: traversing a coding segment of the orthographic projection image of the mark point in a polar coordinate system to obtain a corresponding pixel value of each pixel point of the coding segment in a Cartesian coordinate system, judging a length of each coding segment based on distribution of the pixel values to determine a code value bit number occupied by each coding segment in a binary coding sequence, and using the pixel value of each coding segment as a code value of the coding segment in the binary coding sequence to form a binary coding sequence for representing the coding value of the mark point in the Cartesian coordinate system; wherein the image of the mark point is an annular dual-value coding image, and when the image of the mark point is partitioned into N equal parts with an equal angle, each equal part is used as a pixel value coding bit, and each coding segment comprises at least one equal part; and step C: subjecting the binary coding sequence to cyclic shift, converting a shifted sequence into a decimal coding value, and finally marking a minimum decimal coding value as the coding value of the mark point.

2 . The highly robust mark point decoding method according to claim 1 , wherein the homography matrix in step A is estimated by means of the following five points: two intersection points between a long axis and an edge of a ellipse, two intersection points between a short axis and the edge of the ellipse, and a central point of the central ellipse.

3 . The highly robust mark point decoding method according to claim 1 , wherein in step B, the polar coordinate system is mapped to the Cartesian coordinate system with the following formulae:
X=x 0 +r ×cos(theta);
Y=y 0 =r ×sin(theta);
wherein x 0 is a central x-coordinate of a polar coordinate transformation, y 0 is a central y-coordinate of the polar coordinate transformation, r indicates a polar radius, and theta indicates a polar angle, the polar radius r being within a range of the image of the mark point.

4 . The highly robust mark point decoding method according to claim 3 , wherein the polar radius r has a value selected from r∈[2R, 3R], R being a central circle radius of the image of the mark point; and the polar angle theta has a value selected from theta∈[1°, 360°].

5 . The highly robust mark point decoding method according to claim 4 , wherein the traversing a coding segment in step B comprises:
traversing a coding segment of a orthographic projection image of the mark point by using the polar radius r as a constant and using 360 angle values obtained by even partition of the polar angle theta by 1 degree as variables; wherein the polar radius r=2.5 R.

6 . The highly robust mark point decoding method according to claim 1 , wherein a ratio of the central circle radius of the image of the mark point to a coding ring inner radius to a coding ring outer radius is 1:2:3.

7 . A highly robust mark point decoding system comprising the following modules:
a perspective projection transforming module, configured to transform a perspective projection image of a mark point into an orthographic projection image by means of an estimated homography matrix; a coordinate transforming module, configured to traverse a coding segment of the orthographic projection image of the mark point in a polar coordinate system to obtain a pixel value of each pixel point of the coding segment in a Cartesian coordinate system, judge a length of each coding segment based on the distribution of the pixel values to determine a code value bit number occupied by each coding segment in a binary coding sequence, and use the pixel value of each coding segment as a code value of the coding segment in the binary coding sequence to form a binary coding sequence for representing the coding value of the mark point in the Cartesian coordinate system; wherein the image of the mark point is an annular dual-value coding image, and when the image of the mark point is partitioned into N equal parts with an equal angle, each equal part is used as a pixel value coding bit, and each coding segment comprises at least one equal part; and a decoding marking module, configured to subject the binary coding sequence to cyclic shift, convert a shifted sequence into a decimal coding value, and mark a minimum decimal coding value as the coding value of the mark point.

8 . The highly robust mark point decoding system according to claim 7 , wherein the coordinate transforming module maps the image comprising a plurality of mark points from the polar coordinate system to the Cartesian coordinate system by means of the following formulae:
X=x 0 +r ×cos(theta);
Y=y 0 =r ×sin(theta);
wherein x 0 is a central x-coordinate of a polar coordinate transformation, y 0 is a central y-coordinate of the polar coordinate transformation, r indicates a polar radius, and theta indicates a polar angle, the polar radius r being within a range of the image of the mark point.

9 . The highly robust mark point decoding system according to claim 8 , wherein the polar radius r has a value selected from r∈[2R, 3R], R being a central circle radius of the image of the mark point; the polar angle theta has a value selected from theta∈[1°, 360°]; and a ratio of the central circle radius of the image of the mark point to a coding ring inner radius to a coding ring outer radius is 1:2:3.

10 . The highly robust mark point decoding system according to claim 9 , wherein the coordinate transforming module traverses a coding segment of an orthographic projection image of the mark point by using the polar radius r as a constant and using 360 angle values obtained by even partition of the polar angle theta by 1 degree as variables; wherein the polar radius r=2.5 R.

Assignees

• Univ Shenzhen

Inventors

• Liu Xiaoli
• Yao Mengting
• Yin Yongkai
• Peng Xiang

Classifications

• G06T7/0018

  Physics · mapped topic

• G06T7/0061 Primary

  Physics · mapped topic

• G06T7/0075

  Physics · mapped topic

• G06T2207/10028

  Range image; Depth image; 3D point clouds · CPC title

• G06T2200/04

  involving 3D image data · CPC title