WO2013166995A1 - 一种矩阵式二维码的解码方法 - Google Patents
一种矩阵式二维码的解码方法 Download PDFInfo
- Publication number
- WO2013166995A1 WO2013166995A1 PCT/CN2013/075517 CN2013075517W WO2013166995A1 WO 2013166995 A1 WO2013166995 A1 WO 2013166995A1 CN 2013075517 W CN2013075517 W CN 2013075517W WO 2013166995 A1 WO2013166995 A1 WO 2013166995A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- code
- point
- image
- matrix
- projection
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 54
- 239000011159 matrix material Substances 0.000 claims abstract description 28
- 230000005484 gravity Effects 0.000 claims description 23
- 238000010586 diagram Methods 0.000 claims description 8
- 230000001186 cumulative effect Effects 0.000 claims 1
- 238000004364 calculation method Methods 0.000 description 3
- 238000007405 data analysis Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 208000030533 eye disease Diseases 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 239000000758 substrate Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1408—Methods for optical code recognition the method being specifically adapted for the type of code
- G06K7/1417—2D bar codes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1439—Methods for optical code recognition including a method step for retrieval of the optical code
- G06K7/1443—Methods for optical code recognition including a method step for retrieval of the optical code locating of the code in an image
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1439—Methods for optical code recognition including a method step for retrieval of the optical code
- G06K7/1456—Methods for optical code recognition including a method step for retrieval of the optical code determining the orientation of the optical code with respect to the reader and correcting therefore
Definitions
- the present invention relates to a two-dimensional code, and more particularly to a method for decoding a matrix two-dimensional code.
- MPR QR codes For MPR QR codes, please see the MPR Publications Industry Standards, including MPR Publication Part 1 (MPR Code Symbol Specification, Standard Number: CY/T 58.1-2009), Part 2 (MPR Code Encoding Rules, Standard Number: CY/T 58.2-2009), Part 3 (General Manufacturing Practices, Standard Number: CY/T 58.3-2009), Part 4 (MPR Code Print Quality Requirements and Inspection Methods, Standard Number: CY/T 58.4-2009 And Part 5 (Basic Management Practices, Standard Number: CY/T 58.5-2009).
- MPR Publication Part 1 MPR Code Symbol Specification, Standard Number: CY/T 58.1-2009
- Part 2 MPR Code Encoding Rules, Standard Number: CY/T 58.2-2009
- Part 3 General Manufacturing Practices, Standard Number: CY/T 58.3-2009
- Part 4 MPR Code Print Quality Requirements and Inspection Methods, Standard Number: CY/T 58.4-2009 And Part 5 (Basic
- the speech reading publication in the aforementioned Chinese invention patent is printed with a code pattern array, wherein the code pattern symbols in the code pattern array are rectangles, and the bar code units in the code picture symbols are solid points arranged at equal intervals, located at the four corners of the code picture.
- the unit is an anchor point for boundary location and identification, and the remaining units are data points, and the area of the anchor point is larger than the area of the data point.
- the code map symbols are repeatedly arranged on the substrate, seamlessly spliced into a code pattern array, the code pattern array includes at least two identical code map symbols, and the adjacent code patterns share the positioning points; the data point units are all in phase The center of the adjacent positioning point unit is connected within a rectangular frame.
- the decoding method is as follows: First, the positioning point is selected; then the positioning point unit is rectangularly matched, and after a single code pattern symbol is selected, the data points are grouped and the data point matrix is reconstructed. Specifically, the following steps are included:
- the decoding method of the invention needs to select a complete unit code map containing at least four anchor points to perform a rectangular matching, so that the code map area to be acquired is relatively large.
- 1 shows the minimum area of the code map that needs to be obtained in the worst case of the present invention and the prior art.
- the larger rectangle on the outside is the minimum area of the code map that is required to be obtained in the prior art, that is, 6 times the unit code map.
- the area, and the smaller rectangle in the inner dashed box is the minimum area of the code map that is required to be obtained by the present invention, that is, twice the area of the unit code map.
- the invention solves the inconvenience caused by the prior art reading device having to read a large code map area, and provides a decoding method for the reading device to read the code map area to be decoded.
- the technical solution of the present invention is: a matrix type two-dimensional code decoding method, wherein the decoded matrix type two-dimensional code image is a matrix two-dimensional code symbol joint code matrix formed by combining a plurality of identical unit code patterns;
- the image obtained by scanning does not need to include a single complete unit code map, and the decoding process is: acquiring a binarized image of a matrix-type two-dimensional code symbol-coupled code matrix to be decoded, and positioning each code point and the positioning point in the unit to which it belongs The position in the code map, in order to restore a complete unit code map, and then decode.
- the positioning of each code point and the positioning point in the unit code map to which it belongs refers to assigning coordinate values to each code point and the positioning point, and each code point and the positioning point determined by the coordinate value are obtained by scanning Each code point and positioning point in the image has the same relative positional relationship.
- assigning coordinate values to each code point and the positioning point includes the following steps:
- the line coordinates of each code point and the positioning point are calibrated by the dot pitch in the row direction and the projection waveform in the direction, and the column coordinates of the code point positioning points are calibrated by the dot pitch in the column direction and the projection waveform in the direction.
- a set of row parallel lines and a set of column parallel lines are respectively formed to form a grid, and the distance between the row parallel lines and the column parallel lines is respectively in the column line and the row line direction in the code graph.
- the determining of the row direction and the column direction comprises the following steps:
- A1. Identify the binarized image to determine the center of gravity of each code point and anchor point; A2. Projecting the center of gravity of each code point in the acquired image to any straight line L, calculating the number of each projection point and the average of all the projection points, and calculating the mean square error 0 0;
- the point spacing is determined by a method of finding a discrete signal period by an autocorrelation method, as follows:
- the maximum value of the mean square error in the step A6 corresponds to the code state n' times in the image state, and the maximum autocorrelation coefficient is calculated, and the point spacing f in the column direction can be obtained;
- e and e are the number of pixels, m ⁇ l , m is a natural number, m+n ⁇ e, m+n' f, m+n and m+n' are the number of pixels corresponding to the estimated point spacing .
- the image rotation is centered on the center of the image.
- the row parallel lines and the column parallel lines are determined by the following steps:
- each code point is marked according to the code structure characteristic of the two-dimensional code, and a complete unit two-dimensional code is restored according to the mark of each code point.
- the method for restoring the two-dimensional code is as follows:
- the dot order is marked as 9, 8, 7, and the loop is marked in this order;
- the beneficial effects of the present invention are - by locating the position of each code point in the unit code map to which it belongs, thereby restoring at least one complete unit code map, thereby decoding, so that the present invention is most severe in the case of code pattern rotation Decoding, only need twice the area of the unit code map, and the prior art decoding method requires at least six times the area of the unit code map. This is because the decoding method of the present invention does not require the reading device to read the complete unit code map, as long as the acquired code pattern image can finally combine a complete unit code map to complete the decoding, even if the acquired image is different.
- the segment of the unit code map does not matter, and the image has a certain tilt and has no effect.
- the decoding method of the prior art must be that the code picture image read by the reading device directly contains at least one complete code picture, so a larger area must be obtained to decode. Therefore, the decoding method of the present invention provides great convenience for the printing and reading equipment of the code pattern, that is, the code picture does not need to be printed much, and the reading device can be made smaller, so that it is convenient to carry and use. And reduce costs. Further, the present invention is also applicable to the case where the code image is tilted, and the amount of calculation is smaller than that of the prior art, saving resources.
- the outer rectangle is the minimum area of the code map that needs to be obtained in the prior art, that is, 6 times the area of the unit code map.
- the smaller rectangle in the inner dashed box is the minimum area of the code map that is required to be obtained by the present invention, that is, the area of the unit code map.
- Figure 2 is a schematic illustration of a code map image taken in an embodiment (which produces a certain tilt and rotation relative to Figure 1).
- Figure 3 is a schematic diagram of the image of Figure 2 after enhancement processing.
- Fig. 4 is an enlarged schematic view showing the image of Fig. 3 after binarization processing.
- FIG. 5 is an enlarged schematic view showing the image of FIG. 4 after being recognized.
- Fig. 6 is a schematic view showing the projection of the image of Fig. 4 at a rotation of 53 ° (the four triangular areas of the dotted line position indicate that when the image is rotated to this angle, the four corners are cut off when the operation is performed).
- Fig. 7 is a schematic view showing projection when the image of Fig. 4 is rotated by 90°.
- Fig. 8 is a schematic diagram of projection when the image of Fig. 4 is rotated by 124° (the four triangular areas of the dotted line position in the figure indicate that when the image is rotated to this angle, the four corners are cut off when the operation is performed).
- Fig. 9 is a schematic view showing projection when the image of Fig. 4 is rotated by 179°.
- Figure 10 is a schematic diagram of the projection values of the image of Figure 4 over a range of 0° to 180° (four peaks corresponding to 53 °, 90 °, 124 °, 179 °).
- Figure 11 is a schematic illustration of a grid constructed in the embodiment of Figure 2.
- Figure 12 is a schematic illustration of the restored unit code map.
- the prior art decoding method must read out a complete unit code map containing four anchor points (so-called unit code map, which is equivalent to the MPR two-dimensional code The code symbol), in order to do the rectangle matching, and then decode, that is to say, the prior art decoding method not only needs to read the four parts of the code map shown by A, B, C, D, but also needs to be the same
- the four parts of a unit code diagram the order of the four parts must be completely correct.
- only the four parts of the code map shown by A, B, C, and D need to be read to restore the unit code map, and there is no requirement for the order of the array, and whether it is the four parts of the same unit code map. There is no requirement.
- the code pattern of the embodiment includes code symbols of a plurality of MPR two-dimensional codes, and the code symbols of the plurality of MPR two-dimensional codes are seamlessly arranged together, and the positioning points of adjacent symbols (marking start and stop positions in the MPR code symbols)
- the shape of the anchor point is a circle or a regular polygon.
- the common, composed of a large area of the tile arrangement, the arrangement is called the symbolic link.
- An example of the symbolic link of the MPR code i.e., the code map printed in the MPR reading
- the positioning points may be replaced by positioning lines or the like, and are also composed of a plurality of seamlessly stitched unit code patterns, all of which can achieve the same effect and are decoded by the following method. Therefore, the positioning points described in the present invention also include a module with positioning information such as a positioning line.
- FIG. 3 it is a schematic diagram of a code image obtained by an embodiment.
- the acquired code image has a certain tilt and rotation with respect to Fig. 2 because of the operation at the time of reading and the accuracy of the reading device itself.
- FIG. 4 The schematic diagram of the enhanced processing of the acquired image is as shown in FIG. 4, and then binarized to become Figure 5 is a schematic view.
- the code point is performed on the basis of FIG. 5 (the bar indicating the valid data information in the MPR code symbol.
- the shape of the code point is a circle or a regular polygon.) Identify, identify and mark the center of gravity of each code point and the anchor point as shown in FIG. 6. Shown. The center of gravity of the code point and the anchor point is used as a subsequent processing step.
- the decoding method mainly includes the following steps: after binarizing the acquired image, positioning each code point and the position of the positioning point in the unit code map to which it belongs, thereby restoring at least one complete unit code map, and then decoding.
- locating each code point and the position of the positioning point in the unit code map to which the code point belongs includes the following steps: respectively determining the direction of the row line and the column line where each code point is located, which is called a row direction and a column direction; The dot pitch of the row direction and the column direction; the row coordinates of each code point are calibrated by the row direction and the dot pitch in the direction, and the column coordinates of each code point and the anchor point are calibrated by the column direction and the dot pitch in the direction.
- Positioning each code point and the position of the positioning point in the unit code map to which it belongs may also adopt the following steps: further identifying the image after the binarization processing to determine the center of gravity of each code point and the positioning point; determining the line in the image Direction and column direction; respectively, draw a set of row parallel lines and a set of column parallel lines in the row direction and the column direction to form a grid, and the distance between the row parallel lines and the column parallel lines are respectively the row line and the column line direction in the code picture
- the point spacing on the point, the point spacing is the spacing between the centers of gravity of adjacent code points; calculating the coordinates of each intersection point in the grid, thereby assigning coordinate values to the center of gravity of each code point and the positioning point in the image, the coordinate value That is, it represents the position of the code point and the anchor point in the unit code map to which it belongs.
- the determination of the row direction and the column direction is preferably as follows:
- the center of the image In the case where the image is rotated, it is preferable to use the center of the image as the center of rotation. In this case, the area swept by the image is the smallest and the amount of calculation is the smallest, but the other object can be used as the center of rotation.
- Figure 6-9 is a schematic view of the projection of the image at 53 °, 90 °, 124 °, and 179 ° in this embodiment.
- the principle of determining the direction of the column is the same as the principle of determining the direction of the row, just before projecting and calculating the mean square error.
- Rotating the image state corresponding to the row line by 90° ⁇ 21°, and taking the maximum value of the mean square error within the range (ie, the image state corresponding to the row line is turned over 69° to 11 ⁇ ) the maximum value corresponding to The direction in which the image state falls on the L line with the largest number of projection points is the column direction in which the direction perpendicular to the line of L is drawn.
- the calculation of the dot pitch preferably adopts the following method:
- the state diagram corresponding to the maximum value of the mean square error in the range of 69° to 11 ⁇ is shifted by ⁇ ′ times along the direction of the column line, and the maximum autocorrelation coefficient is calculated, and the point spacing f in the column direction can be obtained;
- e and e are the number of pixels, m ⁇ l , m is a natural number, m+n ⁇ e, m+n' f, m+n and m+n' are the number of pixels corresponding to the estimated point spacing .
- the row parallel lines and the column parallel lines are preferably determined by the following methods:
- a grid is constructed from the aforementioned row parallel lines and column parallel lines, as shown in FIG.
- the method of constructing the grid is to respectively extend the parallel lines of the rows and the parallel lines of the columns, and cross each other to form a grid.
- the coordinate values of each intersection point in the grid are calculated, and the coordinates of each code point in the acquired image are taken as the coordinate values of the intersection points in the grid closest to the distance.
- the coordinate value of the positioning point is determined based on coordinate values of four code points adjacent thereto.
- the reference point may not be the center point of the image, but any point on the image may be selected, and even the point that the image assumes may be used as a reference point.
- the method for restoring the two-dimensional code is as follows (if it is another matrix type two-dimensional code, it only needs to be restored according to the coding rule of the matrix type two-dimensional code) - the module size of the positioning point should be the code point module size 2 times. Focus on the code points and locate each When the code point is in the position of the unit code map, it also identifies and locates the center of gravity of the positioning point, and marks the area information of the positioning point (such as recording the area information), so as to extract the positioning point when the two-dimensional code is subsequently restored. Reference.
- the specific positioning method is: the center of gravity projection coordinates neither fall on the row line nor on the column line, and the size of the module in the code map image corresponding to the center of gravity is 2 times larger than the size of the module falling on the row and column lines. Or more than 2 times.
- the positioning point has the following features:
- the positioning point When determining the coordinate value of the code point row or column or assigning the coordinate value to the code point, the positioning point is marked at the same time for later reference.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Artificial Intelligence (AREA)
- General Health & Medical Sciences (AREA)
- Toxicology (AREA)
- Electromagnetism (AREA)
- Health & Medical Sciences (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
- Image Analysis (AREA)
- Error Detection And Correction (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Description
Claims
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/400,460 US9665759B2 (en) | 2012-05-11 | 2013-05-10 | Decoding method for matrix two-dimensional code |
KR1020147034638A KR101612700B1 (ko) | 2012-05-11 | 2013-05-10 | 매트릭스 qr코드 해독방법 |
IN2495MUN2014 IN2014MN02495A (zh) | 2012-05-11 | 2013-05-10 | |
EP13787658.7A EP2849115B1 (en) | 2012-05-11 | 2013-05-10 | Method for decoding matrix-type two-dimensional code |
SG11201408234PA SG11201408234PA (en) | 2012-05-11 | 2013-05-10 | Decoding method for matrix two-dimensional code |
JP2015510632A JP5905642B2 (ja) | 2012-05-11 | 2013-05-10 | マトリックス型2次元コードの復号化方法 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210145746.2 | 2012-05-11 | ||
CN201210145746.2A CN102708349B (zh) | 2012-05-11 | 2012-05-11 | 一种矩阵式二维码的解码方法 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2013166995A1 true WO2013166995A1 (zh) | 2013-11-14 |
Family
ID=46901095
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2013/075517 WO2013166995A1 (zh) | 2012-05-11 | 2013-05-10 | 一种矩阵式二维码的解码方法 |
Country Status (8)
Country | Link |
---|---|
US (1) | US9665759B2 (zh) |
EP (1) | EP2849115B1 (zh) |
JP (1) | JP5905642B2 (zh) |
KR (1) | KR101612700B1 (zh) |
CN (1) | CN102708349B (zh) |
IN (1) | IN2014MN02495A (zh) |
SG (1) | SG11201408234PA (zh) |
WO (1) | WO2013166995A1 (zh) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115600619A (zh) * | 2022-12-13 | 2023-01-13 | 深圳思谋信息科技有限公司(Cn) | 点阵二维码识别方法、装置、电子设备及存储介质 |
Families Citing this family (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102708349B (zh) | 2012-05-11 | 2014-11-05 | 深圳市天朗时代科技有限公司 | 一种矩阵式二维码的解码方法 |
CN104517089B (zh) * | 2013-09-29 | 2017-09-26 | 北大方正集团有限公司 | 一种二维码解码系统及其方法 |
CN104700062B (zh) * | 2015-03-20 | 2017-06-27 | 中国联合网络通信集团有限公司 | 一种识别二维码的方法及设备 |
CN104657700B (zh) * | 2015-03-25 | 2017-07-25 | 广州宽度信息技术有限公司 | 一种二维码抗损坏解码方法 |
CN105701435A (zh) * | 2016-01-12 | 2016-06-22 | 信码互通(北京)科技有限公司 | 一种可实现自我验证的多码关联编码方法及解码方法 |
CN105894067B (zh) | 2016-02-06 | 2018-08-07 | 深圳市天朗时代科技有限公司 | 一种点阵二维码的编码和识读方法 |
CN105760919B (zh) | 2016-02-06 | 2018-08-07 | 深圳市天朗时代科技有限公司 | 一种点阵二维码的编码和识别方法 |
CN106778998A (zh) * | 2016-11-28 | 2017-05-31 | 北京慧眼智行科技有限公司 | 一种彩色二维码的生成方法和装置 |
CN110188582B (zh) * | 2019-05-27 | 2022-08-12 | 广东石油化工学院 | 一种商品标签上隐形图形编码中定位点识别方法 |
CN110487283B (zh) * | 2019-09-17 | 2023-04-11 | 国微集团(深圳)有限公司 | 可识别的码点块以及基于该码点块的导航方法及系统 |
CN111220092B (zh) * | 2019-12-10 | 2021-04-23 | 东南大学 | 一种光学测量中条纹滤波器的构造方法 |
CN111597853B (zh) * | 2020-05-26 | 2023-02-24 | 成都鹏业软件股份有限公司 | 一种混凝土标识提取方法 |
CN111597856B (zh) * | 2020-05-26 | 2023-04-07 | 成都鹏业软件股份有限公司 | 一种基于光敏变色材料的混凝土标识提取方法 |
DE102020130929A1 (de) * | 2020-07-31 | 2022-02-03 | Technische Universität Dortmund | Verfahren und Vorrichtung zur Auswertung von Matrixcodes |
KR102606663B1 (ko) | 2021-04-20 | 2023-11-24 | 김종명 | 큐브의 배치 조합을 통한 콘텐츠 정보 형성 기능을 구비하는 코드 매칭 시스템 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1963843A (zh) * | 2006-11-16 | 2007-05-16 | 深圳矽感科技有限公司 | 二维码及其解码方法、应用该二维码的印刷出版物 |
CN101587556A (zh) * | 2009-04-08 | 2009-11-25 | 广东威创视讯科技股份有限公司 | 一种二维条码及其识别方法 |
CN101882210A (zh) * | 2010-06-01 | 2010-11-10 | 福建新大陆电脑股份有限公司 | 矩阵式二维条码解码芯片及其解码方法 |
CN101978380A (zh) * | 2008-01-29 | 2011-02-16 | 威泰克公司 | 二维符号及其读取方法 |
CN102708349A (zh) * | 2012-05-11 | 2012-10-03 | 深圳市天朗时代科技有限公司 | 一种矩阵式二维码的解码方法 |
Family Cites Families (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6371373B1 (en) * | 1999-05-25 | 2002-04-16 | Matsushita Electric Industrial Co., Ltd. | Method for reading a two-dimensional barcode |
SE517445C2 (sv) | 1999-10-01 | 2002-06-04 | Anoto Ab | Positionsbestämning på en yta försedd med ett positionskodningsmönster |
EP1143372B1 (en) * | 2000-04-06 | 2006-03-22 | Seiko Epson Corporation | Method of and apparatus for reading a two-dimensional bar code symbol and data storage medium |
JP4013027B2 (ja) * | 2001-04-19 | 2007-11-28 | オムロン株式会社 | 2次元コード読取装置 |
CN1294519C (zh) * | 2003-05-22 | 2007-01-10 | 武汉矽感科技有限公司 | 二维条码的编码和解码方法 |
KR100414524B1 (ko) * | 2002-10-31 | 2004-01-16 | 주식회사 아이콘랩 | 복호 특성이 우수하며 단계별 에러레벨조정이 가능한2차원 코드 및 그 코드의 인코딩 디코딩 방법 |
SE0203853D0 (sv) * | 2002-12-23 | 2002-12-23 | Anoto Ab | Informationskod |
JP4364615B2 (ja) | 2003-11-28 | 2009-11-18 | 横浜ゴム株式会社 | 2次元コード表示物及び2次元コード表示タイヤ |
CN100481117C (zh) * | 2004-03-15 | 2009-04-22 | 武汉矽感科技有限公司 | 一种二维条码编解码方法 |
JP2007172304A (ja) * | 2005-12-22 | 2007-07-05 | Sony Corp | 2次元バーコード、情報処理装置、情報処理方法、並びにプログラム |
CN1885311A (zh) * | 2006-05-29 | 2006-12-27 | 深圳矽感科技有限公司 | 二维码及其编解码方法 |
JP2007323498A (ja) * | 2006-06-02 | 2007-12-13 | Daido Steel Co Ltd | 情報コード表示シート |
AU2006252254B2 (en) | 2006-12-22 | 2009-03-05 | Canon Kabushiki Kaisha | Multiple barcode detection |
CN101710385B (zh) * | 2009-12-28 | 2013-05-29 | 天津优尼莱博泰克电子科技发展有限公司 | 高性能二维条形码解码方法 |
-
2012
- 2012-05-11 CN CN201210145746.2A patent/CN102708349B/zh active Active
-
2013
- 2013-05-10 IN IN2495MUN2014 patent/IN2014MN02495A/en unknown
- 2013-05-10 KR KR1020147034638A patent/KR101612700B1/ko active IP Right Grant
- 2013-05-10 EP EP13787658.7A patent/EP2849115B1/en active Active
- 2013-05-10 JP JP2015510632A patent/JP5905642B2/ja active Active
- 2013-05-10 SG SG11201408234PA patent/SG11201408234PA/en unknown
- 2013-05-10 US US14/400,460 patent/US9665759B2/en active Active
- 2013-05-10 WO PCT/CN2013/075517 patent/WO2013166995A1/zh active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1963843A (zh) * | 2006-11-16 | 2007-05-16 | 深圳矽感科技有限公司 | 二维码及其解码方法、应用该二维码的印刷出版物 |
CN101978380A (zh) * | 2008-01-29 | 2011-02-16 | 威泰克公司 | 二维符号及其读取方法 |
CN101587556A (zh) * | 2009-04-08 | 2009-11-25 | 广东威创视讯科技股份有限公司 | 一种二维条码及其识别方法 |
CN101882210A (zh) * | 2010-06-01 | 2010-11-10 | 福建新大陆电脑股份有限公司 | 矩阵式二维条码解码芯片及其解码方法 |
CN102708349A (zh) * | 2012-05-11 | 2012-10-03 | 深圳市天朗时代科技有限公司 | 一种矩阵式二维码的解码方法 |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115600619A (zh) * | 2022-12-13 | 2023-01-13 | 深圳思谋信息科技有限公司(Cn) | 点阵二维码识别方法、装置、电子设备及存储介质 |
CN115600619B (zh) * | 2022-12-13 | 2023-04-07 | 深圳思谋信息科技有限公司 | 点阵二维码识别方法、装置、电子设备及存储介质 |
Also Published As
Publication number | Publication date |
---|---|
CN102708349A (zh) | 2012-10-03 |
JP2015522861A (ja) | 2015-08-06 |
IN2014MN02495A (zh) | 2015-07-17 |
CN102708349B (zh) | 2014-11-05 |
KR101612700B1 (ko) | 2016-04-15 |
JP5905642B2 (ja) | 2016-04-20 |
EP2849115A1 (en) | 2015-03-18 |
US9665759B2 (en) | 2017-05-30 |
US20150129658A1 (en) | 2015-05-14 |
EP2849115A4 (en) | 2016-01-20 |
SG11201408234PA (en) | 2015-01-29 |
KR20150044848A (ko) | 2015-04-27 |
EP2849115B1 (en) | 2020-07-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2013166995A1 (zh) | 一种矩阵式二维码的解码方法 | |
JP4294025B2 (ja) | インターフェース表面を生成する方法、および符号化データを読み取る方法 | |
CN1641683B (zh) | 通过m阵列解码和快速图像匹配的笔划定位 | |
EP2393037B1 (en) | Data matrix decoding chip and decoding method thereof | |
CN110287854B (zh) | 表格的提取方法、装置、计算机设备和存储介质 | |
WO2017133532A1 (zh) | 一种点阵二维码的编码和识读方法 | |
CA2491843C (en) | Global localization by fast image matching | |
EP3023905A1 (en) | Systems and methods for decoding two-dimensional matrix symbols | |
JP2005267598A (ja) | 二次元バーコード及びその符号復号化方法 | |
WO2008058480A1 (fr) | Code bidimensionnel, procédé de décodage de celui-ci et publication d'impression pour appliquer un code bidimensionnel | |
EP3561729B1 (en) | Method for detecting and recognising long-range high-density visual markers | |
WO2021004414A1 (zh) | 编码图形及其编码和读取方法、标定板和标定方法 | |
US20120298754A1 (en) | Two-dimensional optical identification device with same gray level for quick decoding and decoding method therefor | |
TWI439943B (zh) | 點圖像編碼結構、其解碼方法與電子裝置 | |
JP6011885B2 (ja) | 符号読取装置および符号読取方法 | |
US8657205B2 (en) | Image processing apparatus, identification apparatus, method for determining bit sequence and computer readable medium | |
CN113297872B (zh) | 一种Dotcode识别方法、设备 | |
CN118037884B (zh) | 包含商标信息的二进制定位码生成方法、系统及设备 | |
KR102450872B1 (ko) | 도트 패턴 및 도트 패턴 인식 방법 | |
US8180155B2 (en) | Decoding method for a two dimensional dot code | |
Wang et al. | Application of Color Block Code in Image Scaling | |
Xu | ADVANCES IN IMAGE-BASED DATA HIDING, FEATURE DETECTION, GRID ALIGNMENT, AND DOCUMENT CLASSIFICATION | |
KR20220138937A (ko) | 3차원 스캔 데이터 추출을 위한 레퍼런스 프레임 | |
CN114463426A (zh) | 基于三角切分的平行四边形点云码设计与识别方法及系统 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 13787658 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2015510632 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14400460 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2013787658 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020147034638 Country of ref document: KR |