Publication Details
Real-Time Precise Detection of Regular Grids and Matrix Codes
Herout Adam, prof. Ing., Ph.D. (DCGM)
Havel Jiří, Ing., Ph.D. (CM-SFE)
grid, matrix code, parallel coordinates, vanishing point
The traditional approach in detecting sets of concurrent and/or parallel lines is to first detect lines in the image and then find such groups of them which meet the concurrence condition. The Hough Transform can be used for detecting the lines and variants of HT such as the Cascaded Hough Transform can be used to detect the vanishing points. However, these approaches disregard much of the information actually accumulated to the Hough space. This article proposes using the Hough space as a 2D signal instead of just detecting the local maxima and processing them. On the example of QRcode detection, it is shown that this approach is computationally cheap, robust, and accurate. The proposed algorithm can be used for efficient and accurate detection and localization of matrix codes (QRcode, Aztec, DataMatrix, etc.) and chessboard-like calibration patterns.
@article{BUT103448,
author="Markéta {Juránková} and Adam {Herout} and Jiří {Havel}",
title="Real-Time Precise Detection of Regular Grids and Matrix Codes",
journal="Journal of Real-Time Image Processing",
year="2016",
volume="11",
number="1",
pages="193--200",
doi="10.1007/s11554-013-0325-6",
issn="1861-8200",
url="https://link.springer.com/article/10.1007/s11554-013-0325-6"
}