Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Error Reduction by Artificial Intelligence Based Search and Bidirectional Scan in Dynamic Programming in Stereo Vision


Affiliations
1 Department of Information Technology, Punjab Engineering College, Chandigarh, India
2 Department of Computer Science, Punjab Engineering College, Chandigarh, India
     

   Subscribe/Renew Journal


The determination of three dimensional information about the scene from two or more two dimensional views of the same scene has been a problem widely discussed in study of computer vision. Stereovision uses two cameras which capture a pair of image locations and then a single three dimensional physical location is derived by exploiting a number of constraints. For the purpose of exploiting these constraints local and global methods are used that attempts to match pixels in one image with their corresponding pixels in the other image. In our paper we use the global method:Dynamic Programming to find the correct match between the two images and also to improve the efficiency we use the bidirectional matching in which dynamic programming is applied from left to right and then from right to left to avoid occlusion and A* search for increasing the quality of the results is to use an optimal searching methodology for the minimal cost path.

Keywords

Stereovision, Constraints, Disparity.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 209

PDF Views: 4




  • Error Reduction by Artificial Intelligence Based Search and Bidirectional Scan in Dynamic Programming in Stereo Vision

Abstract Views: 209  |  PDF Views: 4

Authors

Arvind Kakria
Department of Information Technology, Punjab Engineering College, Chandigarh, India
Ajay Mittal
Department of Computer Science, Punjab Engineering College, Chandigarh, India
Prakaram Joshi
Department of Information Technology, Punjab Engineering College, Chandigarh, India

Abstract


The determination of three dimensional information about the scene from two or more two dimensional views of the same scene has been a problem widely discussed in study of computer vision. Stereovision uses two cameras which capture a pair of image locations and then a single three dimensional physical location is derived by exploiting a number of constraints. For the purpose of exploiting these constraints local and global methods are used that attempts to match pixels in one image with their corresponding pixels in the other image. In our paper we use the global method:Dynamic Programming to find the correct match between the two images and also to improve the efficiency we use the bidirectional matching in which dynamic programming is applied from left to right and then from right to left to avoid occlusion and A* search for increasing the quality of the results is to use an optimal searching methodology for the minimal cost path.

Keywords


Stereovision, Constraints, Disparity.