Publication detail
Real-Time Precise Detection of Regular Grids and Matrix Codes
JURÁNKOVÁ, M. HEROUT, A. HAVEL, J.
Original Title
Real-Time Precise Detection of Regular Grids and Matrix Codes
English Title
Real-Time Precise Detection of Regular Grids and Matrix Codes
Type
journal article in Web of Science
Language
en
Original 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.
English 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.
Keywords
grid, matrix code, parallel coordinates, vanishing point
RIV year
2013
Released
01.01.2016
Publisher
NEUVEDEN
Location
NEUVEDEN
ISBN
1861-8200
Periodical
Journal of Real-Time Image Processing
Year of study
11
Number
1
State
DE
Pages from
193
Pages to
200
Pages count
8
URL
Documents
BibTex
@article{BUT103448,
author="Markéta {Juránková} and Adam {Herout} and Jiří {Havel}",
title="Real-Time Precise Detection of Regular Grids and Matrix Codes",
annote="
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.",
address="NEUVEDEN",
chapter="103448",
doi="10.1007/s11554-013-0325-6",
edition="NEUVEDEN",
howpublished="print",
institution="NEUVEDEN",
number="1",
volume="11",
year="2016",
month="january",
pages="193--200",
publisher="NEUVEDEN",
type="journal article in Web of Science"
}