CN106875357A - Image in 2 D code processing method - Google Patents
Image in 2 D code processing method Download PDFInfo
- Publication number
- CN106875357A CN106875357A CN201710057565.7A CN201710057565A CN106875357A CN 106875357 A CN106875357 A CN 106875357A CN 201710057565 A CN201710057565 A CN 201710057565A CN 106875357 A CN106875357 A CN 106875357A
- Authority
- CN
- China
- Prior art keywords
- image
- convolution
- region
- processing method
- quick response
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 15
- 238000000034 method Methods 0.000 claims abstract description 23
- 230000003044 adaptive effect Effects 0.000 claims abstract description 4
- 239000011159 matrix material Substances 0.000 claims description 24
- 101100083446 Danio rerio plekhh1 gene Proteins 0.000 claims description 4
- 101100311460 Schizosaccharomyces pombe (strain 972 / ATCC 24843) sum2 gene Proteins 0.000 claims description 3
- 101100129500 Caenorhabditis elegans max-2 gene Proteins 0.000 claims description 2
- 238000010146 3D printing Methods 0.000 abstract description 4
- 238000005286 illumination Methods 0.000 abstract description 4
- 238000009499 grossing Methods 0.000 abstract description 3
- 239000000463 material Substances 0.000 abstract description 3
- 239000011347 resin Substances 0.000 abstract description 2
- 229920005989 resin Polymers 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 238000004519 manufacturing process Methods 0.000 description 4
- 238000001259 photo etching Methods 0.000 description 2
- 238000004080 punching Methods 0.000 description 2
- 239000003086 colorant Substances 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 238000007634 remodeling Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T5/00—Image enhancement or restoration
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a kind of image in 2 D code processing method, carried out according to following steps order：1）Obtain positioning region；2）Adjust after obtaining positioning region, it is square to use bilinear interpolation to adjust graphical rule；3）Algorithm is stretched with nonlinear gray to improve the contrast of image；4）To step 3）The result for obtaining is corroded；5）With dimensional Gaussian convolution operator to image f (x, y) by block size for q*q carries out convolution；6）The binaryzation computing of adaptive threshold is carried out to image G (x, y) after convolution；7）The datamatrix Quick Response Codes of the standard that will be obtained are input into and are decoded into decoder.The present invention instead of smoothing method of the prior art using for the insensitive Quick Response Code of illumination variation using the method for gray scale stretching so that resolution increases.Identification of the present invention suitable for 3D printing resin material Quick Response Code.
Description
Technical field
The invention belongs to algorithm field, it is related to a kind of image processing method, and in particular to a kind of image in 2 D code treatment side
Method.
Background technology
The widely used Quick Response Code in Data Matrix Shi world manufacture fields.Data Matrix are the one of Quick Response Code
Individual member, was invented with 1989 by U.S. world data company, was widely used in false proof, the pool mark of commodity.It is that one kind can be with
The coding of the surface of solids is marked directly on, the coding can automatically be read as usual bar code by corresponding scanning means,
Favored by manufacturing industry very much.Current Data Matrix are widely used in product identification, false proof, quality tracing, automatic stored, logistics
The system such as management and control.Data Matrix employ the error-correcting code technique of complexity so that the coding has superpower antipollution
Ability.Even if coded portion is damaged, reading full detail is not interfered with equally.The print characteristics of Data Matrix cause it into
For currently the only support can be marked directly（Print, scribe, photoetching, the mode such as burn into punching press）In product or component surface
Coding.Its efficient fault freedom allows it to bear the pollution identified to component surface in manufacture or the process of circulation, because
This receives manufacturing welcome very much.For a variety of applications, the Data of diversified forms has been promulgated in the world
Matrix symbol standards systems.The minimum dimension of Data Matrix is minimum in current all bar codes, especially particularly suitable
In the mark of finding, and it is directly printed on physically.
Data Matrix can be divided into ECC000-140 and ECC200 two types again, and ECC000-140 has various differences
The error correcting function of grade, and ECC200 then produces polynomial computation to make mistake correction through Reed-Solomon algorithms
Code, its size can on demand be printed as different size, but the error correcting code for using should with dimensional fits, due to its algorithm compared with
For easy, and size is more resilient, therefore general more universal with ECC200.Data Matrix code densities are high, and size is small, information
Amount is big, domestic also less to DM yards of research to this identification there is provided possible.Data Matrix yards is a kind of matrix type two-dimension
Bar code, its maximum feature is exactly density high, and its minimum dimension is the code of minimum in current all bar codes.DM yards can be only
25mm2Area on encode 30 numerals.DM employs the error-correcting code technique of complexity so that the coding has superpower antipollution
Ability.Data Matrix can still deposit rational data content because providing minimum and highdensity label, therefore particularly suitable
Identified in finding, commodity counterfeit prevention, circuit identifier etc..Due to its outstanding error correcting capability, DM yards oneself turn into South Korea's mobile phone two dimension
The mainstream technology of bar code.For QR, DM yards few due to information capacity difference, using simple, is referred to as in the industry " simple
Code ", not high to demanding terminal, the mobile phone of 300,000 pixels just can recognize that, it is more the increment based on WAP.Quick Response Code is to hand
Machine online brings new entrance, and by scanning all kinds of bar codes, user will soon enter WAP site, carry out fast browsing.
Data Matrix symbols look like a chessboard being made up of two kinds of colors of the depth, each formed objects
Black or white boxes are referred to as a data unit, and Data Matrix symbols are exactly to be made up of many such data units.
Seek border area outer layer to have width is a dead zone for data unit.The border that border area is " chessboard " is sought, is served only for positioning and defining number
According to unit-sized, and any coding information is not contained.Coding information is included by the data field for seeking border area encirclement.
Mostly printed using Data Matrix in the prior art, scribed, photoetching, the mode, these modes such as burn into punching press
The RM of the Quick Response Code of generation is simpler, because the resolution at its edge is higher, but by the way of 3D printing, directly
Generation Quick Response Code, its identification edge is relatively obscured, it is more difficult to realize positioning, also, due to material reason, under illumination condition, contrast
Degree is relatively poor, and when being processed to identification, difficulty is larger, therefore, study a kind of two dimension that can be directed to the generation of 3D printing method
The method that code carries out image procossing, has great importance.
The content of the invention
The technical problem to be solved in the present invention, is to provide a kind of image in 2 D code processing method, using for illumination variation
Insensitive Quick Response Code, smoothing method of the prior art is instead of using the method for gray scale stretching so that resolution increases.
In order to solve the above technical problems, the technical solution used in the present invention is：
A kind of image in 2 D code processing method, is carried out according to following steps order：
1）Obtain positioning region；
2）Adjust after obtaining positioning region, the code system standard according to datamatrix Quick Response Codes, adjusted using bilinear interpolation and schemed
As yardstick is square；
3）Algorithm is stretched with nonlinear gray to improve the contrast of image；
4）To step 3）The result for obtaining is corroded, to eliminate the shade caused by light source deviation；
5）With dimensional Gaussian convolution operator to image f (x, y) by block size for q*q carries out convolution；
6）The binaryzation computing of adaptive threshold is carried out to image G (x, y) after convolution, so as to what is handled well
Datamatrix Quick Response Codes；
7）The datamatrix Quick Response Codes of the standard that will be obtained are input into and are decoded into decoder.
As a kind of restriction of the invention, described step 2）Specific method be：
（a）If new images location of pixels is (m, n), multiplication factor is respectively k, p, then location of pixels is in original image after adjusting
Correspondence position is：；
（b）If four points of original image, f (i, j), f (i+1, j), f (i, j+1), f (i+1, j+1) calculate 4 interpolation in region,
Obtain pixel value f (x, y) of new images corresponding position：
Wherein,,b, and：
a=x-i；b=y-j；
（c）By adjusting parameter k and p, image is become the square of p*q width；Wherein, p is the code word number of Quick Response Code, q
It is the yardstick for extending p.
As another restriction of the invention, described step 3）Specific method be：
（a）If the minimum gray value of image f (x, y) is min, gray scale maximum is max, then gradation of image average is：
；
（b）According to gray average calculated minimum E：
Setting e1=0.05, e2=0.95, E=min (E1, E2), eps be one level off to 0 constant；
Wherein,；
（c）The E that will be obtained brings into equation and calculates, and obtains the enhanced image of contrast, if function input picture d=f (x, y),
Then accounting equation is：。
As the further restriction of above-mentioned restriction, described step b）Middle eps is 10-26~10-28。
As the third restriction, described step 4 of the invention）Specific method be：Setting structure element g is to image f
(x, y) is corroded：
(fΘg)(s, t)=min{f(s+x, t+y)- g(s,t)|s+x, t+y∈Df , x+y∈Dg }
Wherein, g is structural element, and s is the yardstick of vertical direction, and t is the yardstick of structural element horizontal direction, Df be image f (x,
Y) border of vertical direction, Dg is the border of image f (x, y) horizontal direction.
As 4th kind of the invention restriction, described step 5）Middle convolution results export the matrix of 12 × 12, should
The value of each pixel represents the Gauss weighted mean of each block in matrix；
Wherein Gauss operator is： g(x,y)=；
If the image after convolution is G (x, y), then：G(x,y)=g(x,y)*f(x,y)；Wherein, g (x, y) be Gauss operator, f (x,
Y) it is image, G (x, y) is the image after convolution, and σ is the standard deviation of Gaussian function, and σ=0.5, " * " is convolution operator, Gauss
The yardstick of operator is q.
The present invention also has a kind of restriction, described step 6）Specific method be：
（a）The matrix application maximum variance between clusters of 12 × 12 for obtaining calculate to form binaryzation region；
（b）If the span of pixel is min ~ max in region, sum of all pixels mesh is N in the region, if the region binaryzation
Optimal threshold is T, wherein T ∈ min ~ max, when threshold value is Ti：
i）If the area grayscale value more than Ti number of pixels be sum1, pixel value and be max1, then its gray average is：；Its weights is：；
ii）The area grayscale value less than Ti number of pixels be sum2, pixel value and be max2, then its gray average is：；Its weights is：；
iii）The overall intensity average for obtaining the region is：；
So as to obtain two parts variance and be：；
All of Ti is traveled through, the threshold value of maximum variance value will be obtained as by the threshold value of the region binaryzation.
As a result of above-mentioned technical scheme, compared with prior art, acquired technological progress is the present invention：
The present invention instead of of the prior art using for the insensitive Quick Response Code of illumination variation using the method for gray scale stretching
Smoothing method so that resolution increases.
Identification of the present invention suitable for 3D printing resin material Quick Response Code.
The present invention is described in further detail below in conjunction with Figure of description with specific embodiment.
Brief description of the drawings
Fig. 1 is the step 1 of the embodiment of the present invention 1）Schematic diagram；
Fig. 2 is the step 2 of the embodiment of the present invention 1）Schematic diagram；
Fig. 3 is the step 3 of the embodiment of the present invention 1）Schematic diagram；
Fig. 4 is the step 4 of the embodiment of the present invention 1）Schematic diagram；
Fig. 5 is the step 5 of the embodiment of the present invention 1）Schematic diagram；
Fig. 6 is the step 6 of the embodiment of the present invention 1）Schematic diagram.
Specific embodiment
A kind of image in 2 D code processing method of embodiment 1
A kind of image in 2 D code processing method, is carried out according to following steps order：
1）Positioning region is obtained, as shown in Figure 1；
2）Adjust after obtaining positioning region, the code system standard according to datamatrix Quick Response Codes, adjusted using bilinear interpolation and schemed
As yardstick is square, as shown in Figure 2；
（a）If new images location of pixels is (m, n), multiplication factor is respectively k, p, then location of pixels is in original image after adjusting
Correspondence position is：；
（b）If four points of original image, f (i, j), f (i+1, j), f (i, j+1), f (i+1, j+1) calculate 4 interpolation in region,
Obtain pixel value f (x, y) of new images corresponding position：
Wherein,,b, and：
a=x-i；b=y-j；
（c）By adjusting parameter k and p, image is become the square of p*q width；Wherein, p is the code word number of Quick Response Code, q
It is the yardstick for extending p.
3）Stretch algorithm with nonlinear gray to improve the contrast of image, as shown in figure 3, its method is：
（a）If the minimum gray value of image f (x, y) is min, gray scale maximum is max, then gradation of image average is：
；
（b）According to gray average calculated minimum E：
Setting e1=0.05, e2=0.95, E=min (E1, E2), eps be one level off to 0 constant, eps is 10-26~10-28.；
Wherein,；
（c）The E that will be obtained brings into equation and calculates, and obtains the enhanced image of contrast, if function input picture d=f (x, y),
Then accounting equation is：。
4）To step 3）The result for obtaining is corroded, to eliminate the shade caused by light source deviation, as shown in figure 4, tool
Body method is：Setting structure element g corrodes to image f (x, y)：
(fΘg)(s, t)=min{f(s+x, t+y)- g(s,t)|s+x, t+y∈Df , x+y∈Dg }
Wherein, g is structural element, and the yardstick of s vertical directions, t is the yardstick of structural element horizontal direction, and Df is image f (x, y)
The border of vertical direction, Dg is the border of image f (x, y) horizontal direction.
5）With dimensional Gaussian convolution operator to image f (x, y) by block size for q*q carries out convolution, as shown in figure 5, convolution
Result exports the matrix of 12 × 12, and the value of each pixel represents the Gauss weighted mean of each block in the matrix；Wherein
Gauss operator is： g(x,y)=；
If the image after convolution is G (x, y), then：G(x,y)=g(x,y)*f(x,y)；Wherein, g (x, y) be Gauss operator, f (x,
Y) it is image, G (x, y) is the image after convolution, and σ is the standard deviation of Gaussian function, and σ=0.5, " * " is convolution operator, Gauss
The yardstick of operator is q.
6）The binaryzation computing of adaptive threshold is carried out to image G (x, y) after convolution, so as to what is handled well
Datamatrix Quick Response Codes, as shown in fig. 6, specific method is：
（a）The matrix application maximum variance between clusters of 12 × 12 for obtaining calculate to form binaryzation region；
（b）If the span of pixel is min ~ max in region, sum of all pixels mesh is N in the region, if the region binaryzation
Optimal threshold is T, wherein T ∈ min ~ max, when threshold value is Ti：
i）If the area grayscale value more than Ti number of pixels be sum1, pixel value and be max1, then its gray average is：；Its weights is：；
ii）The area grayscale value less than Ti number of pixels be sum2, pixel value and be max1, then its gray average is：；Its weights is：；
iii）The overall intensity average for obtaining the region is：；
So as to obtain two parts variance and be：；
All of Ti is traveled through, the threshold value of maximum variance value will be obtained as by the threshold value of the region binaryzation.
7）The datamatrix Quick Response Codes of the standard that will be obtained are input into and are decoded into decoder.
The above, is only presently preferred embodiments of the present invention, is not the restriction for making other forms to the present invention, is appointed
What those skilled in the art is changed as enlightenment possibly also with above-mentioned technology contents or is modified as equivalent variations
Equivalent embodiments.But, it is every without departing from the technology of the present invention design, above example is made according to technical spirit of the invention
The simple modification for going out, equivalent variations and remodeling, still fall within the protection domain of the claims in the present invention.
Claims (7)
1. a kind of image in 2 D code processing method, it is characterised in that it is carried out according to following steps order：
1）Obtain positioning region；
2）Adjust after obtaining positioning region, the code system standard according to datamatrix Quick Response Codes, adjusted using bilinear interpolation and schemed
As yardstick is square；
3）Algorithm is stretched with nonlinear gray to improve the contrast of image；
4）To step 3）The result for obtaining is corroded, to eliminate the shade caused by light source deviation；
5）With dimensional Gaussian convolution operator to image f (x, y) by block size for q*q carries out convolution；
6）The binaryzation computing of adaptive threshold is carried out to image G (x, y) after convolution, so as to what is handled well
Datamatrix Quick Response Codes；
7）The datamatrix Quick Response Codes of the standard that will be obtained are input into and are decoded into decoder.
2. image in 2 D code processing method according to claim 1, it is characterised in that：Described step 2）Specific method
For：
（a）If new images location of pixels is (m, n), multiplication factor is respectively k, p, then location of pixels is in the right of original image after adjusting
The position is answered to be：；
（b）If four points of original image, f (i, j), f (i+1, j), f (i, j+1), f (i+1, j+1) calculate 4 interpolation in region,
Obtain pixel value f (x, y) of new images corresponding position：
Wherein,,b, and：
a=x-i；b=y-j；
（c）By adjusting parameter k and p, image is become the square of p*q width；Wherein, p is the code word number of Quick Response Code, q
It is the yardstick for extending p.
3. image in 2 D code processing method according to claim 1, it is characterised in that：Described step 3）Specific method
For：
（a）If the minimum gray value of image f (x, y) is min, gray scale maximum is max, then gradation of image average is：
；
（b）According to gray average calculated minimum E：
Setup parameter e1=0.05, e2=0.95, E=min (E1, E2), eps be one level off to 0 constant；
Wherein,；
（c）The E that will be obtained brings into equation and calculates, and obtains the enhanced image of contrast, if function input picture d=f (x, y),
Then accounting equation is：。
4. image in 2 D code processing method according to claim 3, it is characterised in that：Described step b）Middle eps is 10-26~10-28。
5. image in 2 D code processing method according to claim 1, it is characterised in that：Described step 4）Specific method
For：Setting structure element g corrodes to image f (x, y)：
(fΘg)(s, t)=min{f(s+x, t+y)- g(s,t)|s+x, t+y∈Df , x+y∈Dg }
Wherein, g is structural element, and s is the yardstick of vertical direction, and t is the yardstick of structural element horizontal direction, Df be image f (x,
Y) border of vertical direction, Dg is the border of image f (x, y) horizontal direction.
6. image in 2 D code processing method according to claim 1, it is characterised in that：Described step 5）Middle convolution results
The matrix that output is one 12 × 12, the value of each pixel represents the Gauss weighted mean of each block in the matrix；
Wherein normalized Gauss operator is： g(x,y)=；
If the image after convolution is G (x, y), then：G(x,y)=g(x,y)*f(x,y)；Wherein, g (x, y) is normalized Gauss
Operator, f (x, y) is image, and G (x, y) is the image after convolution, and σ is the standard deviation of Gaussian function, and σ=0.5, " * " is transported for convolution
Operator, the yardstick of Gauss operator is q.
7. image in 2 D code processing method according to claim 1, it is characterised in that：Described step 6）Specific method
For：
（a）The matrix application maximum variance between clusters of 12 × 12 for obtaining calculate to form binaryzation region；
（b）If the span of pixel is min ~ max in region, sum of all pixels mesh is N in the region, if the region binaryzation
Optimal threshold is T, wherein T ∈ min ~ max, when threshold value is Ti：
i）If the area grayscale value more than Ti number of pixels be sum1, pixel value and be max1, then its gray average is：；Its weights is：；
ii）The area grayscale value less than Ti number of pixels be sum2, pixel value and be max2, then its gray average is：；Its weights is：；
iii）The overall intensity average for obtaining the region is：；
So as to obtain two parts variance and be：；
All of Ti is traveled through, the threshold value of maximum variance value will be obtained as by the threshold value of the region binaryzation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710057565.7A CN106875357A (en) | 2017-01-26 | 2017-01-26 | Image in 2 D code processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710057565.7A CN106875357A (en) | 2017-01-26 | 2017-01-26 | Image in 2 D code processing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106875357A true CN106875357A (en) | 2017-06-20 |
Family
ID=59158364
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710057565.7A Pending CN106875357A (en) | 2017-01-26 | 2017-01-26 | Image in 2 D code processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106875357A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110046528A (en) * | 2018-11-20 | 2019-07-23 | 维库（厦门）信息技术有限公司 | A kind of dotted DataMatrix two-dimensional code identification method |
| CN110991457A (en) * | 2019-11-26 | 2020-04-10 | 北京达佳互联信息技术有限公司 | Two-dimensional code processing method and device, electronic equipment and storage medium |
| CN112651260A (en) * | 2020-12-30 | 2021-04-13 | 凌云光技术股份有限公司 | Method and system for converting self-adaptive discrete code into continuous code |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5644646A (en) * | 1994-08-05 | 1997-07-01 | University Of Utah Research Foundation | Vessel enhancement filtering in magnetic resonance angiography |
| CN102176243A (en) * | 2010-12-30 | 2011-09-07 | 浙江理工大学 | Target ranging method based on visible light and infrared camera |
| CN104463795A (en) * | 2014-11-21 | 2015-03-25 | 高韬 | Processing method and device for dot matrix type data matrix (DM) two-dimension code images |
-
2017
- 2017-01-26 CN CN201710057565.7A patent/CN106875357A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5644646A (en) * | 1994-08-05 | 1997-07-01 | University Of Utah Research Foundation | Vessel enhancement filtering in magnetic resonance angiography |
| CN102176243A (en) * | 2010-12-30 | 2011-09-07 | 浙江理工大学 | Target ranging method based on visible light and infrared camera |
| CN104463795A (en) * | 2014-11-21 | 2015-03-25 | 高韬 | Processing method and device for dot matrix type data matrix (DM) two-dimension code images |
Non-Patent Citations (3)
| Title |
|---|
| 张一凡: "Data Matrix二维条码预处理方法研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 王建宾: "基于粒子群优化絮体图像分割算法的设计和应用", 《中国优秀硕士论文全文数据库 信息科技辑》 * |
| 苗莎 等: "双线性插值图像放大并行算法的设计与实现", 《微电子学与计算机》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110046528A (en) * | 2018-11-20 | 2019-07-23 | 维库（厦门）信息技术有限公司 | A kind of dotted DataMatrix two-dimensional code identification method |
| CN110991457A (en) * | 2019-11-26 | 2020-04-10 | 北京达佳互联信息技术有限公司 | Two-dimensional code processing method and device, electronic equipment and storage medium |
| CN110991457B (en) * | 2019-11-26 | 2023-12-08 | 北京达佳互联信息技术有限公司 | Two-dimensional code processing method and device, electronic equipment and storage medium |
| CN112651260A (en) * | 2020-12-30 | 2021-04-13 | 凌云光技术股份有限公司 | Method and system for converting self-adaptive discrete code into continuous code |
| CN112651260B (en) * | 2020-12-30 | 2024-01-30 | 凌云光技术股份有限公司 | Method and system for converting self-adaptive discrete codes into continuous codes |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106991462B (en) | Three-dimensional code generating method | |
| US11514285B2 (en) | Artwork generated to convey digital messages, and methods/apparatuses for generating such artwork | |
| CN110569683B (en) | Bar code detection method and bar code detection system | |
| CN106529368B (en) | The method of two dimensional code identification region positioning | |
| CN105989317B (en) | Two-dimensional code identification method and device | |
| CN105069394A (en) | Two-dimension code weighted average gray level method decoding method and system | |
| CN106875357A (en) | Image in 2 D code processing method | |
| CN111783495B (en) | Bar code identification method and device, electronic equipment and storage medium | |
| CN107247985B (en) | Coding, positioning and identifying method of two-dimensional code | |
| CN110348264A (en) | A kind of QR image in 2 D code bearing calibration and system | |
| KR20160006595A (en) | Augmenting barcodes with secondary encoding for anti-counterfeiting | |
| CN113313225B (en) | Anti-counterfeiting method based on sparse dot matrix code | |
| CN103955730A (en) | Manufacturing method of anti-counterfeiting photo-etched two-dimensional code labels | |
| CN115456003A (en) | DPM two-dimensional code identification method and storage medium | |
| US8376235B2 (en) | Blur resistant barcode | |
| CA2376757C (en) | Image binarization method | |
| BR112013011943B1 (en) | method for identifying a two-dimensional bar code in digital image data of the bar code, non-transitory computer readable medium and apparatus configured to identify a two-dimensional bar code in digital image data of the bar code | |
| CN115270839A (en) | Industrial scene QR Code detection and identification method based on PPYOLOv2 model | |
| WO2022021687A1 (en) | Method for positioning quick response code area, and electronic device and storage medium | |
| CN116469090A (en) | Method and device for detecting code spraying pattern, electronic equipment and storage medium | |
| CN115239595A (en) | Method for detecting qualification of two-dimensional code of packaging printed matter | |
| CN106778435A (en) | Feature extracting method based on Image neighborhood structure tensor equation | |
| CN108174217B (en) | Image code generation and analysis method, electronic equipment and storage medium | |
| Prabhu et al. | An approach for improved data matrix distortion correction using median filtered hough transform | |
| CN112434543A (en) | Image reconstruction method and system for distorted color direct component marking |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 201210 Shanghai city Pudong New Area Zu Road No. 2305 A block 122 Building 2 North Gate God's favored one Applicant after: Shanghai Ya Fang dental Polytron Technologies Inc Address before: 201210 Shanghai city Pudong New Area Zu Road No. 2305 A block 122 Building 2 North Gate God's favored one Applicant before: Shanghai Smartee Dental Technology Co., Ltd. |
|
| CB02 | Change of applicant information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170620 |
|
| RJ01 | Rejection of invention patent application after publication |