Accuracy of the Regularised Dynamic Programming Stereo

نویسندگان

  • Georgy L. Gimel'farb
  • Uri Lipowezky
چکیده

Binocular stereo is an ill-posed problem that has to be regularised with respect to partial occlusions and homogeneous textures for obtaining a unique solution. We analyse typical errors of the dynamic programming stereo based on a probabilistic regularisation of partial occlusions. Experiments show that the reconstruction is accurate until occlusions do not prevail over the binocularly visible terrain.

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

ثبت نام

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

منابع مشابه

Probabilistic regularisation and symmetry in binocular dynamic programming stereo

Conventional binocular dynamic programming stereo is based on matching images of a given stereopair in order to obtain Bayesian or maximum likelihood estimates of hidden Markov models of epipolar terrain profiles. Because of partial occlusions and homogeneous textures, this problem is ill-posed and has to be regularised for getting a unique solution. Regularised matching involves usually heuris...

متن کامل

Likelihood and Confidence of Terrain Profiles in the Symmetric Dynamic Programming Stereo

The paper considers probabilistic regularisation of partial occlusions in the intensity-based symmetric dynamic programming stereo (SDPS). The regularised SDPS relates the total similarity of corresponding pixels to a cumulative log-likelihood ratio for a profile that yields the correspondences. Transition probability models are investigated in detail in order to explicitly relate the likelihoo...

متن کامل

Bankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach

 In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...

متن کامل

Based Dense Stereo Matching using Dynamic Programming and Color

This paper presents a new feature based dense stereo matching algorithm to obtain the dense disparity map via dynamic programming. After extraction of some proper features, we use some matching constraints such as epipolar line, disparity limit, ordering and limit of directional derivative of disparity as well. Also, a coarseto-fine multiresolution strategy is used to decrease the search space ...

متن کامل

Feature Based Dense Stereo Matching using Dynamic Programming and Color

This paper presents a new feature based dense stereo matching algorithm to obtain the dense disparity map via dynamic programming. After extraction of some proper features, we use some matching constraints such as epipolar line, disparity limit, ordering and limit of directional derivative of disparity as well. Also, a coarseto-fine multiresolution strategy is used to decrease the search space ...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2002