Abstract: The invention provides a method and system for encrypting and decrypting two-dimensional code mask. The method comprises: generating a target two-dimensional code containing a function pattern and an identification, an initial mask pattern and a key by a two-dimensional code generating device; sending the identification, the initial mask pattern and the key to a server by the two-dimensional code generating device; sending the identification to the server by the two-dimensional code decoding device; receiving the identification by the server; sending the key and the initial mask pattern to the two-dimensional code decoding device by the server according to the identification; receiving by the two-dimensional code decoding device the key and the initial mask pattern sent by the server; and decrypting the encrypted two-dimensional code by the two-dimensional code decoding device according to the key and the initial mask pattern to acquire the target two-dimensional code. The system has high security.

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.

Abstract: A decoding method includes that when encoding at a sending terminal, for a m-order primitive polynomial P(x), a primitive field element in galois field GF(2m) is represented by ?; a lookup table f(?j) for different power exponents of ? is established, where the value of j is selected from all the integers ranging from 0 to 2m?1, with a total number of 2m; a generator polynomial G(x) is expanded to obtain a polynomial with respect to x, with coefficients being an addition or subtraction of the power exponents of ?; a remainder polynomial R(x), obtained by dividing code word polynomial Q(x) by the generator polynomial G(x), is a polynomial with respect to x, with coefficients being an addition or subtraction of the power exponents of ?; and the coefficients of the generator polynomial G(x) and the remainder polynomial R(x) are both calculated using data found in the lookup table f(?j).

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 patterns 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.

Abstract: A primary localization method for QR codes comprises: S1, binarizing pixel points of a received image containing a QR code; S2, partitioning the image into at least one mesh region; S3, recording the number of black pixel points in each mesh region, assigning the value 1 to mesh regions including black points, and assigning the value 0 to mesh regions not including black points; S4, marking the image as a non-object region; S5, scanning the non-object region line-by-line and column by column and marking the union of the mesh regions continuously with the value 1 for the first time in each line and the mesh regions continuously with the value 1 for the first time in each column as an object region; S6, judging whether the object region is the QR code region, if not, returning to step S5, and if yes, outputting the line numbers and the column numbers.

Abstract: The invention provides a method and system for decoding two-dimensional code using weighted average gray-scale algorithm. The method comprises: segmenting a received two-dimensional code image into bit regions each containing one bit data; presetting a shifting threshold, and shifting four original boundary lines of the bit region outwards by a distance of the shifting threshold to obtain four preset boundary lines; calculating an average gray-scale value of the bit region using the weighted average algorithm by taking an overlapping area between pixels inside the four preset boundary lines and the bit region as a weight; binarizing the two-dimensional code image according to the average gray-scale value of the bit region; and decoding the two-dimensional code image. The influence of the pixels which have an overlapping area with the bit region on the average gray-scale value of the bit region is considered, and the decoding accuracy and success rate are high.

Abstract: A method includes: dividing a received QR code image into a multi-row image of rows of pixels whose number is the same as a threshold of the number of rows; calculating an average grayscale value of each column of pixels to form row data, and binarizing the row data; extracting a rectangle image in the binarized row data whose similarity to a preset proportion is smaller than a threshold; binarizing the rectangle image and a region formed by extending the rectangle image by the width threshold upwardly and downwardly respectively; searching for column line segments meeting the preset proportion on a middle column of the rectangle image; translating a diagonal line of a square image in upward and downward directions respectively; searching for and recording black-white demarcation points on the edge of the square image on the translated diagonal line and forming a position detection pattern of the QR code.

Abstract: A block decoding method includes: storing a received two-dimensional code image in an image data backup register; binarizing the received two-dimensional code image; searching for a boundary line of the two-dimensional code image; segmenting each of the regions into bit regions each of which corresponds to one bit data; re-acquiring the received two-dimensional code image stored in the image data backup register; calculating an average gray-scale value of all the pixels in the bit region as a gray-scale value of the bit region; calculating a gray-scale threshold of each of the bit regions n using the Otsu method; binarizing the bit region so as to obtain a binarized two-dimensional code image; and decoding the binarized two-dimensional code image. A system for a two-dimensional code is also disclosed.

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.

Abstract: A primary localization method for QR codes comprises: S1, binarizing pixel points of a received image containing a QR code; S2, partitioning the image into at least one mesh region; S3, recording the number of black pixel points in each mesh region, assigning the value 1 to mesh regions including black points, and assigning the value 0 to mesh regions not including black points; S4, marking the image as a non-object region; S5, scanning the non-object region line-by-line and column by column and marking the union of the mesh regions continuously with the value 1 for the first time in each line and the mesh regions continuously with the value 1 for the first time in each column as an object region; S6, judging whether the object region is the QR code region, if not, returning to step S5, and if yes, outputting the line numbers and the column numbers.

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.

Abstract: The invention provides a method and system for encrypting and decrypting two-dimensional code mask. The method comprises: generating a target two-dimensional code containing a function pattern and an identification, an initial mask pattern and a key by a two-dimensional code generating device; sending the identification, the initial mask pattern and the key to a server by the two-dimensional code generating device;; sending the identification to the server by the two-dimensional code decoding device; receiving the identification by the server; sending the key and the initial mask pattern to the two-dimensional code decoding device by the server according to the identification; receiving by the two-dimensional code decoding device the key and the initial mask pattern sent by the server; and decrypting the encrypted two-dimensional code by the two-dimensional code decoding device according to the key and the initial mask pattern to acquire the target two-dimensional code. The system has high security.

Abstract: The invention provides a block decoding method and system for a two-dimensional code. The block decoding method includes: storing a received two-dimensional code image in an image data backup register; binarizing the received two-dimensional code image; searching for a boundary line of the two-dimensional code image; segmenting each of the regions into bit regions each of which corresponds to one bit data; re-acquiring the received two-dimensional code image stored in the image data backup register; calculating an average gray-scale value of all the pixels in the bit region as a gray-scale value of the bit region; calculating a gray-scale threshold of each of the bit regions n using the Otsu method; binarizing the bit region so as to obtain a binarized two-dimensional code image; and decoding the binarized two-dimensional code image. In the system, the two-dimensional code image is segmented precisely, thereby effecting quick and accurate decoding.

Abstract: A method includes: dividing a received QR code image into a multi-row image of rows of pixels whose number is the same as a threshold of the number of rows; calculating an average grayscale value of each column of pixels to form row data, and binarizing the row data; extracting a rectangle image in the binarized row data whose similarity to a preset proportion is smaller than a threshold; binarizing the rectangle image and a region formed by extending the rectangle image by the width threshold upwardly and downwardly respectively; searching for column line segments meeting the preset proportion on a middle column of the rectangle image; translating a diagonal line of a square image in upward and downward directions respectively; searching for and recording black-white demarcation points on the edge of the square image on the translated diagonal line and forming a position detection pattern of the QR code.

Abstract: The invention provides a method and system for decoding two-dimensional code using weighted average gray-scale algorithm. The method comprises: segmenting a received two-dimensional code image into bit regions each containing one bit data; presetting a shifting threshold, and shifting four original boundary lines of the bit region outwards by a distance of the shifting threshold to obtain four preset boundary lines; calculating an average gray-scale value of the bit region using the weighted average algorithm by taking an overlapping area between pixels inside the four preset boundary lines and the bit region as a weight; binarizing the two-dimensional code image according to the average gray-scale value of the bit region; and decoding the two-dimensional code image. The influence of the pixels which have an overlapping area with the bit region on the average gray-scale value of the bit region is considered, and the decoding accuracy and success rate are high.

Abstract: A decoding method includes that when encoding at a sending terminal, for a m-order primitive polynomial P(x), a primitive field element in galois field GF(2m) is represented by ?; a lookup table f(?j) for different power exponents of ? is established, where the value of j is selected from all the integers ranging from 0 to 2m?1, with a total number of 2m; a generator polynomial G(x) is expanded to obtain a polynomial with respect to x, with coefficients being an addition or subtraction of the power exponents of ?; a remainder polynomial R(x), obtained by dividing code word polynomial Q(x) by the generator polynomial G(x), is a polynomial with respect to x, with coefficients being an addition or subtraction of the power exponents of ?; and the coefficients of the generator polynomial G(x) and the remainder polynomial R(x) are both calculated using data found in the lookup table f(?j).