This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hardware-Efficient Bilateral Filtering for Stereo Matching
PrePrint
ISSN: 0162-8828
Qingxiong Yang, City University of Hong Kong, Hong Kong
This paper presents a new bilateral filtering method specially designed for practical stereo vision systems. Parallel algorithms are preferred in these systems due to the real-time performance requirement. Edge-preserving filters like the bilateral filter have been demonstrated to be very effective for high-quality local stereo matching. A hardware-efficient bilateral filter is thus proposed in this paper. When moved to an NVIDIA GeForce GTX 580 GPU, it can process a one megapixel \textit{color} image at around 417 frames per second. This filter can be directly used for cost aggregation required in any local stereo matching algorithm. Quantitative evaluation shows that it outperforms all the other local stereo methods both in terms of accuracy and speed on Middlebury benchmark. It ranks $12^{th}$ out of over 120 methods on Middlebury data sets, and the average runtime (including the matching cost computation, occlusion handling and post processing) is only 15 milliseconds (67 frames per second).
Index Terms:
Kernel,Joints,Runtime,Image resolution,Image edge detection,Graphics processing units,Stereo vision,Filtering,3D/stereo scene analysis,Computer vision
Citation:
Qingxiong Yang, "Hardware-Efficient Bilateral Filtering for Stereo Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, 20 Nov. 2013. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.186>
Usage of this product signifies your acceptance of the Terms of Use.