Abstract
Accurate edge localization of bilevel images is of primary importance in barcode decoding. In the sub-pixel edge location algorithm for bilevel images, the bilevel image (barcode) imaging process is modeled as a square wave convoluted with a Gaussian kernel and then sampled discretely by pixel arrays. Based on the gray levels of the pixels, assumed sub-pixel edge locations are set and adjusted so that the discrepancy of the theoretical gray level of pixels and the actual gray level of pixels reaches the minimum and then the best approximation of the actual sub-pixel edges of the bilevel image is obtained. Examples are presented to illustrate the techniques of the algorithm which can solve the problems of edge location or signal recovery of bilevel images in the case of the two features: one is that the support of the Gaussian kernel is comparable to the distance of the adjacent edges; the other is that the distance between the adjacent edges is comparable to the distance of the adjacent pixels.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
