CN109934040B - Boundary screening method and equipment for one-dimensional bar code - Google Patents
Boundary screening method and equipment for one-dimensional bar code Download PDFInfo
- Publication number
- CN109934040B CN109934040B CN201910223376.1A CN201910223376A CN109934040B CN 109934040 B CN109934040 B CN 109934040B CN 201910223376 A CN201910223376 A CN 201910223376A CN 109934040 B CN109934040 B CN 109934040B
- Authority
- CN
- China
- Prior art keywords
- amplitude
- boundary
- bar code
- array
- data
- 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.)
- Active
Links
Images
Landscapes
- Signal Processing For Digital Recording And Reproducing (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
The invention relates to a bar code boundary screening method, which comprises the following steps: obtaining AD data of the bar code, judging the boundary to obtain the position of the bar code boundary and recording the position in a boundary array Edge [ ]; acquiring the Peak value of the rising stage and the valley value of the falling stage of the AD data according to the boundary array Edge [ ], and recording the Peak value and the valley value in the array Peak [ ]; calculating the amplitude between adjacent Peak values and valley values in the AD data according to an array Peak [ ], and recording the amplitude in an amplitude array amplitude [ ]; setting a threshold value T, judging the amplitude array amplitude [ ], if the amplitude [ k ] and two adjacent amplitudes [ k-1] and [ k +1] are smaller than the set threshold value T, assigning the bar code boundaries Edge [ k ] and Edge [ k +1] as 0, otherwise, keeping the corresponding boundary original values; the boundary whose median value is 0 in the boundary array Edge [ ] is deleted.
Description
Technical Field
The invention relates to a boundary screening method and equipment of a one-dimensional bar code, belonging to the technical field of bar code identification.
Background
In order to read out the information represented by bar code, a bar code identification system is needed, which is composed of bar code scanner, amplifying and shaping circuit, decoding interface circuit and computer system, i.e. a bar code reader (bar code scanner is also called bar code scanning gun or bar code reader) is used to scan to obtain a group of reflected light signals, which are photoelectrically converted into a group of electronic signals corresponding to lines and blanks, which are decoded and restored into corresponding alphanumerics, which are then transmitted to computer. The bar code technology has the advantages of high input speed, high reliability, large information acquisition amount, flexibility, practicability and the like.
At present, due to interference of factors such as illumination, distance and background of a bar code object, AD data obtained by conversion of an acquired bar code image comprises a plurality of redundant clutter, and the redundant clutter generally appears on two sides of a bar code area and can generate adverse effects on bar code reading, even the decoding failure of bar code scanning equipment is caused.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a barcode boundary screening method for processing the acquired AD data in a barcode boundary judgment stage, so as to reduce the generation of error boundaries and improve the decoding accuracy.
The technical scheme of the invention is as follows:
technical scheme one
A bar code boundary screening method, comprising the steps of:
acquiring AD data of a gray value of a bar code, judging the boundary of the bar code to obtain the bar code boundary of the bar code, and sequentially recording the positions of all the obtained bar code boundaries in the AD data in a boundary array Edge [ ];
according to the boundary array Edge [ ], acquiring a Peak value of each ascending stage of the AD data and a valley value of each descending stage of the AD data, and sequentially recording the Peak values and the valley values in the array Peak [ ];
calculating the amplitude between adjacent Peak values and valley values in the AD data according to an array Peak [ ], and sequentially recording the amplitude in an amplitude array amplitude [ ];
Setting a threshold value T, judging the amplitude array amplitude [ ], if the amplitude [ k ] and two adjacent amplitudes [ k-1] and [ k +1] are smaller than the set threshold value T, considering that the bar code boundaries Edge [ k ] and Edge [ k +1] are error boundaries generated by redundant clutter, assigning the bar code boundaries Edge [ k ] and Edge [ k +1] to be 0, and otherwise, keeping the original values of the corresponding boundaries;
deleting the boundary with the median value of 0 in the boundary array Edge [ ];
where amplitude [ k ] represents the kth amplitude value in the amplitude array amplitude [ ], and Edge [ k ] represents the position of the kth barcode boundary in the boundary array Edge [ ].
Further, the step of boundary judgment specifically includes: acquiring a minimum value m and an amplitude Amp of a rising or falling stage of current AD Data, acquiring a maximum value Data _ Max in all AD Data, calculating an amplitude threshold value t = Max (39, min (199, (Data _ Max-m)/16)) of the stage, and if the Amp is greater than t, considering that a barcode boundary exists in the rising or falling stage;
wherein max (a, b) represents taking the maximum value between a and b, and min (a, b) represents taking the minimum value between a and b.
Further, in the array Peak [ ], Peak [ k ] is equal to the value of the AD data corresponding to the position where Edge [ k ] is located; the amplitude [ k ] = Peak [ k +1] -Peak [ k ] |.
Further, the threshold T is 1/10 of the average of the values of the portion 1/3 in the middle of the amplitude array amplitude [ ].
Technical scheme two
A barcode border screening apparatus comprising a memory and a processor, the memory storing instructions adapted to be loaded by the processor and to perform the following steps on a barcode image obtained by scanning:
acquiring AD data of a gray value of a bar code, judging the boundary of the bar code to obtain the bar code boundary of the bar code, and sequentially recording the positions of all the obtained bar code boundaries in the AD data in a boundary array Edge [ ];
according to the boundary array Edge [ ], acquiring a Peak value of each ascending stage of the AD data and a valley value of each descending stage of the AD data, and sequentially recording the Peak values and the valley values in the array Peak [ ];
calculating the amplitude between adjacent Peak values and valley values in the AD data according to an array Peak [ ], and sequentially recording the amplitude in an amplitude array amplitude [ ];
setting a threshold value T, judging the amplitude array amplitude [ ], if the amplitude [ k ] and two adjacent amplitudes [ k-1] and [ k +1] are smaller than the set threshold value T, considering that the bar code boundaries Edge [ k ] and Edge [ k +1] are error boundaries generated by redundant clutter, assigning the bar code boundaries Edge [ k ] and Edge [ k +1] to be 0, and otherwise, keeping the original values of the corresponding boundaries;
Deleting the boundary with the median value of 0 in the boundary array Edge [ ];
where amplitude [ k ] represents the kth amplitude value in the amplitude array amplitude [ ], and Edge [ k ] represents the position of the kth barcode boundary in the boundary array Edge [ ].
Further, the step of boundary judgment specifically includes: acquiring a minimum value m and an amplitude Amp of a rising or falling stage of current AD Data, acquiring a maximum value Data _ Max in all AD Data, calculating an amplitude threshold value t = Max (39, min (199, (Data _ Max-m)/16)) of the stage, and if the Amp is greater than t, considering that a barcode boundary exists in the rising or falling stage;
wherein max (a, b) represents taking the maximum value between a and b, and min (a, b) represents taking the minimum value between a and b.
Further, in the array Peak [ ], Peak [ k ] is equal to the value of the AD data corresponding to the position where Edge [ k ] is located; the amplitude [ k ] = Peak [ k +1] -Peak [ k ] |.
Further, the threshold T is 1/10 of the average of the values of the portion 1/3 in the middle of the amplitude array amplitude [ ].
The invention has the following beneficial effects:
1. the invention processes the acquired AD data of the bar code at the bar code boundary judgment stage, reduces the generation of error boundaries and improves the decoding accuracy.
2. According to the method, the threshold value T is calculated through the middle numerical value of the amplitude array amplitude [ ], and the middle numerical value of the amplitude array amplitude [ ] is the amplitude data generated by the conversion between the bars and the spaces in the actual bar code, so that the influence of redundant clutter generated by blank areas at two ends of the bar code on the value of the threshold value T is avoided.
Drawings
FIG. 1 is a flow chart of the present invention;
fig. 2 is an exemplary diagram of acquired AD data in the embodiment of the present invention;
FIG. 3 is an exemplary diagram of a bar code in an embodiment of the present invention;
FIG. 4 is a waveform diagram of AD data of a barcode and an exemplary diagram of a barcode boundary position in an embodiment of the present invention;
FIG. 5 is a diagram illustrating a bar code boundary after being filtered according to an embodiment of the present invention.
Detailed Description
The invention is described in detail below with reference to the figures and the specific embodiments.
Example one
Referring to fig. 1 and 2, a barcode boundary screening method includes the steps of:
acquiring AD data of a gray value of a bar code (as shown in FIG. 2, FIG. 2 is 1500 AD data of code39 codes), performing boundary judgment to obtain a bar code boundary of the bar code (the bar code boundary refers to a boundary between a black bar and a blank in the bar code), and sequentially recording positions of all the obtained bar code boundaries in the AD data in a boundary array Edge [ ]; for example, if the first barcode boundary found is the 20 th AD data, Edge [1] = 20;
According to the boundary array Edge [ ], acquiring a Peak value of each rising stage of the AD data and a valley value of each falling stage of the AD data, and sequentially recording the Peak values and the valley values in the array Peak [ ]; because the Peak of each rising stage or the trough of each falling stage of the AD data is the position where the barcode boundary is located, the Peak of each rising stage or the trough of each falling stage of the AD data corresponds to the value of the AD data at the position where the barcode boundary is located, for example, Edge [1] =20, and the value of the 20 th AD data is 3619, then Peak [1] = 3619;
calculating the amplitude between adjacent Peak values and valley values in the AD data according to an array Peak [ ], and sequentially recording the amplitude in an amplitude array amplitude [ ];
setting a threshold value T, judging the amplitude array amplitude [ ], if the amplitude [ k ] and two adjacent amplitudes [ k-1] and [ k +1] are smaller than the set threshold value T, considering that the bar code boundaries Edge [ k ] and Edge [ k +1] are error boundaries generated by redundant clutter, assigning the bar code boundaries Edge [ k ] and Edge [ k +1] to be 0, and otherwise, keeping the original values of the corresponding boundaries;
deleting the boundary with the median value of 0 in the boundary array Edge [ ]; a new boundary array is generated for subsequent decoding.
Where amplitude [ k ] represents the kth amplitude value in the amplitude array amplitude [ ], and Edge [ k ] represents the position of the kth barcode boundary in the boundary array Edge [ ].
According to the embodiment, the acquired AD data is processed in the stage of judging the bar code boundary, so that the error boundary generated by redundant clutter is reduced, and the decoding accuracy is improved.
Example two
Further, the boundary determining step specifically includes: acquiring a minimum value m and an amplitude Amp of a rising or falling stage of current AD Data, acquiring a maximum value Data _ Max in all AD Data, calculating an amplitude threshold value t = Max (39, min (199, (Data _ Max-m)/16)) of the stage, and if the Amp is greater than t, considering that a barcode boundary exists in the rising or falling stage; max (a, b) represents taking the maximum value between a and b, min (a, b) represents taking the minimum value between a and b; referring specifically to fig. 2, for example, the last Data 3227 of the third row to the sixth Data 3140 of the fourth row, which is a falling phase of AD Data, the minimum value m of this falling phase is 3140, the amplitude Amp is 87, and in all the AD Data in fig. 2, Data _ Max = 3739; the amplitude threshold t = max (39, min (199, (3739-.
Furthermore, in the array Peak [ ], Peak [ k ] is equal to the value of the AD data corresponding to the position where Edge [ k ] is located; the amplitude [ k ] = Peak [ k +1] -Peak [ k ] |; for example, if Peak [1] =3619, Peak [2] =3016, then amplitude [1] = Peak [2] -Peak [1] | = 603.
Further, the threshold value T is 1/10 of the average value of the partial values 1/3 in the middle of the amplitude array, for example, 21 total values in the amplitude array, including amplitude [0], amplitude [1], and amplitude [2] … … amplitude [20], and 1/10 of the average value of amplitude [7], amplitude [8], and amplitude [9] … … amplitude [13] is taken as the threshold value T; referring to fig. 3 specifically, since the left and right sides of the read barcode are blank areas, and noise is easily generated in the corresponding AD data in the blank areas, 1/10 of the average amplitude value of the intermediate stable AD data is taken as the threshold T.
Referring specifically to fig. 3-5, fig. 3 is a scan of a code39 barcode containing information ABC 123; in fig. 4, the upper waveform diagram is a variation curve of the AD data, the lower vertical line indicates the position of the barcode boundary obtained after boundary determination, as shown in the figure, the region where the waveform amplitude of the variation curve of the AD data is stable is approximately at the middle position, the front clutter is AD data of the barcode blank region, the barcode boundary in fig. 4 is a result obtained by not determining whether each barcode boundary is redundant clutter, and the barcode boundary generated by the clutter portion is decoded into "+" ABC123 "so that the code39 is decoded incorrectly as ×;
In fig. 5, the vertical line at the bottom is the result obtained by judging whether the barcode boundary is a redundant clutter or not, the barcode boundary generated by the clutter part is filtered, and the filtered boundary array Edge [ ] obtains a correct result after decoding [. about.ABC 123 ].
The embodiment has the beneficial effects of the first embodiment, and also provides that the threshold value T is calculated through the value of the middle 1/3 of the amplitude array amplitude [ ], and the value of the middle of the amplitude array amplitude [ ] is the amplitude data generated by the transformation between the bars and spaces in the actual bar code, so that the influence of redundant clutter generated by blank areas at two ends of the bar code on the value of the threshold value T is avoided.
EXAMPLE III
A barcode border screening apparatus comprising a memory and a processor, the memory storing instructions adapted to be loaded by the processor and to perform the following steps on a barcode image obtained by scanning:
acquiring AD data of a gray value of a bar code (as shown in FIG. 2, FIG. 2 is 1500 AD data of code39 codes), performing boundary judgment to obtain a bar code boundary of the bar code (the bar code boundary refers to a boundary between a black bar and a blank in the bar code), and sequentially recording positions of all the obtained bar code boundaries in the AD data in a boundary array Edge [ ]; for example, if the first barcode boundary found is the 20 th AD data, Edge [1] = 20;
According to the boundary array Edge [ ], acquiring a Peak value of each ascending stage of the AD data and a valley value of each descending stage of the AD data, and sequentially recording the Peak values and the valley values in the array Peak [ ]; because the Peak of each rising stage or the trough of each falling stage of the AD data is the position of the barcode boundary, the Peak of each rising stage or the trough of each falling stage of the AD data corresponds to the value of the AD data at the position of the barcode boundary, for example, Edge [1] =20, and the value of the 20 th AD data is 3619, Peak [1] = 3619;
calculating the amplitude between adjacent Peak values and valley values in the AD data according to an array Peak [ ], and sequentially recording the amplitude in an amplitude array amplitude [ ];
setting a threshold value T, judging the amplitude array amplitude [ ], if the amplitude [ k ] and two adjacent amplitudes [ k-1] and [ k +1] are smaller than the set threshold value T, considering that the bar code boundaries Edge [ k ] and Edge [ k +1] are error boundaries generated by redundant clutter, assigning the bar code boundaries Edge [ k ] and Edge [ k +1] to be 0, and otherwise, keeping the original values of the corresponding boundaries;
deleting the boundary with the median value of 0 in the boundary array Edge [ ]; a new boundary array is generated for subsequent decoding.
Where amplitude [ k ] represents the kth amplitude value in the amplitude array amplitude [ ], and Edge [ k ] represents the position of the kth barcode boundary in the boundary array Edge [ ].
According to the embodiment, the acquired AD data is processed in the stage of judging the bar code boundary, so that the error boundary generated by redundant clutter is reduced, and the decoding accuracy is improved.
Example four
Further, the boundary determining step specifically includes: acquiring a minimum value m and an amplitude Amp of a rising or falling stage of current AD Data, acquiring a maximum value Data _ Max in all AD Data, calculating an amplitude threshold value t = Max (39, min (199, (Data _ Max-m)/16)) of the stage, and if the Amp is greater than t, considering that a barcode boundary exists in the rising or falling stage; max (a, b) represents taking the maximum value between a and b, min (a, b) represents taking the minimum value between a and b; referring specifically to fig. 2, for example, the last Data 3227 of the third row to the sixth Data 3140 of the fourth row, which is a falling phase of AD Data, the minimum value m of this falling phase is 3140, the amplitude Amp is 87, and in all the AD Data in fig. 2, Data _ Max = 3739; the amplitude threshold t = max (39, min (199, (3739-.
Further, in the array Peak [ ], Peak [ k ] is equal to the value of the AD data corresponding to the position where Edge [ k ] is located; the amplitude [ k ] = Peak [ k +1] -Peak [ k ] |; for example, if Peak [1] =3619, Peak [2] =3016, then amplitude [1] = Peak [2] -Peak [1] | = 603.
Further, the threshold value T is 1/10 of the average value of the partial values 1/3 in the middle of the amplitude array, for example, 21 total values in the amplitude array, including amplitude [0], amplitude [1], and amplitude [2] … … amplitude [20], and 1/10 of the average value of amplitude [7], amplitude [8], and amplitude [9] … … amplitude [13] is taken as the threshold value T; referring to fig. 3 specifically, since the left and right sides of the read barcode are blank areas, and noise is easily generated in the corresponding AD data in the blank areas, 1/10 of the average amplitude value of the intermediate stable AD data is taken as the threshold T.
Referring specifically to fig. 3-5, fig. 3 is a scan of a code39 barcode containing information ABC 123; in fig. 4, the upper waveform diagram is a variation curve of the AD data, the lower vertical line indicates the position of the barcode boundary obtained after boundary determination, as shown in the figure, the region where the waveform amplitude of the variation curve of the AD data is stable is approximately at the middle position, the front clutter is AD data of the barcode blank region, the barcode boundary in fig. 4 is a result obtained by not determining whether each barcode boundary is redundant clutter, and the barcode boundary generated by the clutter portion is decoded into "+" ABC123 "so that the code39 is decoded incorrectly as ×;
In fig. 5, the vertical line below is the result obtained by judging whether the barcode boundary is a redundant clutter or not, the barcode boundary generated by the clutter portion is filtered, and the filtered boundary array Edge [ ] obtains the correct result × ABC123 [ ] after decoding.
The embodiment has the beneficial effects of the third embodiment, and also provides that the threshold value T is calculated through the numerical value of the middle 1/3 of the amplitude array amplitude [ ], and the numerical value of the middle of the amplitude array amplitude [ ] is the amplitude data generated by the transformation between the actual bar and space in the bar code, so that the influence of redundant clutter generated by blank areas at two ends of the bar code on the value of the threshold value T is avoided.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes performed by the present specification and drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (6)
1. A bar code boundary screening method is characterized in that: the method comprises the following steps:
acquiring AD data of a gray value of a bar code, judging the boundary of the bar code to obtain the bar code boundary of the bar code, and sequentially recording the positions of all the obtained bar code boundaries in the AD data in a boundary array Edge [ ];
According to the boundary array Edge [ ], acquiring a Peak value of each ascending stage of the AD data and a valley value of each descending stage of the AD data, and sequentially recording the Peak values and the valley values in the array Peak [ ];
calculating the amplitude between adjacent Peak values and valley values in the AD data according to an array Peak [ ], and sequentially recording the amplitude in an amplitude array amplitude [ ];
setting a threshold value T, judging the amplitude array amplitude [ ], if the amplitude [ k ] and two adjacent amplitudes [ k-1] and [ k +1] are smaller than the set threshold value T, considering that the bar code boundaries Edge [ k ] and Edge [ k +1] are error boundaries generated by redundant clutter, assigning the bar code boundaries Edge [ k ] and Edge [ k +1] to be 0, and otherwise, keeping the original values of the corresponding boundaries;
deleting the boundary with the median value of 0 in the boundary array Edge [ ];
wherein amplitude [ k ] represents the kth amplitude value in the amplitude array amplitude [ ], and Edge [ k ] represents the position of the kth barcode boundary in the boundary array Edge [ ];
the bar code boundary refers to a boundary between a black bar and a blank in a bar code;
the boundary judgment specifically comprises the following steps: acquiring a minimum value m and an amplitude Amp of a rising or falling stage of current AD Data, acquiring a maximum value Data _ Max in all AD Data, calculating an amplitude threshold value t of the stage to be Max (39, min (199, (Data _ Max-m)/16)), and if the Amp is greater than t, considering that a barcode boundary exists in the rising or falling stage;
Wherein max (a, b) represents taking the maximum value between a and b, and min (a, b) represents taking the minimum value between a and b.
2. The bar code boundary screening method according to claim 1, wherein: in the array Peak [ ], Peak [ k ] is equal to the value of AD data corresponding to the position of Edge [ k ]; the amplitude [ k ] - | Peak [ k +1] -Peak [ k ] |.
3. The bar code boundary screening method according to claim 1, wherein: the threshold T is 1/10 of the average of the values of the portion 1/3 in the middle of the amplitude array amplitude [ ].
4. A barcode border screening apparatus comprising a memory and a processor, the memory storing instructions adapted to be loaded by the processor and to perform the following steps on a barcode image obtained by scanning:
acquiring AD data of a gray value of a bar code, judging the boundary of the bar code to obtain the bar code boundary of the bar code, and sequentially recording the positions of all the obtained bar code boundaries in the AD data in a boundary array Edge [ ];
according to the boundary array Edge [ ], acquiring a Peak value of each ascending stage of the AD data and a valley value of each descending stage of the AD data, and sequentially recording the Peak values and the valley values in the array Peak [ ];
Calculating the amplitude between adjacent Peak values and valley values in the AD data according to an array Peak [ ], and sequentially recording the amplitude in an amplitude array amplitude [ ];
setting a threshold value T, judging the amplitude array amplitude [ ], if the amplitude [ k ] and two adjacent amplitudes [ k-1] and [ k +1] are smaller than the set threshold value T, considering that the bar code boundaries Edge [ k ] and Edge [ k +1] are error boundaries generated by redundant clutter, assigning the bar code boundaries Edge [ k ] and Edge [ k +1] to be 0, and otherwise, keeping the original values of the corresponding boundaries;
deleting the boundary with the median value of 0 in the boundary array Edge [ ];
wherein amplitude [ k ] represents the kth amplitude value in the amplitude array amplitude [ ], and Edge [ k ] represents the position of the kth barcode boundary in the boundary array Edge [ ];
the bar code boundary refers to a boundary between a black bar and a blank in a bar code;
the boundary judgment specifically comprises the following steps: acquiring a minimum value m and an amplitude Amp of a rising or falling stage of current AD Data, acquiring a maximum value Data _ Max in all AD Data, calculating an amplitude threshold value t of the stage to be Max (39, min (199, (Data _ Max-m)/16)), and if the Amp is greater than t, considering that a barcode boundary exists in the rising or falling stage;
wherein max (a, b) represents taking the maximum value between a and b, and min (a, b) represents taking the minimum value between a and b.
5. The bar code boundary screening apparatus of claim 4, wherein: in the array Peak [ ], Peak [ k ] is equal to the value of the AD data corresponding to the position of Edge [ k ]; the amplitude [ k ] - [ Peak [ k +1] -Peak [ k ] - [ k ].
6. The bar code boundary screening apparatus of claim 4, wherein: the threshold T is 1/10 of the average of the values of the portion 1/3 in the middle of the amplitude array amplitude [ ].
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910223376.1A CN109934040B (en) | 2019-03-22 | 2019-03-22 | Boundary screening method and equipment for one-dimensional bar code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910223376.1A CN109934040B (en) | 2019-03-22 | 2019-03-22 | Boundary screening method and equipment for one-dimensional bar code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109934040A CN109934040A (en) | 2019-06-25 |
| CN109934040B true CN109934040B (en) | 2022-06-10 |
Family
ID=66988080
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910223376.1A Active CN109934040B (en) | 2019-03-22 | 2019-03-22 | Boundary screening method and equipment for one-dimensional bar code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109934040B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102521558A (en) * | 2011-11-18 | 2012-06-27 | 深圳市宝捷信科技有限公司 | Bar code identifying method and device |
| CN104732183A (en) * | 2015-03-20 | 2015-06-24 | 杭州晟元芯片技术有限公司 | One-dimensional barcode identification method based on image sampling line grey scale information analysis |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7147161B2 (en) * | 1998-06-12 | 2006-12-12 | Symbol Technologies, Inc. | Digitizing bar code symbol data |
| US7726571B2 (en) * | 2005-11-28 | 2010-06-01 | Symbol Technologies, Inc. | System and method for bar code decoding |
| CN102663337B (en) * | 2012-03-16 | 2014-07-23 | 江南大学 | Method for quick Data Matrix two-dimensional barcode identifying under simple condition background |
| TWI595426B (en) * | 2016-03-24 | 2017-08-11 | 佳世達科技股份有限公司 | Barcode decoding method |
-
2019
- 2019-03-22 CN CN201910223376.1A patent/CN109934040B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102521558A (en) * | 2011-11-18 | 2012-06-27 | 深圳市宝捷信科技有限公司 | Bar code identifying method and device |
| CN104732183A (en) * | 2015-03-20 | 2015-06-24 | 杭州晟元芯片技术有限公司 | One-dimensional barcode identification method based on image sampling line grey scale information analysis |
Non-Patent Citations (2)
| Title |
|---|
| 基于中值滤波和形态学的条码边缘检测;谢俊喜等;《微计算机信息》;20081125(第33期);全文 * |
| 基于支持向量基的条码分类研究;陈东等;《山东师范大学学报(自然科学版)》;20071215(第04期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109934040A (en) | 2019-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5616905A (en) | Two-dimensional code recognition method | |
| US6181839B1 (en) | Two-dimensional code reader | |
| US8861054B2 (en) | Image processing apparatus, image processing method, computer readable medium and image processing system | |
| EP1456811B1 (en) | Reconstruction of virtual raster | |
| US6758399B1 (en) | Distortion correction method in optical code reading | |
| US9785864B2 (en) | Image processing method, image processing apparatus, program, and recording medium | |
| US20060175414A1 (en) | Method for reading out symbol information and device for reading out symbol information | |
| US8333326B2 (en) | Stacked barcode reader and stacked barcode reading method | |
| US20020023958A1 (en) | Digitizing bar code symbol data | |
| US9070033B2 (en) | Stack barcode reader and stack barcode reading method | |
| CN109657515B (en) | Decoding method and device for one-dimensional bar code | |
| CN109934040B (en) | Boundary screening method and equipment for one-dimensional bar code | |
| CN113516103A (en) | Table image inclination angle determining method based on support vector machine | |
| JP5379626B2 (en) | Stack bar code information reading method and stack bar code information reading device | |
| US20040164158A1 (en) | Bar-code reader | |
| CN116167394A (en) | Bar code recognition method and system | |
| CN112069852A (en) | Low-quality two-dimensional code information extraction method and device based on run-length coding | |
| US20050006479A1 (en) | Digitizing bar code symbol data | |
| CN113536822B (en) | Two-dimensional code correction method and device and computer readable storage medium | |
| JP5657987B2 (en) | Stacked bar code reader and stack bar code reading method | |
| JP5683891B2 (en) | Stacked bar code reader and stack bar code reading method | |
| KR20000025647A (en) | Method for processing image using shading algorithm | |
| JPH10111904A (en) | Bar code reader and recording medium | |
| TWI595426B (en) | Barcode decoding method | |
| US20040164160A1 (en) | Bar-code reader, method of reading a bar code, and computer product |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |