Proceedings of the 2012 National Conference on Information Technology and Computer Science

Indexing Coded Stripe Patterns Based on De Bruijn in Color Structured Light System

Authors
Cheng Han, Zhengang Jiang
Corresponding Author
Cheng Han
Available Online November 2012.
DOI
https://doi.org/10.2991/citcs.2012.236How to use a DOI?
Keywords
color structured light; De Bruijn coding; clustering analysis; weighted directed graph
Abstract
The problem of relating projected and captured stripes, here called the Indexing Problem, has proved to be difficult to overcome reliably for stripe patterns in color structured light, due to color fidelity of the projector and the camera, the ambient light, texture of measured object and other factors. In order to solve the Indexing Problem, a new method is proposed. The method extract the center color stripe based on cluster analysis at first. We convert color coded image based on De Bruijn into weighted directed digraph, then match stripe according to coded values. The proposed method is the center of colored stripes as the basic decoding units. Results are significantly more rapid, accurate and reliable than previous attempts.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2012 National Conference on Information Technology and Computer Science
Part of series
Advances in Intelligent Systems Research
Publication Date
November 2012
ISBN
978-94-91216-39-8
ISSN
1951-6851
DOI
https://doi.org/10.2991/citcs.2012.236How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Cheng Han
AU  - Zhengang Jiang
PY  - 2012/11
DA  - 2012/11
TI  - Indexing Coded Stripe Patterns Based on De Bruijn in Color Structured Light System
BT  - 2012 National Conference on Information Technology and Computer Science
PB  - Atlantis Press
SP  - 928
EP  - 931
SN  - 1951-6851
UR  - https://doi.org/10.2991/citcs.2012.236
DO  - https://doi.org/10.2991/citcs.2012.236
ID  - Han2012/11
ER  -