One-dimensional code area positioning method and apparatus thereof
A positioning method, a two-dimensional code technology, applied in the field of image processing, can solve the problem of low positioning accuracy in one-dimensional code areas
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0035] figure 1 It is a schematic diagram of a positioning process of a one-dimensional code area provided by an embodiment of the present invention, and the process includes the following steps:
[0036] S101: On each candidate area of the one-dimensional code, determine a set number of scanning lines.
[0037] The positioning method for a one-dimensional code area provided by an embodiment of the present invention is applied to an electronic device. The electronic device may be a barcode reading device such as a handheld barcode reader or a fixed barcode reader, or may be a terminal device such as a PC, a smart TV, a camera phone, or a tablet computer with a barcode decoding function.
[0038] The electronic device can determine a plurality of one-dimensional code candidate areas in the image according to the features such as edges, straight lines, and gradients of the one-dimensional code, wherein the plurality of one-dimensional code candidate areas contain real one-dim...
Embodiment 2
[0049] On the basis of the above embodiments, if the attribute information of the boundary points is the number of boundary points, in order to determine the score of each candidate area, in the embodiment of the present invention, if the attribute information of the boundary points includes the number of boundary points , for the attribute information of each boundary point on the scan line in each candidate area, according to the attribute information of each boundary point, determining the score of each candidate area includes:
[0050] For each candidate area, according to the difference in the number of boundary points on every two adjacent scan lines in the candidate area, determine the first score corresponding to every two adjacent scan lines; The sum of the first scores corresponding to the scan lines determines the score of the candidate region, wherein the smaller the difference, the larger the first score.
[0051] For the real one-dimensional code area, the number...
Embodiment 3
[0057] On the basis of the above embodiments, if the attribute information of the boundary point is the position of the boundary point, in order to determine the score of each candidate area, in the embodiment of the present invention, if the attribute information of the boundary point includes the position of the boundary point Position, for the attribute information of each boundary point on the scan line in each candidate area, according to the attribute information of each boundary point, determining the score of each candidate area includes at least one of the following:
[0058] For each candidate area, according to the position of the boundary point on each scan line in the candidate area, determine the maximum width and minimum width determined by two adjacent boundary points on each scan line, according to each scan line Whether the ratio of the maximum width to the minimum width is less than a preset threshold, determine the second score corresponding to each scan lin...
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