Fraunhofer-Gesellschaft

Publica

Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Efficient correspondence search algorithm for GOBO projection-based real-time 3D measurement

 
: Dietrich, P.; Heist, S.; Lutzke, P.; Landmann, M.; Grosmann, P.; Kühmstedt, P.; Notni, G.

:

Harding, K.G. ; Society of Photo-Optical Instrumentation Engineers -SPIE-, Bellingham/Wash.:
Dimensional Optical Metrology and Inspection for Practical Applications VIII : 16-17 April 2019, Baltimore, Maryland, United States
Bellingham, WA: SPIE, 2019 (Proceedings of SPIE 10991)
ISBN: 978-1-5106-2647-8
ISBN: 978-1-5106-2648-5
Paper 1099109, 8 S.
Conference "Dimensional Optical Metrology and Inspection for Practical Applications" <8, 2019, Baltimore/Md.>
Englisch
Konferenzbeitrag
Fraunhofer IOF ()

Abstract
Many robot-operated automation tasks require real-time reconstruction of accurate 3D data. While our sensors that are based on GOBO projection-aided stereo matching between two cameras allow for high acquisition frame rates, the 3D reconstruction calculation is really time consuming. In order to find corresponding pixels between cameras, it is necessary to search the best match amongst all pixels within the geometrically possible image area. The well-established method for this search is to compare each candidate pixel by temporal cross correlation of the brightness-value sequences of both pixels. This is computationally intensive and interdicts fast, real-time applications on standard PC hardware. We introduce a new algorithm, which minimizes the number of calculations needed to compare two pixels down to two binary operations per comparison. To achieve this, we pre-calculate a bit-string of binary features for each pixel of both cameras. Then, two pixels can be compared by counting the number of bits that differ between the two bit strings. Our algorithm's results are accurate to a few pixels and require a second, cross correlation-based refinement. In practice, our algorithm (including pre-calculation and refinement step) is much faster than traditional, purely cross correlation-based search, while maintaining a similar level of accuracy.

: http://publica.fraunhofer.de/dokumente/N-574792.html