Abstract

The article describes unpaired learning using Monte Carlo Markov Chain on the example of a stereo vision problem. The description includes the inference of the algorithm, the application of the stochastic gradient method, and some implementation details. Multiple penalty functions are considered, and quantitative results are presented. The results of the experiments expose new insights into weights for graphical models for stereo vision problems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call