Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "finder pattern" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Options to use data matrix codes in production engineering
Autorzy:
Karrach, L.
Pivarčiová, E.
Powiązania:
https://bibliotekanauki.pl/articles/409860.pdf
Data publikacji:
2018
Wydawca:
STE GROUP
Tematy:
adaptive thresholding
Data Matrix
Finder Pattern
Timing Pattern
Opis:
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.
Źródło:
Management Systems in Production Engineering; 2018, 4 (26); 231-236
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Recognition of Data Matrix codes in images and their applications in production processes
Autorzy:
Karrach, Ladislav
Pivarčiová, Elena
Powiązania:
https://bibliotekanauki.pl/articles/409791.pdf
Data publikacji:
2020
Wydawca:
STE GROUP
Tematy:
adaptive thresholding
connected component labelling
data matrix code
finder pattern
timing pattern
Opis:
Data Matrix codes can be a significant factor in increasing productivity and efficiency in production processes. An important point in deploying Data Matrix codes is their recognition and decoding. In this paper is presented a computationally efficient algorithm for locating Data Matrix codes in the images. Image areas that may contain the Data Matrix code are to be identified firstly. To identify these areas, the thresholding, connected components labelling and examining outer bounding-box of the continuous regions is used. Subsequently, to determine the boundaries of the Data Matrix code more precisely, we work with the difference of adjacent projections around the Finder Pattern. The dimensions of the Data Matrix code are determined by analyzing the local extremes around the Timing Pattern. We verified the proposed method on a testing set of synthetic and real scene images and compared it with the results of other open-source and commercial solutions. The proposed method has achieved better results than competitive commercial solutions.
Źródło:
Management Systems in Production Engineering; 2020, 3 (28); 154-161
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of manipulation logistics using data matrix codes
Autorzy:
Pivarčiová, Elena
Karrach, Ladislav
Tučková, Zuzana
Powiązania:
https://bibliotekanauki.pl/articles/102648.pdf
Data publikacji:
2018
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
Data Matrix
logistics
localization
Finder Pattern
Timing Pattern
logistyka
lokalizacja
wzór wyszukiwania
wzorzec czasu
Opis:
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.
Źródło:
Advances in Science and Technology. Research Journal; 2018, 12, 3; 173-180
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies