PATENT CLAIM ANALYSIS

Application Number: 15895986
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-06
Patent Classification: ["235", "462010"]

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.

Claim (Index 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,\n 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 P 1 , and the rightmost black point is recorded as P 2 ; 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 P 3 , and the lowermost black point is recorded as P 4 ; 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 P 5 , and the rightmost black point is recorded as P 6 ; 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 P 7 , and the lowermost black point is recorded as P 8 ; a distance threshold is preset, the distance between the two black points in any of the four sets of black points P 1  and P 2 , P 3  and P 4 , P 5  and P 6 , and P 7  and P 8  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 P 1  and P 2 , the midpoint between P 3  and P 4 , the midpoint between P 5  and P 6 , and the midpoint between P 7  and P 8  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 P 1  and P 3 , the midpoint between P 4  and P 5 , the midpoint between P 6  and P 8 , and the midpoint between P 7  and P 2  are defined as the four vertexes of the Han Xin code region.

Metadata:
- Claim Count in Document: 15.0
- Percentile: 88.0
- Lexical Diversity: 2.38462
- Patent Class: 235.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['15895199', '15871912', '15895227', '14103881', '14102916']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5578034056885242
- 35 USC 102 Novelty (BERT): 0.4874142973577213
- Combined Prediction Score: 0.5507644948554439
- Mean Citation Score: 196.930768
- Max Citation Score: 238.98643
- Similarity Product: 183.48353267774644

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test