Code128 bar code automatic reading method based on global optimization
A global optimization, barcode technology, applied in the field of barcode recognition, can solve problems such as reducing work efficiency, affecting overall code recognition, and high rejection rate
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0051] A Code128 barcode automatic reading method based on global optimization, such as figure 1 , mainly including the following steps in sequence:
[0052] Step (1) calculates four probability values {p that may be 1 to 4 for each character 1 ,p 2 ,p 3 ,p 4};
[0053] Step (2) uses the formula w i = log p i the probability value p i Transformed into the expression of information entropy, the four probability values of each character calculated in step (1) are calculated to obtain the product calculation equivalent of the maximum probability into the sum calculation of obtaining the maximum information entropy:
[0054] Step (3) adopts the mode of global probability optimization to obtain the character that its maximum probability may correspond to;
[0055] Step (4) According to the values of all data bits in step (3) under the condition of maximum total probability, corresponding to the Code128 coding table, the corresponding barcode coding information is d...
Embodiment 2
[0063] The only difference between this embodiment and Embodiment 1 is that since the character composition corresponding to each character is completely fixed and the number is extremely limited, the present invention uses the following steps to complete the global probability optimization to obtain the character that may correspond to the maximum probability, mainly Include the following steps in order:
[0064] Step (3-1) Manually design a 24×107 sparse weight matrix G according to the Code128 coding table, where each column corresponds to a character, and the 24 data elements in each column are equally divided into 6 units, corresponding to 6 characters, Each unit contains 4 data elements corresponding to the four possible values of the character; when the i-th character takes the value j according to the coding rules, the corresponding data element of the corresponding character in the 4i+j column The value is 1, otherwise it is 0, so for each column of the weight matri...
Embodiment 3
[0075] The difference between this embodiment and embodiment 2 is that further, step (3-1) to step (3-3) and step (3-4) to step (3-8) in said step (3) , can also be replaced by HMMs, MRFs, bipartite graphs, graph cuts or TVL1 optimization methods to obtain the corresponding value of the maximum probability that each character includes a check digit.
[0076] Here, other HMMs and MRFs optimization algorithms can be used to replace the two optimization steps in the above step 3, which should still be protected by the claims of the present invention. More specifically, the above step (3) uses an HMMs optimization method that is more efficient for this problem, but other optimization algorithms include but are not limited to algorithms such as bipartite graphs, graph cuts, and TVL1. Replacement, but because it is only a non-inventive modification or simple replacement made to step (3) of the present invention, these optimization methods are still protected by the present invention...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com