Improved Noise-driven Concurrent Stereo Matching Based on Symmetric Dynamic Programming Stereo

نویسندگان

  • Zhen Zhou
  • Georgy Gimel’farb
  • John Morris
  • Patrice Delmas
چکیده

We describe a new version of the two-stage noisedriven concurrent stereo matching (NCSM) algorithm that uses symmetric dynamic programming stereo (SDPS) to estimate image noise and build candidate volumes for placing goal surfaces. In contrast to the initial NCSM, SDPS is first applied successively in xand y-directions in order to obtain a more stable disparity map from points that coincide in both cases and slant planes are fitted to the candidate volumes. This overcomes the principal shortcomings of dynamic programming techniques, such as propagation of matching errors along scan lines and reconstruction of a single continuous surface under the ordering constraint.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Implementation of Symmetric Dynamic Programming Stereo Matching Algorithm Using CUDA

Stereo correspondence is a computationally intensive procedure, real-time depth map generation for high resolution video is beyond the capability of mainstream CPUs available today. Similar to many other vision algorithms, there is a high degree of parallelism available in most of the correspondence algorithms, making multiprocessor architectures as an obvious choice. Here we describe the imple...

متن کامل

Improved Motion Stereo Matching Based on a Modified Dynamic Programming

A new method for computing precise depth map estimates of 3D shape of a moving object is proposed. 3D shape recovery in motion stereo is formulated as a matching optimization problem of multiple stereo images. The proposed method is a heuristic modification of dynamic programming applied to two-dimensional optimization problem. 3D shape recovery using real motion stereo images demonstrates a go...

متن کامل

Disparity space image based stereo matching using optimal path searching

The current paper proposes a fast stereo matching algorithm based on a pixel-wise matching strategy that can produce a stable and accurate disparity map. Since the differences between a pair of stereo images are only small and such differences are just caused by horizontal shifts in a certain order, matching using a large window is not required within a given search range. Therefore, the curren...

متن کامل

Stereo Matching Using Iterative Dynamic Programming Based on Color Segmentation of Images

The traditional dynamic programming stereo matching algorithms usually adopt the disparity assumption based on the intensity change of images; With the development of stereo matching technique, the disparity assumption based on image color segmentation is proved to meet better the need of true scenes. The paper introduces the disparity assumption into the stereo matching using dynamic programmi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007