Publication Details

Real-Time Precise Detection of Regular Grids and Matrix Codes

DUBSKÁ Markéta, HEROUT Adam and HAVEL Jiří. Real-Time Precise Detection of Regular Grids and Matrix Codes. Journal of Real-Time Image Processing, vol. 11, no. 1, 2016, pp. 193-200. ISSN 1861-8200. Available from: https://link.springer.com/article/10.1007/s11554-013-0325-6
Czech title
Přesná detekce mřížek a maticových kódů v reálném čase
Type
journal article
Language
english
Authors
URL
Keywords

grid, matrix code, parallel coordinates, vanishing point

Abstract


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.

Published
2016
Pages
193-200
Journal
Journal of Real-Time Image Processing, vol. 11, no. 1, ISSN 1861-8200
Publisher
Springer Verlag
DOI
UT WoS
000368377800017
EID Scopus
BibTeX
@ARTICLE{FITPUB10240,
   author = "Mark\'{e}ta Dubsk\'{a} and Adam Herout and Ji\v{r}\'{i} Havel",
   title = "Real-Time Precise Detection of Regular Grids and Matrix Codes",
   pages = "193--200",
   journal = "Journal of Real-Time Image Processing",
   volume = 11,
   number = 1,
   year = 2016,
   ISSN = "1861-8200",
   doi = "10.1007/s11554-013-0325-6",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/10240"
}
Back to top