PATENT CLAIM ANALYSIS

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

Abstract:
The invention provides a decoding method and system for a QR code with one damaged position detection pattern. The decoding method comprises the steps: binarizing a received image containing a QR code pattern and searching for position detection patterns, decoding the QR code pattern through the following method if two position detection patterns are searched out, recording the linear equations of the boundaries of the two position detection patterns and the vertex coordinates of the two position detection patterns and calculating the data bit width of the QR code pattern, searching out a location pattern between the two position detection patterns with the positional relation determined, determining the region where the QR code pattern is located according to the two position detection patters and the location pattern, partitioning the region where the QR code pattern is located with grids, and decoding the QR code pattern partitioned with grids.

Claim (Index 3):
The decoding method for the QR code with one damaged position detection pattern according to  claim 1 , characterized in that whether the two position detection patterns are in the adjacent positional relation or the diagonal positional relation is judged according to the geometrical relation between the boundaries and the vertexes of the two position detection patterns, specifically,\n one vertex of one position detection pattern is regarded the first vertex, and the angular point position of the first vertex on the position detection pattern and the linear equations of the first pair of boundaries which intersect with the first vertex and are perpendicular to each other are recorded; the vertex, having the same angular point position with the first vertex, of the other position detection pattern is regarded as the second vertex, and the linear equations of the second pair of boundaries which intersect with the second vertex and are perpendicular to each other are recorded; the intersection point of the second pair of boundaries and the intersection point of the first pair of boundaries are calculated; a point distance threshold is preset, and the distances from the two intersection points to the first vertex or the second vertex are calculated, so that two distance values are obtained; if one of the two distance values is smaller than or equal to the point distance threshold, it is judged that the two position detection patterns are in the adjacent positional relation, otherwise, it is judged that the two position detection patterns are in diagonal positional relation.

Metadata:
- Claim Count in Document: 15.0
- Percentile: 88.0
- Lexical Diversity: 2.49206
- Patent Class: 235.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['12628425', '14102654', '14102916', '15051354', '15895986']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6194305980220409
- 35 USC 102 Novelty (BERT): 0.4849273205939923
- Combined Prediction Score: 0.6059802702792361
- Mean Citation Score: 232.86036400000003
- Max Citation Score: 253.91182
- Similarity Product: 194.13572061013213

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