CN107423653A - A kind of Quick Response Code preprocess method, system and coding/decoding method - Google Patents

A kind of Quick Response Code preprocess method, system and coding/decoding method Download PDF

Info

Publication number
CN107423653A
CN107423653A CN201710548082.7A CN201710548082A CN107423653A CN 107423653 A CN107423653 A CN 107423653A CN 201710548082 A CN201710548082 A CN 201710548082A CN 107423653 A CN107423653 A CN 107423653A
Authority
CN
China
Prior art keywords
quick response
response code
image
rectangular block
code
Prior art date
Application number
CN201710548082.7A
Other languages
Chinese (zh)
Inventor
沈勇坚
胡永刚
王翔平
Original Assignee
上海动联信息技术股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 上海动联信息技术股份有限公司 filed Critical 上海动联信息技术股份有限公司
Priority to CN201710548082.7A priority Critical patent/CN107423653A/en
Publication of CN107423653A publication Critical patent/CN107423653A/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06KRECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
    • G06K7/14Methods 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/1404Methods for optical code recognition
    • G06K7/1408Methods for optical code recognition the method being specifically adapted for the type of code
    • G06K7/14172D bar codes
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06KRECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
    • G06K7/14Methods 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/1404Methods for optical code recognition
    • G06K7/1439Methods for optical code recognition including a method step for retrieval of the optical code
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06KRECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
    • G06K7/14Methods 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/1404Methods for optical code recognition
    • G06K7/146Methods for optical code recognition the method including quality enhancement steps
    • G06K7/1491Methods for optical code recognition the method including quality enhancement steps the method including a reconstruction step, e.g. stitching two pieces of bar code together to derive the full bar code

Abstract

The invention discloses a kind of Quick Response Code preprocess method, system and coding/decoding method, pass through image binaryzation;Image splits rectangular block;Piecemeal judges whether containing Quick Response Code and marked;According to mark iteration extension two-dimension code area and calculate confidence level;Whether Quick Response Code is contained according to Credibility judgement image, and exports Quick Response Code effective coverage, thus comes in advance recognition target image whether contain Quick Response Code;Then the two-dimension code area after cutting can be parsed, by being cut to two-dimension code area in target image it is possible thereby to greatly improve Quick Response Code decoding speed on this basis.

Description

A kind of Quick Response Code preprocess method, system and coding/decoding method
Technical field
The present invention relates to coded treatment technology, and in particular to Quick Response Code identification technology.
Background technology
Quick Response Code is also known as QR Code, QR full name Quick Response, is one super popular on mobile device in recent years A kind of coded system, it can deposit more information than traditional Bar Code bar codes, can also represent more data types.
Two-dimensional bar code/Quick Response Code (2-dimensional bar code) is by a set pattern with certain specific geometric figure The chequered with black and white graphic recording data symbol information that rule is distributed in plane (on two-dimensional directional);On coding dexterously Using form " 0 " of computer-internal logical foundations, " 1 " bit stream concept, it is corresponding with binary system several using several What body represents word numerical information, by image input device or photoelectric scanning device automatically identifying and reading to realize that information is automatic Processing:It has some general character of barcode technology:Every kind of code system has its specific character set;Each character occupies certain width Degree;With certain verifying function etc..Also there is the information automatic identification function to not going together and processing figure rotation to become simultaneously Change point.
Identification for Quick Response Code, prior art are by searching position sensing figure and positioning figure in entire image To determine the presence of Quick Response Code.Due to position sensing figure and positioning figure accounting very little in entire image, while may relate to And the operation such as rotational correction, Slant Rectify and twist correcting to image, cause when Quick Response Code cognitive phase just takes longer Between, consume system resource.
Thereby resulting in existing Quick Response Code identification technology, hardware consumption is larger in actual use, generally existing decoding Slow-footed problem, its slow phenomenon of decoding speed on low and middle-end processor platform become apparent.
As can be seen here, there is provided a kind of hardware consumption is small, and the fast Quick Response Code identification technology of decoding speed is that this area needs solution badly Certainly the problem of.
The content of the invention
For the decoding speed present in existing Quick Response Code identification technology it is slow the problem of, it is necessary to a kind of quickly Quick Response Code solution Code technology.
Therefore, the technical problems to be solved by the invention are to provide a kind of Quick Response Code preprocess method, system and decoding side Method.
In order to solve the above-mentioned technical problem, Quick Response Code preprocess method provided by the invention, including:
Image binaryzation;
Image splits rectangular block;
Piecemeal judges whether containing Quick Response Code and marked;
According to mark iteration extension two-dimension code area and calculate confidence level;
Whether Quick Response Code is contained according to Credibility judgement image, and exports Quick Response Code effective coverage.
Further, when image binaryzation is handled, the threshold value of Binary Sketch of Grey Scale Image is calculated by iterative algorithm, According to this threshold value by image binaryzation.
Further, the iterative process of binaryzation threshold value includes:
Calculate the histogram data of image;
Minimum and maximum nonzero value in Nogata data is calculated, using minimum non-zero value as initial threshold, by both flat Average judges whether both are equal as initial new threshold value;
When unequal, histogram is divided into by two parts according to initial new threshold value, is averaging gray value respectively, it is flat by two The average of equal gray value is as new threshold value.
Further, piecemeal judges to include:
Whether each rectangular block of poll, the monochrome pixels for calculating each rectangular block than meet condition;
To meeting that the rectangular block of condition carries out the quartering, judge whether four sub-blocks meet preparatory condition;Marked if meeting For Quick Response Code effective district;
To marking the rectangular block for effective district, add up confidence level per continuous 2*2 blocks.
Further, 3*3 blocks are carried out to the rectangular block in confidence level region and expands Quick Response Code effective district, until current credible Degree is equal with a upper confidence level.
In order to solve the above-mentioned technical problem, Quick Response Code decoding pretreatment system provided by the invention, including:
Image binaryzation module, binary conversion treatment is carried out to target image;
Image splits rectangular block, and the target image of binaryzation is carried out splitting some rectangular blocks;
Piecemeal judges and mark module, judges whether every piece of rectangular block contains Quick Response Code and be marked;
Effective district expansion module, according to mark iteration extension two-dimension code area and calculate confidence level;
Output module, whether Quick Response Code is contained according to Credibility judgement image, and export Quick Response Code effective coverage.
In order to solve the above-mentioned technical problem, Quick Response Code coding/decoding method provided by the invention, is pre-processed by above-mentioned Quick Response Code Whether contain Quick Response Code in the advance recognition target image of method, and two-dimension code area in target image is cut, it is then right Two-dimension code area after cutting is parsed.
When it is implemented, small to hardware consumption, it is fast to greatly improve decoding speed for the pretreatment and decoding scheme of this Quick Response Code, The significant effect on low and middle-end processor platform.
Brief description of the drawings
The present invention is further illustrated below in conjunction with the drawings and specific embodiments.
Fig. 1 is the flow chart that this programme carries out Quick Response Code pretreatment;
Fig. 2 is the flow chart of image binaryzation in this programme Quick Response Code preprocessing process;
Fig. 3 is the flow chart that piecemeal judges in this programme Quick Response Code preprocessing process;
Fig. 4 is the flow chart in extremely efficient area in this programme Quick Response Code preprocessing process;
Fig. 5 is the composition schematic diagram that this programme Quick Response Code decodes pretreatment system;
Fig. 6 is original example images figure in present example;
Fig. 7 is the example images figure after binaryzation in present example;
Fig. 8 is to split schematic diagram to image after binaryzation in present example;
Fig. 9 is the example images figure detected in present example by the first step;
Figure 10 is the example images figure detected in present example by second step;
Figure 11 is that Quick Response Code effective district exemplary plot is extended in present example;
Figure 12 is that Quick Response Code effective district exemplary plot is exported in present example.
Embodiment
In order that the technical means, the inventive features, the objects and the advantages of the present invention are easy to understand, tie below Conjunction is specifically illustrating, and the present invention is expanded on further.
When carrying out Quick Response Code decoding, it is pre-processed this programme before Quick Response Code parsing first, thus improves two Tie up the speed of code decoding.
Whether this programme specifically in Quick Response Code barcode scanning decoding process, contains Quick Response Code in advance recognition target image, and Two-dimension code area in target image is cut, then is input in Quick Response Code parsing storehouse by the two-dimension code area after cutting Row parsing, it is possible thereby to accelerate the decoding speed of Quick Response Code.
This programme to target image by being pre-processed to identify whether contain Quick Response Code in the target image, accordingly Preprocessing process is following (referring to Fig. 1):
Step (1) carries out binaryzation to target image.
For the target image binary conversion treatment in this programme, Binary Sketch of Grey Scale Image is calculated by iterative algorithm Threshold value, according to this threshold value by image binaryzation.And the iterative process of wherein binaryzation threshold value is following (such as Fig. 2 institutes Show):
Step (11) obtains pending view data;
Step (12) calculates the histogram data of image;
Step (13) calculates minimum and maximum nonzero value, minValue, maxValue in Nogata data;Wherein by minimum Nonzero value minValue is as initial threshold TH, using the average value of the two as initial new threshold value THNew;
Whether step (14) judgment threshold TH and both new threshold value THNew are equal:If unequal, step (15) is transferred to; If equal, step (16) is transferred to;
Histogram is divided into two parts by step (15) according to threshold value TH, is averaging gray value respectively, by two average gray The average of value is as new threshold value THNew, then by new threshold value THNew compared with threshold value TH, until both are equal;
Step (16) is using new threshold value THNew as binaryzation threshold value, for image binaryzation.
The target image of binaryzation is divided into rectangular block by step (2).
Step (3) judges whether containing Quick Response Code and marked for each piecemeal respectively.
For the piecemeal deterministic process in this programme, specifically comprise the following steps (referring to Fig. 3):
Whether each rectangular block of step (31) poll, the monochrome pixels for calculating each rectangular block than meet condition;
Step (32) judges whether four sub-blocks meet preparatory condition (here to meeting that the rectangular block of condition carries out the quartering Preparatory condition can be that the monochrome pixels ratios of four sub-blocks is all to meet that monochrome pixels are than meeting condition in condition or four sub-blocks Whether sub-block number is more than half);The rectangular block is labeled as Quick Response Code effective district if meeting;
Step (33) is to marking the rectangular block for effective district, and add up confidence level per continuous 2*2 blocks.
Step (4) is according to mark iteration extension two-dimension code area and calculates confidence level.
Implementation process for extending two-dimension code area in this programme, specifically comprises the following steps (referring to Fig. 4):
Step (41) calculates the confidence level of current two-dimension effective district;
Step (42) judges whether current credibility is equal to last time confidence level, terminates if equal to if, and step is transferred to if being not equal to Suddenly (43);
Step (43) carries out expanding Quick Response Code effective district per 3*3 blocks to the rectangular block in confidence level region, and calculates credible Degree, and it is transferred to step (42).
Whether step (5) contains Quick Response Code according to Credibility judgement image, if confidence level meets corresponding threshold value, judges Target image contains Quick Response Code and exports Quick Response Code effective coverage;If confidence level is unsatisfactory for corresponding threshold value, target figure is judged As not containing Quick Response Code.
The Quick Response Code pretreating scheme formed accordingly quickly can accurately judge whether contain Quick Response Code in target image, It is easy to the quick decoding of follow-up Quick Response Code.
Referring to Fig. 5, it show the Quick Response Code decoding pretreatment system of this programme offer.Quick Response Code decoding pretreatment system System can be above-mentioned Quick Response Code decoding preprocessing function, can effectively judge whether contain Quick Response Code in target image, and by two Dimension code effective district is spread out of by output parameter.
As seen from the figure, this Quick Response Code decoding pretreatment system 10 primary picture binarization block 11, image segmentation module 12, Piecemeal judges and mark module 13, effective district expansion module 14 and output module 15.
Wherein, image binaryzation module 11, target image is received, and binary conversion treatment is carried out to target image.
The image binaryzation module 11 calculates Binary Sketch of Grey Scale Image according to the flow shown in Fig. 2 by iterative algorithm Threshold value, according to this threshold value by image binaryzation.
Image splits rectangular block 12, and it is connected with the data of binarization block 11, for the target image of binaryzation to be split Into some rectangular blocks.
Piecemeal judges and mark module 13, and segmentation data of rectangular block 12 be connecteds with image for it, for judgement and mark module, Judge whether every piece of rectangular block contains Quick Response Code and be marked.
The piecemeal judges and mark module 13 judges whether containing two dimension respectively according to the flow shown in Fig. 3 to each piecemeal Code simultaneously marks shown flow.
Effective district expansion module 14, it judges with piecemeal and the data of mark module 13 are connected, for being expanded according to mark iteration Exhibition two-dimension code area simultaneously calculates confidence level.
The effective district expansion module 14 to mark iteration extension two-dimension code area and calculates credible according to the flow shown in Fig. 4 Degree.
Output module 15, it is connected with the data of effective district expansion module 14, the result for target image pretreatment.
The output module 15 exports true, and export Quick Response Code by parameter to have in the case where confidence level meets condition Imitate area;Under the conditions of confidence level is unsatisfactory for, false is exported.
Thus the Quick Response Code pretreatment system formed, can be realized in specific implementation by corresponding software architecture.With Under by a concrete application example come illustratively its running.
Quick Response Code decodes pretreatment system when being handled in this example, and it receives a width greyscale image data, returns Bool variables indicate whether to spread out of by output parameter containing Quick Response Code, Quick Response Code effective district.
Referring to Fig. 6, it show the original image exemplary plot for needing to be pre-processed in this example.
First, calculated by iterative algorithm for the original image shown in Fig. 6, the system and use Binary Sketch of Grey Scale Image Threshold value, the original image binaryzation according to this threshold value by Fig. 6, obtain binary image (as shown in Figure 7).
Then, for the binary image shown in Fig. 7, it is divided into the fritter of a number of convergence square (such as Shown in Fig. 8).
Then, for the image of the fritter for being divided into some convergence squares shown in Fig. 8, each fritter of poll, calculate Whether its monochrome pixels than meets condition, and referring to Fig. 9, it show the example images figure detected by the first step.
Then, for the image detected by the first step, to meeting that each fritter of regulation carries out the quartering, four sons are judged Whether block monochrome pixels than all meet condition;Referring to Figure 10, it show the example images figure detected by second step.
Then, for the image detected by second step, the cumulative confidence level of continuous 2*2 blocks is carried out.
Then, 3*3 expansions are carried out to the block in confidence level region, until current credibility and a upper confidence level are equal;Ginseng See Figure 11, it show the example images figure for being extended Quick Response Code effective district.
Finally, meet condition for confidence level, export true, and Quick Response Code effective district (such as Figure 12 is exported by parameter It is shown);Condition is unsatisfactory for for confidence level, exports false.
The Quick Response Code effective district exported accordingly, can be to two-dimentional in the target image of output when being decoded for follow-up Quick Response Code Code region is cut, and then the two-dimension code area after cutting is input in Quick Response Code parsing storehouse and parsed, it is possible thereby to Accelerate the decoding speed of Quick Response Code.
It is last it may be noted that such scheme, be pure software framework, tangible media can be laid in through program code, such as Hard disk, floppy disk, disc or any machine-readable (such as intelligent mobile phone, computer-readable) store media, work as machine Loading procedure code and execution, such as intelligent mobile phone loading and execution, machine turns into carry out the device of this programme.
Furthermore such scheme can also form of program codes through some transmission media, such as cable, optical fiber or any Transmission kenel is transmitted, and when program code is received, loads and performed by machine, such as intelligent mobile phone, machine turns into reality The device of row such scheme.
General principle, principal character and the advantages of the present invention of the present invention has been shown and described above.The technology of the industry Personnel are it should be appreciated that the present invention is not limited to the above embodiments, and the simply explanation described in above-described embodiment and specification is originally The principle of invention, without departing from the spirit and scope of the present invention, various changes and modifications of the present invention are possible, these changes Change and improvement all fall within the protetion scope of the claimed invention.The claimed scope of the invention by appended claims and its Equivalent thereof.

Claims (7)

  1. A kind of 1. Quick Response Code preprocess method, it is characterised in that including:
    Image binaryzation;
    Image splits rectangular block;
    Piecemeal judges whether containing Quick Response Code and marked;
    According to mark iteration extension two-dimension code area and calculate confidence level;
    Whether Quick Response Code is contained according to Credibility judgement image, and exports Quick Response Code effective coverage.
  2. 2. Quick Response Code preprocess method according to claim 1, it is characterised in that during image binaryzation processing, by repeatedly The threshold value of Binary Sketch of Grey Scale Image is calculated for algorithm, according to this threshold value by image binaryzation.
  3. 3. Quick Response Code preprocess method according to claim 2, it is characterised in that the iterative calculation of binaryzation threshold value Journey includes:
    Calculate the histogram data of image;
    Minimum and maximum nonzero value in Nogata data is calculated, using minimum non-zero value as initial threshold, by both average value As initial new threshold value, and judge whether both are equal;
    When unequal, histogram is divided into by two parts according to initial new threshold value, is averaging gray value respectively, by two average ashes The average of angle value is as new threshold value.
  4. 4. Quick Response Code preprocess method according to claim 1, it is characterised in that piecemeal judges to include:
    Whether each rectangular block of poll, the monochrome pixels for calculating each rectangular block than meet condition;
    To meeting that the rectangular block of condition carries out the quartering, judge whether four sub-blocks meet preparatory condition;Two are labeled as if meeting Tie up code effective district;
    To marking the rectangular block for effective district, add up confidence level per continuous 2*2 blocks.
  5. 5. Quick Response Code preprocess method according to claim 1, it is characterised in that enter to the rectangular block in confidence level region Row 3*3 blocks expand Quick Response Code effective district, until current credibility and a upper confidence level are equal.
  6. 6. a kind of Quick Response Code decodes pretreatment system, it is characterised in that including:
    Image binaryzation module, binary conversion treatment is carried out to target image;
    Image splits rectangular block, and the target image of binaryzation is carried out splitting some rectangular blocks;
    Piecemeal judges and mark module, judges whether every piece of rectangular block contains Quick Response Code and be marked;
    Effective district expansion module, according to mark iteration extension two-dimension code area and calculate confidence level;
    Output module, whether Quick Response Code is contained according to Credibility judgement image, and export Quick Response Code effective coverage.
  7. 7. a kind of Quick Response Code coding/decoding method, it is characterised in that pre-processed by the Quick Response Code any one of claim 1-5 Whether contain Quick Response Code in the advance recognition target image of method, and two-dimension code area in target image is cut, it is then right Two-dimension code area after cutting is parsed.
CN201710548082.7A 2017-07-06 2017-07-06 A kind of Quick Response Code preprocess method, system and coding/decoding method CN107423653A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710548082.7A CN107423653A (en) 2017-07-06 2017-07-06 A kind of Quick Response Code preprocess method, system and coding/decoding method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710548082.7A CN107423653A (en) 2017-07-06 2017-07-06 A kind of Quick Response Code preprocess method, system and coding/decoding method

Publications (1)

Publication Number Publication Date
CN107423653A true CN107423653A (en) 2017-12-01

Family

ID=60427465

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710548082.7A CN107423653A (en) 2017-07-06 2017-07-06 A kind of Quick Response Code preprocess method, system and coding/decoding method

Country Status (1)

Country Link
CN (1) CN107423653A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109801389A (en) * 2019-03-18 2019-05-24 重庆睿驰智能科技有限公司 Payment auxiliary system based on viewing system

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102254144A (en) * 2011-07-12 2011-11-23 四川大学 Robust method for extracting two-dimensional code area in image
CN102708552A (en) * 2012-05-24 2012-10-03 中山大学 Rapid two-dimensional barcode image motion deblurring method
CN104517090A (en) * 2013-09-29 2015-04-15 北大方正集团有限公司 Method and system for detecting QR code detection figures
CN104933387A (en) * 2015-06-24 2015-09-23 上海快仓智能科技有限公司 Rapid positioning and identifying method based on two-dimensional code decoding
CN105654019A (en) * 2016-02-23 2016-06-08 海信集团有限公司 Fast decoding method and device for two-dimension code
CN105868724A (en) * 2016-04-07 2016-08-17 广州智慧城市发展研究院 Two-dimensional bar code identification method and system based on connected domain

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102254144A (en) * 2011-07-12 2011-11-23 四川大学 Robust method for extracting two-dimensional code area in image
CN102708552A (en) * 2012-05-24 2012-10-03 中山大学 Rapid two-dimensional barcode image motion deblurring method
CN104517090A (en) * 2013-09-29 2015-04-15 北大方正集团有限公司 Method and system for detecting QR code detection figures
CN104933387A (en) * 2015-06-24 2015-09-23 上海快仓智能科技有限公司 Rapid positioning and identifying method based on two-dimensional code decoding
CN105654019A (en) * 2016-02-23 2016-06-08 海信集团有限公司 Fast decoding method and device for two-dimension code
CN105868724A (en) * 2016-04-07 2016-08-17 广州智慧城市发展研究院 Two-dimensional bar code identification method and system based on connected domain

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109801389A (en) * 2019-03-18 2019-05-24 重庆睿驰智能科技有限公司 Payment auxiliary system based on viewing system

Similar Documents

Publication Publication Date Title
US10318851B2 (en) Generating and decoding two-dimensional code
CN104268857B (en) A kind of fast sub-picture element rim detection and localization method based on machine vision
EP1619604B1 (en) Code type determining method and code boundary detecting method
US9208420B2 (en) Techniques for generating customized two-dimensional barcodes
KR100339691B1 (en) Apparatus for recognizing code and method therefor
CN101882210B (en) Matrix two-dimensional barcode decoding chip and decoding method thereof
JP4557433B2 (en) Imaging engine and technology for zip code reading
US6580804B1 (en) Pixel-based digital watermarks located near edges of an image
Liu et al. Recognition of QR Code with mobile phones
US9355293B2 (en) Code detection and decoding system
US8965127B2 (en) Method for segmenting text words in document images
JP4626886B2 (en) Method and apparatus for locating and extracting captions in digital images
US20140119647A1 (en) Method and Apparatus for Decoding Mixed Code
JP2940936B2 (en) Tablespace identification method
US8254683B2 (en) Code image processing method
CN103400099B (en) Terminal and two-dimensional code identification method
Wu et al. An automated vision system for container-code recognition
JP5047005B2 (en) Image processing method, pattern detection method, pattern recognition method, and image processing apparatus
JP2006134336A (en) Mixed code, method and apparatus for generating mixed code, and recording medium
WO2014046918A1 (en) Detecting a label from an image
Otori et al. Data-embeddable texture synthesis
CN106778995B (en) Artistic two-dimensional code generation method and device fused with image
CN105469027B (en) For the horizontal and vertical lines detection and removal of file and picture
CN100464347C (en) Vector graphics identifying method for engineering CAD drawing
CN101398907B (en) Two-dimension code structure and decoding method for movable robot

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination