Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 2018

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Finder Pattern

Sortuj według:

Ogranicz wyniki do:

Options to use data matrix codes in production engineering

Karrach L., Pivarčiová E.

Management Systems in Production Engineering

2018

nr 4 (26)

231--236

The paper deals with the possibilities of using Data Matrix codes in production engineering. We designed and tested the computationally efficient method for locating the Data Matrix code in the images. The location search procedure consists of identification of candidate regions using image binarization, then joining adjacent points into continuous regions and also examining outer boundaries of the regions. Afterwards we verify the presence of the Finder Pattern (as two perpendicular line segments) and Timing Pattern (as alternating sequence of black and white modules) in these candidate regions. Such procedure is invariant to shift rotation and scale change of Data Matrix codes. The method we have proposed has been verified on a set of real industrial images and compared to other commercial algorithms. We are also convinced that such technique is also suitable for real-time processing and has achieved better results than comparable commercial algorithms.

Optimization of manipulation logistics using data matrix codes

Pivarčiová Elena, Karrach Ladislav, Tučková Zuzana

Advances in Science and Technology. Research Journal

2018

Vol. 12, no 3

173--180

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.