Detection method and system for characteristic patterns of Han Xin codes

Abstract

The invention provides a detection method and system for characteristic patterns of Han Xin codes. The detection method comprises the steps: binarizing a received two-dimensional code image, scanning the two-dimensional code image line-by-line and column-by-column so as to search out the four vertexes of a Han Xin code region, connecting every two vertexes of the four vertexes so as to form the four boundaries and two diagonal lines of the Han Xin code region, searching out four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0, 1 from the two diagonal lines and also searching out the end points of the characteristic line segments, and calculating the boundaries and the data bit width of position detection patterns of the Han Xin code according to the start points and the end points of the characteristic line segments.

Claims

1. A detection method for the characteristic patterns of Han Xin codes, characterized by comprising the following steps: binarizing a received two-dimensional code image; scanning the two-dimensional code image line-by-line and column-by-column so as to search out the four vertexes of a Han Xin code region; connecting every two vertexes of the four vertexes so as to form the four boundaries and two diagonal lines of the Han Xin code region; searching out four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0, 1 from the two diagonal lines and also searching out the end points of the characteristic line segments; calculating the boundaries and the data bit width of position detection patterns of the Han Xin code according to the start points and the end points of the characteristic line segments.

2. The detection method for the characteristic patterns of Han Xin codes according to claim 1, characterized in that the received two-dimensional code image is binarized, specifically, the gray threshold of the received two-dimensional code image is calculated through the maximum between-class variance method or the mean value method, and the received two-dimensional code is binarized according to the gray threshold.

3. The detection method for the characteristic patterns of Han Xin codes according to claim 1, characterized in that the two-dimensional code image is scanned line-by-line and column-by-column so as to search out the four vertexes of the Han Xin code region, specifically, the two-dimensional code image is scanned line-by-line from top to bottom, data in the initial line are all white point, and when a line including data of black points is scanned, the leftmost black point is recorded as P1, and the rightmost black point is recorded as P2; the two-dimensional code image is scanned column-by-column from left to right, data in the initial column are all white points, and when a column including data of black points is scanned, the uppermost black point is recorded as P3, and the lowermost black point is recorded as P4; the two-dimensional code image is scanned line-by-line from bottom to top, data in the initial line are all white points, and when a line including data of black points is scanned, the leftmost black point is recorded as P5, and the rightmost black point is recorded as P6; the two-dimensional code image is scanned column-by-column from right to left, data in the initial column are all white points, and when a column including data of black points is scanned, the uppermost black point is recorded as P7, and the lowermost black point is recorded as P8; a distance threshold is preset, the distance between the two black points in any of the four sets of black points P1 and P2, P3 and P4, P5 and P6, and P7 and P8 is calculated, and whether the distance is smaller than the distance threshold or not is judged; if the distance is smaller than the distance threshold, the midpoint between P1 and P2, the midpoint between P3 and P4, the midpoint between P5 and P6, and the midpoint between P7 and P8 are defined as the four vertexes of the Han Xin code region; if the distance is greater than or equal to the distance threshold, the midpoint between P1 and P3, the midpoint between P4 and P5, the midpoint between P6 and P8, and the midpoint between P7 and P2 are defined as the four vertexes of the Han Xin code region.

4. The detection method for the characteristic patterns of Han Xin codes according to claim 1, characterized by further comprising the steps: presetting a proportion threshold and recording the number of data sets, each continuously including 1, 0, 1, 0, 1, in each characteristic line segment from the start point of the characteristic line segment so as to obtain a characteristic proportion; analyzing whether the similarities between the characteristic proportions and the standard characteristic proportion 3:1:1:1:1 or 1:1:1:1:3 of the Han Xin code are within the range of the proportional threshold or not; not decoding the two-dimensional code image if the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are not within the range of the proportion threshold.

5. The detection method for the characteristic patterns of Han Xin codes according to claim 4, characterized in that whether the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are within the range of the proportion threshold is not is judged, specifically, initial data of the characteristic proportions are converted into data identical with the initial data of the standard characteristic proportion of the Han Xin code, and all other data of the characteristic proportions are equivalently converted, so that converted characteristic proportions are obtained; the differences between the data, except the initial data, of the converted characteristic proportions and the data on the corresponding bits of the standard characteristic proportion of the Han Xin code are calculated, and the absolute values of the differences are worked out; if the absolute value corresponding to each bit is smaller than the proportion threshold, the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are smaller than the proportion threshold.

6. The detection method for the characteristic patterns of Han Xin codes according to claim 5, characterized in that if the similarity between one of the four characteristic proportions and the standard characteristic proportion 3:1:1:1:1 of the Han Xin code and the similarities between the other three characteristic proportions and the standard characteristic proportion 1:1:1:1:3 of the Han Xin code are not within the range of the proportion threshold, the two-dimensional code image is not decoded.

7. The detection method for the characteristic patterns of Han Xin codes according to claim 1, characterized in that the boundaries of the position detection patterns of the Han Xin code are calculated according to the start points and the end points of the characteristic line segments, specifically, two straight lines which are parallel to the two boundaries, passing through the start point of each characteristic line segment, of the Han Xin code region and pass through the end point of the characteristic line segment are calculated; the edges of the square defined by the two boundaries, passing through the start point of each characteristic line segment, of the Han Xin code region and the two straight lines obtained through calculation are the boundaries of one position detection pattern of the Han Xin code.

8. The detection method for the characteristic patterns of Han Xin codes according to claim 1, characterized in that the data bit width of the position detection patterns of the Han Xin code is calculated according to the start points and the end points of the characteristic line segments, specifically, the length d of each characteristic line segment is worked out according to the start point and the end point of the characteristic line segment; as it is known that the each boundary of each position detection pattern of the Han Xin code includes seven data bits, the data bit width 1 of each position detection pattern of the Han Xin code is calculated according to the length d of the characteristic line segments specifically through the following equation: $l=\frac{\sqrt{2}}{2}.Math.d/7.$

9. A detection system for the characteristic patterns of Han Xin codes, characterized by comprising a processor and a memory having instructions stored therein, wherein the instructions, when executed, cause the processor to binarize a received two-dimensional code image; search out the four vertexes of a Han Xin code region by scanning the two-dimensional code image line-by-line and column-by-column; form the four boundaries and the two diagonal lines of the Han Xin code region by connecting every two vertexes of the four vertexes; search out four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0,1 from the two diagonal lines and also searching out the end points of the characteristic line segments; calculate the boundaries and the data bit width of the position detection patterns of the Han Xin code according to the start points and the end points of the characteristic line segments.

10. The detection system for the characteristic patterns of Han Xin codes according to claim 9, wherein the instructions, when executed, further cause the processor to record the number of data sets, each continuously including 1, 0, 1, 0,1, in each characteristic line segment from the start point of the characteristic line segment; analyze whether the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are within the range of the proportion threshold or not.

Description

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

(1) FIG. 1 is a flow diagram of a detection method for the characteristic patterns of Han Xin codes in the first embodiment of the invention;

(2) FIG. 2 is a diagram of the four vertexes, searched out through line-by-line and column-by-column scanning, of a Han Xin code region in the first embodiment of the invention;

(3) FIG. 3 is a diagram of the four boundaries and the two diagonal lines, formed according to the four vertexes, of the Han Xin code region in the first embodiment of the invention;

(4) FIG. 4 is a diagram of the four position detection patterns obtained according to four characteristic line segments searched out from the two diagonal lines in the first embodiment of the invention;

(5) FIG. 5 is a flow diagram of a detection method for the characteristic patterns of Han Xin codes in the second embodiment of the invention;

(6) FIG. 6 is a system block diagram of a detection system for the characteristic patterns of Han Xin codes in the third embodiment of the invention;

(7) FIG. 7 is a system block diagram of a detection system for the characteristic patterns of Han Xin codes in the fourth embodiment of the invention.

DESCRIPTION OF THE REFERENCE SIGNS

(8) 1, binarization module; 2, first searching module; 3, formation module; 4, second searching module; 5, recording module; 6, analysis module; 7, calculation module.

DETAILED DESCRIPTION OF THE INVENTION

(9) The key concept of the invention: the four vertexes of the Han Xin code region are searched out firstly, then line segments with the proportion of the continuous pixel points 1 and the continuous pixel points 0 according with the standard characteristic proportion 3:1:1:1:1 or 1:1:1:1:3 of the Han Xin code are searched out from the two diagonal lines of the Han Xin code region, the searched-out line segments are the diagonal lines of the position detection patterns of the Han Xin code, and therefore, the position detection patterns of the Han Xin code can be detected without being affected by the rotation angle of the Han Xin code, and the anti-interference capacity and detection efficiency are high.

(10) Detailed Description of the Invention:

(11) As is shown in FIGS. 1-5, a detection method for the characteristic patterns of Han Xin codes comprises the following steps:

(12) binarizing a received two-dimensional code image;

(13) scanning the two-dimensional code image line-by-line and column-by-column so as to search out the four vertexes of the Han Xin code region;

(14) connecting every two vertexes of the four vertexes so as to form the four boundaries and the two diagonal lines of the Han Xin code region;

(15) searching out four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0, 1 from the two diagonal lines and also searching out the end points of the characteristic line segments;

(16) calculating the boundaries and the data bit width of the position detection patterns of the Han Xin code according to the start points and the end points of the characteristic line segments.

(17) Furthermore, the received two-dimensional code image is binarized, specifically,

(18) the gray threshold of the received two-dimensional code image is calculated through the maximum between-class variance method or the mean value method; and

(19) the received two-dimensional code is binarized according to the gray threshold.

(20) From the above description, the maximum between-class variance method is used for calculating the gray threshold so that the influence of the background color on the foreground color can be reduced, and the error proofing capacity is high; and the mean value method is used for calculating the gray threshold, so that calculation is simple and rapid. Therefore, the method is rapid and direct and has small errors.

(21) Furthermore, as is shown in FIG. 2, the two-dimensional code image is scanned line-by-line and column-by-column so as to search out the four vertexes of the Han Xin code region, specifically,

(22) the two-dimensional code image is scanned line-by-line from top to bottom, data in the initial line are all white point, and when a line including data of black points is scanned, the leftmost black point is recorded as P1, and the rightmost black point is recorded as P2;

(23) the two-dimensional code image is scanned column-by-column from left to right, data in the initial column are all white points, and when a column including data of black points is scanned, the uppermost black point is recorded as P3, and the lowermost black point is recorded as P4;

(24) the two-dimensional code image is scanned line-by-line from bottom to top, data in the initial line are all white points, and when a line including data of black points is scanned, the leftmost black point is recorded as P5, and the rightmost black point is recorded as P6;

(25) the two-dimensional code image is scanned column-by-column from right to left, data in the initial column are all white points, and when a column including data of black points is scanned, the uppermost black point is recorded as P7, and the lowermost black point is recorded as P8;

(26) a distance threshold is preset, the distance between the two black points in any of the four sets of black points P1 and P2, P3 and P4, P5 and P6, and P7 and P8 is calculated, and whether the distance is smaller than the distance threshold or not is judged;

(27) if the distance is smaller than the distance threshold, the midpoint between P1 and P2, the midpoint between P3 and P4, the midpoint between P5 and P6, and the midpoint between P7 and P8 are defined as the four vertexes of the Han Xin code region;

(28) if the distance is greater than or equal to the distance threshold, the midpoint between P1 and P3, the midpoint between P4 and P5, the midpoint between P6 and P8, and the midpoint between P7 and P2 are defined as the four vertexes of the Han Xin code region.

(29) From the above description, the four vertexes of the Han Xin code are all black points. If the Han Xin code region rotates, the two-dimensional code image is scanned line-by-line and column-by-column from the line or column including white points only till the line or column including black points is searched out, searched-out the line or column includes only one black point under the ideal condition. Actually, if the vertexes of the Han Xin code are damaged, the searched-out the line or column includes more than one continuous black points, and the midpoints between the continuous black points are adopted to eliminate the influence of damage to the vertexes of the Han Xin code on searching for the vertexes of the Han Xin code through the distance threshold. If the Han Xin code region does not rotate, the black points in the searched-out line or column are discontinuous within the width range of the Han Xin code, the maximum distance between two black points in the line or the column is greater than the preset distance threshold, and in this case, the vertexes of the Han Xin code region depend on the black points at the junctions of two lines and two columns intersecting with the two lines. Therefore, the method is high in decoding efficiency and anti-interference capacity and has small errors.

(30) Furthermore, the detection method comprises the following steps:

(31) presetting a proportion threshold and recording the number of data sets, each continuously including 1, 0, 1, 0, 1, in each characteristic line segment from the start point of the characteristic line segment so as to obtain a characteristic proportion;

(32) analyzing whether the similarities between the characteristic proportions and the standard characteristic proportion 3:1:1:1:1 or 1:1:1:1:3 of the Han Xin code are within the range of the proportional threshold or not through analysis;

(33) not decoding the two-dimensional code image if the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are not within the range of the proportion threshold.

(34) From the above description, after the four characteristic line segments are searched out from the two diagonal lines, whether the similarities between the four characteristic proportions and the standard characteristic proportion 3:1:1:1:1 or 1:1:1:1:3 of the Han Xin code are within the range of the proportional threshold or not is judged. If the two-dimensional code image contains a Han Xin code, three of the four characteristic proportions are similar to the standard characteristic proportion 1:1:1:1:3 of the Han Xin code, and one of the four characteristic proportions is similar to the standard characteristic proportion 3:1:1:1:1 of the Han Xin code. If the four characteristic proportions meet the condition, the received two-dimensional code image contains a Han Xin code and can be decoded subsequently, otherwise, the two-dimensional code image is not decoded. Therefore, the method is reasonable, and whether the received two-dimensional code image contains a Han Xin code or not can be further determined, and the decoding success rate is high.

(35) Furthermore, whether the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are within the range of the proportion threshold is not is judged, specifically,

(36) initial data of the characteristic proportions are converted into data identical with the initial data of the standard characteristic proportion of the Han Xin code, and all other data of the characteristic proportions are equivalently converted, so that converted characteristic proportions are obtained;

(37) the differences between the data, except the initial data, of the converted characteristic proportions and the data on the corresponding bits of the standard characteristic proportion of the Han Xin code are calculated, and the absolute values of the differences are worked out;

(38) if the absolute value corresponding to each bit is smaller than the proportion threshold, the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are smaller than the proportion threshold.

(39) From the above description, the initial data of the characteristic proportions are converted into data identical with the initial data of the standard characteristic proportion of the Han Xin code, all other data of the characteristic proportions are equivalently converted, finally, the absolute values of the differences between the data of the converted characteristic proportions and the data at the corresponding bits of the standard characteristic proportion of the Han Xin code are compared with the preset proportion threshold, and thus the similarity analysis process is simple, direct and rapid.

(40) Furthermore, the detection method comprises the following step:

(41) not decoding the two-dimensional code image if the similarity between one of the four characteristic proportions and the standard characteristic proportion 3:1:1:1:1 of the Han Xin code and the similarities between the other three characteristic proportions and the standard characteristic proportion 1:1:1:1:3 of the Han Xin code are not within the range of the proportion threshold.

(42) From the above description, if the condition mentioned above is met, it indicates that the received two-dimensional code image contains a Han Xin code, and the method is accurate.

(43) As is shown in FIG. 4, furthermore, the boundaries of the position detection patterns of the Han Xin code are calculated according to the start points and the end points of the characteristic line segments, specifically,

(44) two straight lines which are parallel to the two boundaries, passing through the start point of each characteristic line segment, of the Han Xin code region and pass through the end point of the characteristic line segment are calculated;

(45) the edges of the square defined by the two boundaries, passing through the start point of each characteristic line segment, of the Han Xin code region and the two straight lines obtained through calculation are the boundaries of one position detection pattern of the Han Xin code.

(46) From the above description, the boundaries of the position detection patterns of the Han Xin code are obtained through translation of the boundaries of the Han Xin code region according to the start points and the end points of the characteristic line segments, and thus the accuracy of the boundaries of the position detection patterns of the Han Xin code is improved.

(47) Furthermore, the data bit width of the position detection patterns of the Han Xin code is calculated according to the start points and the end points of the characteristic line segments, specifically,

(48) the length d of each characteristic line segment is worked out according to the start point and the end point of the characteristic line segment;

(49) as it is known that the each boundary of each position detection pattern of the Han Xin code includes seven data bits, the data bit width 1 of each position detection pattern of the Han Xin code is calculated according to the length d of the characteristic line segments specifically through the following equation:

(50) $l=\frac{\sqrt{2}}{2}.Math.d/7.$

(51) From the above description, the length of the boundaries of the position detection patterns is obtained according to the length of the characteristic line segments, each boundary of each position detection pattern includes seven data bits, and thus the data bit width is the result obtained by dividing the length of the boundaries of the position detection patterns by seven. Therefore, the method is reasonable, and calculation is simple and rapid.

(52) As is shown in FIGS. 1-4, as for the first embodiment of the invention:

(53) A received two-dimensional code image is binarized, specifically,

(54) the gray threshold of the received two-dimensional code image is calculated through the maximum between-class variance method;

(55) the received two-dimensional code is binarized according to the gray threshold.

(56) As is shown in FIG. 2, the two-dimensional code image is scanned line-by-line and column-by-column so as to search out the four vertexes of the Han Xin code region, specifically,

(57) the two-dimensional code image is scanned line-by-line from top to bottom, data in the initial line are all white point, and when a line including data of black points is scanned, the leftmost black point is recorded as P1, and the rightmost black point is recorded as P2;

(58) the two-dimensional code image is scanned column-by-column from left to right, data in the initial column are all white points, and when a column including data of black points is scanned, the uppermost black point is recorded as P3, and the lowermost black point is recorded as P4;

(59) the two-dimensional code image is scanned line-by-line from bottom to top, data in the initial line are all white points, and when a line including data of black points is scanned, the leftmost black point is recorded as P5, and the rightmost black point is recorded as P6;

(60) the two-dimensional code image is scanned column-by-column from right to left, data in the initial column are all white points, and when a column including data of black points is scanned, the uppermost black point is recorded as P7, and the lowermost black point is recorded as P8;

(61) the distance threshold is preset as 4, the distance between the two black points in any of the four sets of black points P1 and P2, P3 and P4, P5 and P6, and P7 and P8 is calculated, and whether the distance is smaller than the distance threshold or not is judged;

(62) as can be seen from FIG. 2, if the distance is smaller than the distance threshold, the midpoint between P1 and P2, the midpoint between P3 and P4, the midpoint between P5 and P6, and the midpoint between P7 and P8 are defined as the four vertexes of the Han Xin code region;

(63) only under the condition that the Han Xin code region does not rotate, the distance is greater than or equal to the distance threshold, and in this case, the midpoint between P1 and P3, the midpoint between P4 and P5, the midpoint between P6 and P8, and the midpoint between P7 and P2 are defined as the four vertexes of the Han Xin code region.

(64) As is shown in FIG. 3, every two vertexes of the four vertexes are connected so as to form the four boundaries and the two diagonal lines of the Han Xin code region.

(65) Four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0, 1 are searched out from the two diagonal lines, and the end points of the characteristic line segments are also searched out.

(66) As is shown in FIG. 4, the boundaries of the position detection patterns of the Han Xin code are calculated according to the start points and the end points of the characteristic line segments, specifically,

(67) two straight lines which are parallel to the two boundaries, passing through the start point of each characteristic line segment, of the Han Xin code region and pass through the end point of the characteristic line segment are calculated;

(68) the edges of the square defined by the two boundaries, passing through the start point of each characteristic line segment, of the Han Xin code region and the two straight lines obtained through calculation are the boundaries of one position detection pattern of the Han Xin code.

(69) The data bit width of the position detection patterns of the Han Xin code is calculated according to the start points and the end points of the characteristic line segments, specifically,

(70) the length d of each characteristic line segment is worked out according to the start point and the end point of the characteristic line segment;

(71) as it is known that the each boundary of each position detection pattern of the Han Xin code includes seven data bits, the data bit width 1 of each position detection pattern of the Han Xin code is calculated according to the length d of the characteristic line segments specifically through the following equation:

(72) $l=\frac{\sqrt{2}}{2}.Math.d/7.$

(73) As is shown in FIG. 5, as for the second embodiment of the invention:

(74) A received two-dimensional code image is binarized.

(75) The two-dimensional code image is scanned line-by-line and column-by-column so as to search out the four vertexes of the Han Xin code region.

(76) Every two of the four vertexes are connected so as to form the four boundaries and two diagonal lines of the Han Xin code region.

(77) Four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0, 1 are searched out from the two diagonal lines, and the end points of the characteristic line segments are also searched out.

(78) A proportion threshold is preset, and the number of data sets, each continuously including 1, 0, 1, 0, 1, in each characteristic line segment is recoded from the start point of the characteristic line segment so as to obtain a characteristic proportion.

(79) Whether the similarities between the characteristic proportions and the standard characteristic proportion 3:1:1:1:1 or 1:1:1:1:3 of the Han Xin code are within the range of the proportional threshold or not is judged through analysis, specifically,

(80) initial data of the characteristic proportions are converted into data identical with the initial data of the standard characteristic proportion of the Han Xin code, and all other data of the characteristic proportions are equivalently converted, so that converted characteristic proportions are obtained;

(81) the differences between the data, except the initial data, of the converted characteristic proportions and the data on the corresponding bits of the standard characteristic proportion of the Han Xin code are calculated, and the absolute values of the differences are worked out;

(82) if the absolute value corresponding to each bit is smaller than the proportion threshold, the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are smaller than the proportion threshold;

(83) if the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are not within the range of the proportion threshold, the two-dimensional code is not decoded;

(84) if the similarity between one of the four characteristic proportions and the standard characteristic proportion 3:1:1:1:1 of the Han Xin code and the similarities between the other three characteristic proportions and the standard characteristic proportion 1:1:1:1:3 of the Han Xin code are not within the range of the proportion threshold, the two-dimensional code image is not decoded.

(85) The boundaries and the data bit width of the position detection patterns of the Han Xin code are calculated according to the start points and the end points of the characteristic line segments.

(86) As is shown in FIGS. 6-7, a detection system for the characteristic patterns of Han Xin codes comprises a binarization module 1, a first searching module 2, a formation module 3, a second searching module 4 and a calculation module 7, wherein,

(87) the binarization module 1 is used for binarizing a received two-dimensional code image;

(88) the first searching module 2 is used for searching out the four vertexes of a Han Xin code region by scanning the two-dimensional code image line-by-line and column-by-column;

(89) the formation module 3 is used for forming the four boundaries and the two diagonal lines of the Han Xin code region by connecting every two vertexes of the four vertexes;

(90) the second searching module 4 is used for searching out four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0, 1 from the two diagonal lines and also searching out the end points of the characteristic line segments;

(91) the calculation module 7 is used for calculating the boundaries and the data bit width of the position detection patterns of the Han Xin code according to the start points and the end points of the characteristic line segments.

(92) Furthermore, the detection system comprises a recoding module 5 and an analysis module 6, wherein,

(93) the recoding module 5 is used for recording the number of data sets, each continuously including 1, 0, 1, 0, 1, in each characteristic line segment from the start point of the characteristic line segment;

(94) the analysis module 6 is used for analyzing whether the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are within the range of the proportion threshold or not.

(95) From the above description, whether the characteristic proportions of the characteristic line segments are similar to the standard characteristic proportion of the Han Xin code or not is judged through the recording module 5 and the analysis module 6, afterwards, whether the received two-dimensional code image contains a Han Xin code or not is determined finally, and thus the decoding accuracy of the system is ensured.

(96) As is shown in FIG. 6, as for the third embodiment of the invention:

(97) A detection system for the characteristic patterns of Han Xin codes comprises a binarization module 1, a first searching module 2, a formation module 3, a second searching module 4 and a calculation module 7, wherein,

(98) the binarization module 1 is used for binarizing a received two-dimensional code image;

(99) the first searching module 2 is used for searching out the four vertexes of a Han Xin code region by scanning the two-dimensional code image line-by-line and column-by-column;

(100) the formation module 3 is used for forming the four boundaries and the two diagonal lines of the Han Xin code region by connecting every two vertexes of the four vertexes;

(101) the second searching module 4 is used for searching out four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0, 1 from the two diagonal lines and also searching out the end points of the characteristic line segments;

(102) the calculation module 7 is used for calculating the boundaries and the data bit width of the position detection patterns of the Han Xin code according to the start points and the end points of the characteristic line segments.

(103) As is shown in FIG. 7, as for the fourth embodiment of the invention:

(104) A detection system for the characteristic patterns of Han Xin codes comprises a binarization module 1, a first searching module 2, a formation module 3, a second searching module 4, a recording module 5, an analysis module 6 and a calculation module 7, wherein,

(105) the binarization module 1 is used for binarizing a received two-dimensional code image;

(106) the first searching module 2 is used for searching out the four vertexes of a Han Xin code region by scanning the two-dimensional code image line-by-line and column-by-column;

(107) the formation module 3 is used for forming the four boundaries and the two diagonal lines of the Han Xin code region by connecting every two vertexes of the four vertexes;

(108) the second searching module 4 is used for searching out four characteristic line segments starting from the vertexes and having the continuous binarization values 1, 0, 1, 0, 1 from the two diagonal lines and also searching out the end points of the characteristic line segments;

(109) the recoding module 5 is used for recording the number of data sets, each continuously including 1, 0, 1, 0, 1, in each characteristic line segment from the start point of the characteristic line segment;

(110) the analysis module 6 is used for analyzing whether the similarities between the characteristic proportions and the standard characteristic proportion of the Han Xin code are within the range of the proportion threshold or not.

(111) the calculation module 7 is used for calculating the boundaries and the data bit width of the position detection patterns of the Han Xin code according to the start points and the end points of the characteristic line segments.

(112) In conclusion, according to the detection method and system for the characteristic patterns of Han Xin codes, the four vertexes of the Han Xin code region are searched out through line-by-line and column-by-column scanning of the received two-dimensional code image without being affected by the rotation condition of the Han Xin code region, the four boundaries and the two diagonal lines of the Han Xin code region are determined through the four vertexes, the diagonal lines of the position detection patterns of the Han Xin code are searched out from the diagonal lines of the Han Xin code region, and therefore, the characteristics of the position detection patterns of the Han Xin code are fully utilized; and the method is high in anti-interference capacity and high in detection efficiency and speed.