The analyse of the various methods for location of Data Matrix codes in images

Abstract

Data Matrix codes belong to the group of 2-D bar codes, which are widely used in marking the products in storing, production, distribution and sales processes. Their compact matrix structure enables to store big amount of information in a very small area compared to conventional 1-D bar codes. In following paper we compare several methods for detection of Data Matrix codes in images. When locating the position of the code we start from typical bordering of Data Matrix code - which forms “L” so called Finder Pattern and to it the parallel dotting so called Timing Pattern. On the first stage we try to locate Finder Pattern using the edge detection or adaptive thresholding, then continuing with connecting the points into the continuous regions, we are searching for the regions, which could represent the Finder Pattern. On the second stage we verify Timing Pattern where the number of crossing between the background and foreground must be even.