Matrix Two-Dimensional Code Decoding Using Segmented Positioning Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing decoding methods for matrix two-dimensional codes require reading a large code pattern area, which is inconvenient and inefficient, especially when the code pattern is inclined or rotated, necessitating a significant area for decoding.
Innovation Solution
A decoding method that allows for decoding by reading a smaller code pattern area, where unit code patterns are seamlessly jointed and share positioning points, enabling coordinate assignment and grid formation to restore complete unit code patterns, even if the images are fragments or inclined, by determining row and column directions and calculating point spacings using autocorrelation and mean square error methods.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a complete unit code pattern including four positioning points is selected for rectangle matching, then decoding accuracy is ensured, but the required code pattern area increases to six times the area of a unit code pattern
Solution Approach 1:
The patent divides the code pattern recognition process into two independent stages: first detecting positioning points to determine the code pattern region, then performing rectangle matching. This segmentation allows the positioning point detection to be performed on a smaller area (twice the unit code pattern area) rather than requiring the full six-times area, while still ensuring accurate decoding through the subsequent rectangle matching stage
Solution Approach 2:
The patent performs preliminary detection of positioning points and calculation of the code pattern region before performing rectangle matching. By pre-identifying the positioning points and determining the minimal code pattern area in advance, the system reduces the scanning area from six times to twice the unit code pattern area, while maintaining decoding accuracy through the subsequent rectangle matching verification
2Reliability
If a large code pattern area is read to ensure complete code pattern capture, then decoding reliability is improved, but device complexity and cost increase
Solution Approach 1:
The patent segments the decoding process into positioning point detection and rectangle matching stages, allowing the reading device to focus on a smaller code pattern area (twice the unit code pattern area) while maintaining reliability through the structured two-stage approach. This reduces device complexity compared to requiring six-times area capture
Solution Approach 2:
The patent performs preliminary positioning point detection to establish the code pattern region before performing the more complex rectangle matching operation. This preliminary action allows the device to work with a smaller, more manageable code pattern area while ensuring reliable decoding through the subsequent verification step
3Speed
If code patterns are detected without considering inclination or rotation, then processing speed is improved, but measurement precision deteriorates when codes are inclined or rotated
Solution Approach 1:
The patent performs preliminary detection of positioning points to determine the code pattern region and its orientation characteristics before performing rectangle matching. This preliminary action includes analyzing the spatial distribution of positioning points to identify inclination or rotation, allowing the system to maintain high processing speed while achieving accurate detection of inclined or rotated code patterns through the subsequent oriented rectangle matching
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
The present application provides a decoding method for a matrix two-dimensional code, where a matrix two-dimensional code image to be decoded is a code array of jointed matrix two-dimensional code symbols, formed by multiple identical unit code patterns; an image obtained by scanning does not need to include a complete unit code pattern, and a decoding process of the image is: obtaining a binary image of a to-be-decoded code array of jointed matrix two-dimensional code symbols, locating each data point in a unit code pattern that the data point belongs to, so as to restore a complete unit code pattern, and then performing decoding. The present application only needs an area twice the area of a unit code pattern even if decoding is performed when the code pattern is rotated by a most severe degree. In addition, the present application can save resources.