Title: Computing disparity map using minimum sum belief propagation for stereo pair images

Authors: Chitra Suresh; Kushal R. Tuckley

Addresses: Department of Electronics Engineering, Ram Rao Adik Institute of Technology, Navi Mumbai, India ' Department of Electrical Engineering, Indian Institute of Technology, Powai, India

Abstract: Stereo matching between two images is done by computing disparity of all points on the object. The process involves identifying corresponding points in stereo image and finding the horizontal shift. Presently, there is no method that finds the shift in the corresponding points between left and right images; this is due to non-availability of procedure to identify the group of pixel in the right and left image of the same object. The available local methods either use window or feature to find shift in a stereo image. In these methods, 'finalising size of the window' or 'deciding the correct feature' remains an unresolved issue. On the other hand, global methods use graph theory and probability theory to find the shift efficiently. The belief propagation algorithm is one of the global method devised to offer computationally efficient approach with good results. This paper has applied 'minimum sum belief propagation' method for message updates with linear 'quadratic function' for computation of horizontal shift in stereo image. The results with the computational estimations are presented hereby and based on these results, suggestive comments on effectiveness of update which indicate strategy versus type of the image are also mentioned.

Keywords: stereo image; parallax effect; stereo matching; belief propagation; Markov random field; MRF; disparity map.

DOI: 10.1504/IJCVR.2020.110639

International Journal of Computational Vision and Robotics, 2020 Vol.10 No.6, pp.489 - 504

Received: 05 Jul 2018
Accepted: 23 Jun 2019
Published online: 27 Oct 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article