JOURNAL ARTICLE

Dense real-time stereo matching using memory efficient semi-global-matching variant based on FPGAs

Maximilian Buder

Year: 2012 Journal:   Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE Vol: 8437 Pages: 843709-843709   Publisher: SPIE

Abstract

This paper presents a stereo image matching system that takes advantage of a global image matching method. The system is designed to provide depth information for mobile robotic applications. Typical tasks of the proposed system are to assist in obstacle avoidance, SLAM and path planning. Mobile robots pose strong requirements about size, energy consumption, reliability and output quality of the image matching subsystem. Current available systems either rely on active sensors or on local stereo image matching algorithms. The first are only suitable in controlled environments while the second suffer from low quality depth-maps. Top ranking quality results are only achieved by an iterative approach using global image matching and color segmentation techniques which are computationally demanding and therefore difficult to be executed in realtime. Attempts were made to still reach realtime performance with global methods by simplifying the routines. The depth maps are at the end almost comparable to local methods. An equally named semi-global algorithm was proposed earlier that shows both very good image matching results and relatively simple operations. A memory efficient variant of the Semi-Global-Matching algorithm is reviewed and adopted for an implementation based on reconfigurable hardware. The implementation is suitable for realtime execution in the field of robotics. It will be shown that the modified version of the efficient Semi-Global-Matching method is delivering equivalent result compared to the original algorithm based on the Middlebury dataset. The system has proven to be capable of processing VGA sized images with a disparity resolution of 64 pixel at 33 frames per second based on low cost to mid-range hardware. In case the focus is shifted to a higher image resolution, 1024×1024-sized stereo frames may be processed with the same hardware at 10 fps. The disparity resolution settings stay unchanged. A mobile system that covers preprocessing, matching and interfacing operations is also presented. \n

Keywords:
Computer science Artificial intelligence Matching (statistics) Video Graphics Array Computer vision Robotics Pixel Field-programmable gate array Segmentation Blossom algorithm Mobile robot Robot Computer hardware Mathematics

Metrics

9
Cited By
1.11
FWCI (Field Weighted Citation Impact)
18
Refs
0.81
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Vision and Imaging
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Robotics and Sensor-Based Localization
Physical Sciences →  Engineering →  Aerospace Engineering
Advanced Image Processing Techniques
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition

Related Documents

JOURNAL ARTICLE

A Resource-Efficient Pipelined Architecture for Real-Time Semi-Global Stereo Matching

Zhimin LüJue WangZhiwei LiSong ChenFeng Wu

Journal:   IEEE Transactions on Circuits and Systems for Video Technology Year: 2021 Vol: 32 (2)Pages: 660-673
JOURNAL ARTICLE

MEMORY EFFICIENT SEMI-GLOBAL MATCHING

H. HirschmüllerM. BuderInes Ernst

Journal:   ISPRS annals of the photogrammetry, remote sensing and spatial information sciences Year: 2012 Vol: I-3 Pages: 371-376
BOOK-CHAPTER

SAD-Based Stereo Matching Using FPGAs

Karina AmbroschMartin HumenbergerWilfried KubingerAndreas Steininger

Advances in computer vision and pattern recognition Year: 2008 Pages: 121-138
© 2026 ScienceGate Book Chapters — All rights reserved.