CN109934040A - A kind of boundary filtering method and apparatus of bar code - Google Patents
A kind of boundary filtering method and apparatus of bar code Download PDFInfo
- Publication number
- CN109934040A CN109934040A CN201910223376.1A CN201910223376A CN109934040A CN 109934040 A CN109934040 A CN 109934040A CN 201910223376 A CN201910223376 A CN 201910223376A CN 109934040 A CN109934040 A CN 109934040A
- Authority
- CN
- China
- Prior art keywords
- amplitude
- bar code
- boundary
- data
- value
- 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.)
- Granted
Links
Landscapes
- Signal Processing For Digital Recording And Reproducing (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
The present invention relates to a kind of bar code boundary screening techniques, comprising the following steps: obtains the AD data of bar code, carries out boundary judgement, obtain the position of bar code border and be recorded in boundary array Edge []；The peak value and the valley of decline stage that the AD data ascent stage is obtained according to boundary array Edge [], are recorded in array Peak []；According to array Peak [], the amplitude between peak value and valley adjacent in the AD data is calculated, is recorded in amplitude array amplitude []；Given threshold T, the amplitude array amplitude [] is judged, if amplitude [k] and two neighboring amplitude amplitude [k-1], amplitude [k+1] are respectively less than given threshold T, bar code border Edge [k] and Edge [k+1] is then assigned a value of 0, otherwise retains corresponding boundary initial value；Delete the boundary that array Edge [] intermediate value in boundary is 0.
Description
Technical field
The present invention relates to a kind of boundary filtering method and apparatus of bar code, belong to Bar Code field.
Background technique
Bar code is the item and sky different by of different size, reflectivity, is compiled into according to certain coding rule (code system)
, information representated by bar code is read to express the graphical identifier of set of number or letter character information, is needed
A set of bar code identification system is wanted, it is by bar code scanner, amplification and rectification circuit, decoding interface circuit and computer system etc.
Part forms, i.e., is scanned using bar code reader (barcode scanner is called bar code scanner or barcode reader), obtain one group
Reflected light signal, this signal become one group of electric signal corresponding with lines, blank after photoelectric conversion, restore after decoded
For corresponding text number, then incoming computer.There is bar codes technique high input speed, high reliablity, acquisition to contain much information, flexibly
The advantages that practical.
Due to the interference of the factors such as illumination, distance, bar code object background, the bar code image of acquisition is converted to equipment at present
AD data will include many redundancy clutters, these redundancy clutters typically occur in bar code region two sides and can generate to bar code reading
Adverse effect even results in the decoding failure of bar code scan equipment.
Summary of the invention
In order to solve above-mentioned problems of the prior art, the present invention provides a kind of bar code boundary screening technique to adopting
The AD data collected judge that the stage is handled in bar code border, reduce the generation of false edges, to improve decoded correct
Rate.
Technical scheme is as follows:
Technical solution one
A kind of bar code boundary screening technique, comprising the following steps:
The AD data for obtaining the gray value of bar code carry out the boundary judgement of the bar code, obtain the bar code border of bar code,
Obtained all bar code borders are sequentially recorded in boundary array Edge [] in the position in AD data；
According to boundary array Edge [], obtain each ascent stage of AD data peak value and the AD data it is each under
The valley of depression of order section is sequentially recorded in array Peak []；
According to array Peak [], the amplitude between peak value and valley adjacent in the AD data is calculated, amplitude is sequentially recorded in
In array amplitude []；
Given threshold T judges the amplitude array amplitude [], if amplitude [k] and two neighboring amplitude
Amplitude [k-1], amplitude [k+1] are respectively less than given threshold T, then it is assumed that bar code border Edge [k] and Edge [k+1]
For the false edges that redundancy clutter generates, bar code border Edge [k] and Edge [k+1] is assigned a value of 0, otherwise retains corresponding boundary
Initial value；
Delete the boundary that array Edge [] intermediate value in boundary is 0；
Wherein, amplitude [k] indicates that k-th of amplification value in amplitude array amplitude [], Edge [k] indicate side
The position of k-th of bar code border in boundary array Edge [].
Further, the step of boundary judges specifically: obtain current AD data rising or decline stage most
Small value m and amplitude A mp, in all AD data obtain maximum value Data_Max, calculate the stage amplitude threshold t=max (39,
Min (199, (Data_Max-m)/16)), if Amp > t, then it is assumed that the rising or decline stage, there are bar code borders；
Wherein, max(a, b) indicate to take the maximum value between a and b, min(a, b) indicate to take the minimum value between a and b.
Further, in the array Peak [], Peak [k] is equal to the corresponding AD data in the present position Edge [k]
Numerical value；The amplitude [k]=Shu Peak [k+1]-Peak [k] Shu.
Further, the threshold value T takes 1/10 of the average value of 1/3 component values in the middle part of amplitude array amplitude [].
Technical solution two
A kind of bar code boundary screening installation, including memory and processor, the memory are stored with instruction, and described instruction is suitable
In the bar code image execution following steps for being loaded by processor and being obtained to scanning:
The AD data for obtaining the gray value of bar code carry out the boundary judgement of the bar code, obtain the bar code border of bar code,
Obtained all bar code borders are sequentially recorded in boundary array Edge [] in the position in AD data；
According to boundary array Edge [], obtain each ascent stage of AD data peak value and the AD data it is each under
The valley of depression of order section is sequentially recorded in array Peak []；
According to array Peak [], the amplitude between peak value and valley adjacent in the AD data is calculated, amplitude is sequentially recorded in
In array amplitude []；
Given threshold T judges the amplitude array amplitude [], if amplitude [k] and two neighboring amplitude
Amplitude [k-1], amplitude [k+1] are respectively less than given threshold T, then it is assumed that bar code border Edge [k] and Edge [k+1]
For the false edges that redundancy clutter generates, bar code border Edge [k] and Edge [k+1] is assigned a value of 0, otherwise retains corresponding boundary
Initial value；
Delete the boundary that array Edge [] intermediate value in boundary is 0；
Wherein, amplitude [k] indicates that k-th of amplification value in amplitude array amplitude [], Edge [k] indicate side
The position of k-th of bar code border in boundary array Edge [].
Further, the step of boundary judges specifically: obtain current AD data rising or decline stage most
Small value m and amplitude A mp, in all AD data obtain maximum value Data_Max, calculate the stage amplitude threshold t=max (39,
Min (199, (Data_Max-m)/16)), if Amp > t, then it is assumed that the rising or decline stage, there are bar code borders；
Wherein, max(a, b) indicate to take the maximum value between a and b, min(a, b) indicate to take the minimum value between a and b.
Further, in the array Peak [], Peak [k] is equal to the corresponding AD data in the present position Edge [k]
Numerical value；The amplitude [k]=Shu Peak [k+1]-Peak [k] Shu.
Further, the threshold value T takes 1/10 of the average value of 1/3 component values in the middle part of amplitude array amplitude [].
The invention has the following beneficial effects:
1, the present invention judges that the stage is handled in bar code border to the AD data of collected bar code, reduces false edges
It generates, to improve decoded accuracy.
2, the present invention calculates threshold value T, amplitude array amplitude [] by numerical value in the middle part of amplitude array amplitude []
Middle part numerical value is only in actual bar code the amplitude data that the transformation between item and sky generates, and avoids because of bar code both ends
The redundancy clutter that white space generates impacts threshold value T value.
Detailed description of the invention
Fig. 1 is flow chart of the invention；
Fig. 2 is the exemplary diagram of the AD data got in the embodiment of the present invention；
Fig. 3 is the exemplary diagram of bar code in the embodiment of the present invention；
Fig. 4 is the waveform diagram of the AD data of bar code and the exemplary diagram of bar code border position in the embodiment of the present invention；
Fig. 5 is exemplary diagram of the bar code border after screening in the embodiment of the present invention.
Specific embodiment
It is next in the following with reference to the drawings and specific embodiments that the present invention will be described in detail.
Embodiment one
Referring to Fig. 1 and Fig. 2, a kind of bar code boundary screening technique, comprising the following steps:
The AD data (as shown in Fig. 2, 1500 AD data that Fig. 2 is code39 code) for obtaining the gray value of bar code, carry out side
Boundary's judgement, obtains the bar code border (bar code border refers to the boundary in bar code between secret note and blank) of bar code,
Obtained all bar code borders are sequentially recorded in boundary array Edge [] in the position in AD data；For example, find
One bar code border is the 20th AD data, then [1]=20 Edge；
According to boundary array Edge [], obtain each ascent stage of AD data peak value and the AD data it is each under
The valley of depression of order section is sequentially recorded in array Peak []；Because the wave crest of each ascent stage of AD data each descends depression of order
The trough of section is exactly the location of bar code border, so the peak value of each ascent stage of AD data or the paddy of each decline stage
It is worth the numerical value of the AD data of corresponding bar code border present position, such as Edge [1]=20, and the numerical value of the 20th AD data is
3619, then [1]=3619 Peak；
According to array Peak [], the amplitude between peak value and valley adjacent in the AD data is calculated, amplitude is sequentially recorded in
In array amplitude []；
Given threshold T judges the amplitude array amplitude [], if amplitude [k] and two neighboring amplitude
Amplitude [k-1], amplitude [k+1] are respectively less than given threshold T, then it is assumed that bar code border Edge [k] and Edge [k+1]
For the false edges that redundancy clutter generates, bar code border Edge [k] and Edge [k+1] is assigned a value of 0, otherwise retains corresponding boundary
Initial value；
Delete the boundary that array Edge [] intermediate value in boundary is 0；New boundary array is generated, subsequent decoding is used for.
Wherein, amplitude [k] indicates that k-th of amplification value in amplitude array amplitude [], Edge [k] indicate
The position of k-th of bar code border in boundary array Edge [].
The present embodiment judges that the stage is handled in bar code border to collected AD data, reduces what redundancy clutter generated
False edges are raw, to improve decoded accuracy.
Embodiment two
Further, the boundary judgment step specifically: obtain current AD data rise or the minimum value m of decline stage and
Amplitude A mp obtains maximum value Data_Max in all AD data, calculates the amplitude threshold t=max (39, min in the stage
(199, (Data_Max-m)/16)), if Amp > t, then it is assumed that the rising or decline stage, there are bar code borders；Max(a, b)
Indicate to take the maximum value between a and b, min(a, b) it indicates to take the minimum value between a and b；Referring specifically to Fig. 2, for example, the third line is most
The latter data 3227 arrive the 6th data 3140 of fourth line, this is the decline stage of an AD data, this decline stage
Minimum value m be 3140, amplitude A mp is 87, in Fig. 2 in all AD data, Data_Max=3739；It can by above-mentioned formula
It obtains amplitude threshold t=max (39, min (199, (3739-3140)/16))=39, because amplitude A MP=89 in this stage are greater than width
Threshold value t=39 are spent, so the current generation, there are bar code borders.
Further, in the array Peak [], Peak [k] is equal to the corresponding AD data in the present position Edge [k]
Numerical value；The amplitude [k]=Shu Peak [k+1]-Peak [k] Shu；If such as Peak [1]=3619, Peak [2]=3016, then
Amplitude [1]=Shu Peak [2]-Peak [1] Shu=603.
Further, the threshold value T takes 1/10 of the average value of 1/3 component values in the middle part of amplitude array amplitude [],
Such as a total of 21 numerical value in amplitude array amplitude [], including amplitude [0], amplitude [1],
Amplitude [2] ... amplitude [20] then takes amplitude [7], amplitude [8], amplitude [9] ...
The 1/10 of the average value of amplitude [13] is used as threshold value T；Referring specifically to Fig. 3, because bar code read or so is blank
Area, corresponding AD data are easy to produce clutter in blank area, so taking the 1/10 of the averaged amplitude value of intermediate stable AD data to make
For threshold value T.
Referring specifically to Fig. 3-Fig. 5, Fig. 3 is the scanning figure of code39 bar code, it includes information be * ABC123*；Fig. 4
In, the waveform diagram of top is the change curve of AD data, the bar code side obtained after boundary judges that the vertical line of lower section indicates
The position on boundary, as shown, the stable region of the change curve amplitude of wave form of AD data is substantially in middle position, the clutter of front
For the AD data of bar code blank area, the bar code border in Fig. 4 does not judge whether each bar code border is that redundancy clutter obtains
As a result, the bar code border that noise component generates is translated into " * " after the decoding, so that code39 decoded in error is * * ABC123*；
In Fig. 5, the vertical line of lower section is bar code border by judging whether it is that redundancy clutter obtains as a result, noise component generates
Bar code border filtered, filtered boundary array Edge [] obtains correct result * ABC123* after the decoding.
The present embodiment not only has the beneficial effect of embodiment one, it is also proposed that by amplitude array amplitude []
The numerical value in portion 1/3 calculates threshold value T, and numerical value is only item and sky in actual bar code in the middle part of amplitude array amplitude []
Between transformation generate amplitude data, avoid because bar code both ends white space generate redundancy clutter to threshold value T value
It impacts.
Embodiment three
A kind of bar code boundary screening installation, including memory and processor, the memory are stored with instruction, and described instruction is suitable
In the bar code image execution following steps for being loaded by processor and being obtained to scanning:
The AD data (as shown in Fig. 2, 1500 AD data that Fig. 2 is code39 code) for obtaining the gray value of bar code, carry out side
Boundary's judgement, obtains the bar code border (bar code border refers to the boundary in bar code between secret note and blank) of bar code,
Obtained all bar code borders are sequentially recorded in boundary array Edge [] in the position in AD data；For example, find
One bar code border is the 20th AD data, then [1]=20 Edge；
According to boundary array Edge [], obtain each ascent stage of AD data peak value and the AD data it is each under
The valley of depression of order section is sequentially recorded in array Peak []；Because the wave crest of each ascent stage of AD data each descends depression of order
The trough of section is exactly the location of bar code border, so the peak value of each ascent stage of AD data or the paddy of each decline stage
It is worth the numerical value of the AD data of corresponding bar code border present position, such as Edge [1]=20, and the numerical value of the 20th AD data is
3619, then [1]=3619 Peak；
According to array Peak [], the amplitude between peak value and valley adjacent in the AD data is calculated, amplitude is sequentially recorded in
In array amplitude []；
Given threshold T judges the amplitude array amplitude [], if amplitude [k] and two neighboring amplitude
Amplitude [k-1], amplitude [k+1] are respectively less than given threshold T, then it is assumed that bar code border Edge [k] and Edge [k+1]
For the false edges that redundancy clutter generates, bar code border Edge [k] and Edge [k+1] is assigned a value of 0, otherwise retains corresponding boundary
Initial value；
Delete the boundary that array Edge [] intermediate value in boundary is 0；New boundary array is generated, subsequent decoding is used for.
Wherein, amplitude [k] indicates that k-th of amplification value in amplitude array amplitude [], Edge [k] indicate
The position of k-th of bar code border in boundary array Edge [].
The present embodiment judges that the stage is handled in bar code border to collected AD data, reduces what redundancy clutter generated
False edges are raw, to improve decoded accuracy.
Example IV
Further, the boundary judgment step specifically: obtain current AD data rise or the minimum value m of decline stage and
Amplitude A mp obtains maximum value Data_Max in all AD data, calculates the amplitude threshold t=max (39, min in the stage
(199, (Data_Max-m)/16)), if Amp > t, then it is assumed that the rising or decline stage, there are bar code borders；Max(a, b)
Indicate to take the maximum value between a and b, min(a, b) it indicates to take the minimum value between a and b；Referring specifically to Fig. 2, for example, the third line is most
The latter data 3227 arrive the 6th data 3140 of fourth line, this is the decline stage of an AD data, this decline stage
Minimum value m be 3140, amplitude A mp is 87, in Fig. 2 in all AD data, Data_Max=3739；It can by above-mentioned formula
It obtains amplitude threshold t=max (39, min (199, (3739-3140)/16))=39, because amplitude A MP=89 in this stage are greater than width
Threshold value t=39 are spent, so the current generation, there are bar code borders.
Further, in the array Peak [], Peak [k] is equal to the corresponding AD data in the present position Edge [k]
Numerical value；The amplitude [k]=Shu Peak [k+1]-Peak [k] Shu；If such as Peak [1]=3619, Peak [2]=3016, then
Amplitude [1]=Shu Peak [2]-Peak [1] Shu=603.
Further, the threshold value T takes 1/10 of the average value of 1/3 component values in the middle part of amplitude array amplitude [],
Such as a total of 21 numerical value in amplitude array amplitude [], including amplitude [0], amplitude [1],
Amplitude [2] ... amplitude [20] then takes amplitude [7], amplitude [8], amplitude [9] ...
The 1/10 of the average value of amplitude [13] is used as threshold value T；Referring specifically to Fig. 3, because bar code read or so is blank
Area, corresponding AD data are easy to produce clutter in blank area, so taking the 1/10 of the averaged amplitude value of intermediate stable AD data to make
For threshold value T.
Referring specifically to Fig. 3-Fig. 5, Fig. 3 is the scanning figure of code39 bar code, it includes information be * ABC123*；Fig. 4
In, the waveform diagram of top is the change curve of AD data, the bar code side obtained after boundary judges that the vertical line of lower section indicates
The position on boundary, as shown, the stable region of the change curve amplitude of wave form of AD data is substantially in middle position, the clutter of front
For the AD data of bar code blank area, the bar code border in Fig. 4 does not judge whether each bar code border is that redundancy clutter obtains
As a result, the bar code border that noise component generates is translated into " * " after the decoding, so that code39 decoded in error is * * ABC123*；
In Fig. 5, the vertical line of lower section is bar code border by judging whether it is that redundancy clutter obtains as a result, noise component generates
Bar code border filtered, filtered boundary array Edge [] obtains correct result * ABC123* after the decoding.
The present embodiment not only has the beneficial effect of embodiment three, it is also proposed that by amplitude array amplitude []
The numerical value in portion 1/3 calculates threshold value T, and numerical value is only item and sky in actual bar code in the middle part of amplitude array amplitude []
Between transformation generate amplitude data, avoid because bar code both ends white space generate redundancy clutter to threshold value T value
It impacts.
The above description is only an embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (8)
1. a kind of bar code boundary screening technique, it is characterised in that: the following steps are included:
The AD data for obtaining the gray value of bar code carry out the boundary judgement of the bar code, obtain the bar code border of bar code,
Obtained all bar code borders are sequentially recorded in boundary array Edge [] in the position in AD data；
According to boundary array Edge [], obtain each ascent stage of AD data peak value and each decline of AD data
The valley in stage is sequentially recorded in array Peak []；
According to array Peak [], the amplitude between peak value and valley adjacent in the AD data is calculated, amplitude is sequentially recorded in
In array amplitude []；
Given threshold T judges the amplitude array amplitude [], if amplitude [k] and two neighboring amplitude
Amplitude [k-1], amplitude [k+1] are respectively less than given threshold T, then it is assumed that bar code border Edge [k] and Edge [k+1]
For the false edges that redundancy clutter generates, bar code border Edge [k] and Edge [k+1] is assigned a value of 0, otherwise retains corresponding boundary
Initial value；
Delete the boundary that array Edge [] intermediate value in boundary is 0；
Wherein, amplitude [k] indicates that k-th of amplification value in amplitude array amplitude [], Edge [k] indicate boundary
The position of k-th of bar code border in array Edge [].
2. a kind of bar code boundary screening technique according to claim 1, which is characterized in that the step of boundary judges
Specifically: current AD data rising or the minimum value m and amplitude A mp of decline stage are obtained, is obtained most in all AD data
Big value Data_Max, calculates the amplitude threshold t=max (39, min (199, (Data_Max-m)/16)) in the stage, if Amp > t,
Then think that the rising or decline stage, there are bar code borders；
Wherein, max(a, b) indicate to take the maximum value between a and b, min(a, b) indicate to take the minimum value between a and b.
3. a kind of bar code boundary screening technique according to claim 1, it is characterised in that: in the array Peak []
In, Peak [k] is equal to the numerical value of the corresponding AD data in the present position Edge [k]；The amplitude [k]=Shu Peak [k+1]-
Peak [k] Shu.
4. a kind of bar code boundary screening technique according to claim 1, it is characterised in that: the threshold value T takes amplitude number
The 1/10 of the average value of 1/3 component values in the middle part of group amplitude [].
5. a kind of bar code boundary screening installation, which is characterized in that including memory and processor, the memory is stored with finger
It enables, described instruction is suitable for being loaded by processor and executes following steps to the bar code image that scanning obtains:
The AD data for obtaining the gray value of bar code carry out the boundary judgement of the bar code, obtain the bar code border of bar code,
Obtained all bar code borders are sequentially recorded in boundary array Edge [] in the position in AD data；
According to boundary array Edge [], obtain each ascent stage of AD data peak value and each decline of AD data
The valley in stage is sequentially recorded in array Peak []；
According to array Peak [], the amplitude between peak value and valley adjacent in the AD data is calculated, amplitude is sequentially recorded in
In array amplitude []；
Given threshold T judges the amplitude array amplitude [], if amplitude [k] and two neighboring amplitude
Amplitude [k-1], amplitude [k+1] are respectively less than given threshold T, then it is assumed that bar code border Edge [k] and Edge [k+1]
For the false edges that redundancy clutter generates, bar code border Edge [k] and Edge [k+1] is assigned a value of 0, otherwise retains corresponding boundary
Initial value；
Delete the boundary that array Edge [] intermediate value in boundary is 0；
Wherein, amplitude [k] indicates that k-th of amplification value in amplitude array amplitude [], Edge [k] indicate boundary
The position of k-th of bar code border in array Edge [].
6. a kind of bar code boundary screening installation according to claim 5, which is characterized in that the step of boundary judges
Specifically: current AD data rising or the minimum value m and amplitude A mp of decline stage are obtained, is obtained most in all AD data
Big value Data_Max, calculates the amplitude threshold t=max (39, min (199, (Data_Max-m)/16)) in the stage, if Amp > t,
Then think that the rising or decline stage, there are bar code borders；
Wherein, max(a, b) indicate to take the maximum value between a and b, min(a, b) indicate to take the minimum value between a and b.
7. a kind of bar code boundary screening installation according to claim 5, it is characterised in that: in the array Peak []
In, Peak [k] is equal to the numerical value of the corresponding AD data in the present position Edge [k]；The amplitude [k]=Shu Peak [k+1]-
Peak [k] Shu.
8. a kind of bar code boundary screening installation according to claim 5, it is characterised in that: the threshold value T takes amplitude number
The 1/10 of the average value of 1/3 component values in the middle part of group 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 true CN109934040A (en) | 2019-06-25 |
| CN109934040B 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 (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050006479A1 (en) * | 1998-06-12 | 2005-01-13 | Symbol Technologies, Inc. | Digitizing bar code symbol data |
| US20070119943A1 (en) * | 2005-11-28 | 2007-05-31 | Dariusz Madej | System and method for bar code decoding |
| CN102521558A (en) * | 2011-11-18 | 2012-06-27 | 深圳市宝捷信科技有限公司 | Bar code identifying method and device |
| CN102663337A (en) * | 2012-03-16 | 2012-09-12 | 江南大学 | Method for quick Data Matrix two-dimensional barcode identifying under simple condition background |
| CN104732183A (en) * | 2015-03-20 | 2015-06-24 | 杭州晟元芯片技术有限公司 | One-dimensional barcode identification method based on image sampling line grey scale information analysis |
| US20170277927A1 (en) * | 2016-03-24 | 2017-09-28 | Qisda Corporation | Barcode decoding method |
-
2019
- 2019-03-22 CN CN201910223376.1A patent/CN109934040B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050006479A1 (en) * | 1998-06-12 | 2005-01-13 | Symbol Technologies, Inc. | Digitizing bar code symbol data |
| US20070119943A1 (en) * | 2005-11-28 | 2007-05-31 | Dariusz Madej | System and method for bar code decoding |
| CN102521558A (en) * | 2011-11-18 | 2012-06-27 | 深圳市宝捷信科技有限公司 | Bar code identifying method and device |
| CN102663337A (en) * | 2012-03-16 | 2012-09-12 | 江南大学 | Method for quick Data Matrix two-dimensional barcode identifying under simple condition background |
| CN104732183A (en) * | 2015-03-20 | 2015-06-24 | 杭州晟元芯片技术有限公司 | One-dimensional barcode identification method based on image sampling line grey scale information analysis |
| US20170277927A1 (en) * | 2016-03-24 | 2017-09-28 | Qisda Corporation | Barcode decoding method |
Non-Patent Citations (2)
| Title |
|---|
| 谢俊喜等: "基于中值滤波和形态学的条码边缘检测", 《微计算机信息》 * |
| 陈东等: "基于支持向量基的条码分类研究", 《山东师范大学学报(自然科学版)》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109934040B (en) | 2022-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6181839B1 (en) | Two-dimensional code reader | |
| CN104732183B (en) | A kind of bar code recognition methods based on the analysis of image sampling line half-tone information | |
| CN106875546B (en) | A kind of recognition methods of VAT invoice | |
| CN102870399B (en) | In OCR process, word bitmap is divided into single character or font | |
| CN105229669B (en) | Image processing apparatus and image processing method | |
| CN102521558B (en) | Bar code identifying method and device | |
| CN102360419B (en) | Method and system for computer scanning reading management | |
| EP1836646B1 (en) | Bar code scanner decoding | |
| CN110210440B (en) | Table image layout analysis method and system | |
| US8333326B2 (en) | Stacked barcode reader and stacked barcode reading method | |
| CN112183511A (en) | Method, system, storage medium and equipment for deriving table from image | |
| CN103793679A (en) | One-dimensional bar code recognition method based on DaVinci technology | |
| CN101086766A (en) | Fingerprint image frame sequence combination method based on wave form match | |
| CN101256630B (en) | Denoising apparatus and method for improving document image binaryzation performance | |
| JP4473335B1 (en) | Optical information reading apparatus and optical information reading method | |
| CN109934040A (en) | A kind of boundary filtering method and apparatus of bar code | |
| US7007847B2 (en) | Bar-code reader and method of reading bar-code | |
| KR20150099116A (en) | Method for recognizing a color character using optical character recognition and apparatus thereof | |
| US20040164158A1 (en) | Bar-code reader | |
| CN105574526A (en) | Method and system for realizing line-by-line scanning | |
| JP2012083836A (en) | Stacked barcode reader and stacked barcode reading method | |
| Sarkar et al. | A font invariant character segmentation technique for printed bangla word images | |
| JP2010086324A (en) | Binarization processing apparatus, information processing apparatus, binarization processing method, and binarization processing program | |
| JP2007226328A (en) | Barcode recognition device and barcode recognition method | |
| CN111801675A (en) | One-dimensional code identification method, terminal, device and device with storage function |
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 |