A performance analysis of stereo matching algorithms for stereo vision applications in smart environments
by V. Kavitha; G. Balakrishnan
Electronic Government, an International Journal (EG), Vol. 16, No. 1/2, 2020

Abstract: Stereo vision is a subfield of computer vision that tends to an essential research issue of reproducing the three-dimensional directions and focuses for depth estimation. This paper gives a relative investigation of stereo vision and matching techniques, utilised to resolve the correspondence problem. The investigation of matching algorithms is done by the use of extensive experiments on the Middlebury benchmark dataset. The tests concentrated on an examination of three stereovision techniques namely mean shift algorithm (MSA), seed growing algorithm (SGA) and multi-curve fitting (MCF) algorithm. With a specific end goal to evaluate the execution, some statistics related insights were computed. The experimental results demonstrated that best outcome is attained by the MCF algorithm in terms of depth estimation, disparity estimation and CT. The presented MCF algorithm attains a minimum computation time (CT) of 2 s whereas the other MSA and SGA require a maximum CT of 8.9 s and 7 s, respectively. The simulation results verified that the MCF algorithm reduces the processing time in a significant way than the compared methods.

Online publication date: Sat, 22-Feb-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the Electronic Government, an International Journal (EG):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com