In the paper we deal with optimization of manipulation logistics using Data Matrix codes. Our goal is scanning and decoding Data Matrix codes in real-time. We have designed and verified an efficient computer aided method for location of the Data Matrix codes. This method is also suited to real-time processing and has been verified on a test set of images taken from real industrial world. We have proposed a modified, computationally efficient local thresholding technique that uses local mean and variation under the sliding window. The proposed Data Matrix code localization algorithm utilizes the connecting of the adjoining points into the continuous regions and determining of the boundaries of the outer region and it works in two basic steps: localization of the Finder Pattern and verification of the Timing Pattern. Part of the algorithm deals also with the decoding of the Data Matrix code using external libraries. Data Matrix codes can be used to mark logistic units, parts, warehousing positions, but also for automated robot navigation. Because of their low cost, accuracy, speed, reliability, flexibility and efficiency, as well as the ability to write large amounts of data on a small area, they still have a great advantage in logistics.

[KEGA MS SR 003TU Z-4/2016]