{"title":"Dense real-time stereo matching using memory efficient semi-global-matching variant based on FPGAs","authors":"M. Buder","doi":"10.1117/12.921147","DOIUrl":null,"url":null,"abstract":"This paper presents a stereo image matching system that takes advantage of a global image matching method. The system \nis designed to provide depth information for mobile robotic applications. Typical tasks of the proposed system are to assist \nin obstacle avoidance, SLAM and path planning. Mobile robots pose strong requirements about size, energy consumption, \nreliability and output quality of the image matching subsystem. Current available systems either rely on active sensors or \non local stereo image matching algorithms. The first are only suitable in controlled environments while the second suffer \nfrom low quality depth-maps. Top ranking quality results are only achieved by an iterative approach using global image \nmatching and color segmentation techniques which are computationally demanding and therefore difficult to be executed \nin realtime. Attempts were made to still reach realtime performance with global methods by simplifying the routines. The \ndepth maps are at the end almost comparable to local methods. An equally named semi-global algorithm was proposed \nearlier that shows both very good image matching results and relatively simple operations. A memory efficient variant of \nthe Semi-Global-Matching algorithm is reviewed and adopted for an implementation based on reconfigurable hardware. \nThe implementation is suitable for realtime execution in the field of robotics. It will be shown that the modified version of \nthe efficient Semi-Global-Matching method is delivering equivalent result compared to the original algorithm based on the \nMiddlebury dataset. \nThe system has proven to be capable of processing VGA sized images with a disparity resolution of 64 pixel at \n33 frames per second based on low cost to mid-range hardware. In case the focus is shifted to a higher image resolution, \n1024×1024-sized stereo frames may be processed with the same hardware at 10 fps. The disparity resolution settings \nstay unchanged. A mobile system that covers preprocessing, matching and interfacing operations is also presented.","PeriodicalId":369288,"journal":{"name":"Real-Time Image and Video Processing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Real-Time Image and Video Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.921147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
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.