Abstract
The 2‐D bar code possesses large capacity of data, strong ability for error correction, and high safety, which boosts the 2‐D bar code recognition technology being widely used and developed fast. This paper presents a novel algorithm for locating data matrix code based on finder pattern detection and bar code border fitting. The proposed method mainly involves three stages. It first extracts candidate regions that may contain a data matrix code by morphological processing and then locates the data matrix code roughly by detecting “L” finder pattern and the dashed border on the candidate regions. Finally, the lines fitted with the border points are used as the borders of data matrix code. A number of data matrix code images with complexity background are selected for evaluations. Experimental results show that the proposed algorithm exhibits better performance under complex background and other undesirable conditions.
Highlights
How to locate a 2-D bar code quickly and precisely in an image with complex background, poor illumination or other undesirable condition is crucial to the recognition process
Wenting and Zhi 3 discussed the method of locating data matrix code based on convex algorithm, which determines the 3 vertexes of the “L” finder pattern according to the convex of the edge points of the bar code
We propose a data matrix code location algorithm based on finder pattern detection and bar code border fitting, which is proved by extensive experiments to be effectively and fast
Summary
2-D bar code consists of a certain white and black geometric modules that alternately arrange in the vertical and horizontal directions according to certain rules see Figure 1 , and it is a symbol with large capacity for storing information. Donghong et al 1 proposed an algorithm based on Radon transform, which mainly locates data matrix code by the “L” finder pattern and dashed border detection. The bar code images are always accompanied with complex background, and the images might get stained, incomplete, or printed in high density Under these undesirable conditions, most of the algorithms mentioned above do not work effectively or are not demanded for higher processing power and more storage space, which cannot satisfy most real-time application. We propose a data matrix code location algorithm based on finder pattern detection and bar code border fitting, which is proved by extensive experiments to be effectively and fast.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
