A stereo matching approach based on particle filters and scattered control landmarks

• A stereo matching approach motivated by the particle filter framework in robot localization.
• Highly accurate GCPs, acquired by the computation of multiple cost efficient disparity maps.
• A Markov chain model has been introduced in the process to reduce the computational complexity of particle filtering.
• Application of RANSAC algorithm along with a histogram technique to refine any outliers.

In robot localization, particle filtering can estimate the position of a robot in a known environment with the help of sensor data. In this paper, we present an approach based on particle filtering, for accurate stereo matching. The proposed method consists of three parts. First, we utilize multiple disparity maps in order to acquire a very distinctive set of features called landmarks, and then we use segmentation as a grouping technique. Secondly, we apply scan line particle filtering using the corresponding landmarks as a virtual sensor data to estimate the best disparity value. Lastly, we reduce the computational redundancy of particle filtering in our stereo correspondence with a Markov chain model, given the previous scan line values. More precisely, we assist particle filtering convergence by adding a proportional weight in the predicted disparity value estimated by Markov chains. In addition to this, we optimize our results by applying a plane fitting algorithm along with a histogram technique to refine any outliers. This work provides new insights into stereo matching methodologies by taking advantage of global geometrical and spatial information from distinctive landmarks. Experimental results show that our approach is capable of providing high-quality disparity maps comparable to other well-known contemporary techniques.

Figure optionsDownload high-quality image (228 K)Download as PowerPoint slide