Search - graph algorithms

Search - graph algorithms - List

[SourceCode] computing dense correspondence graph cuts DL : 0: computing dense correspondence # # (disparity map) between two images using graph cuts This software implements stereo algorithms described in the following papers: Vladimir Kolmogorov and Ramin Zabih "Multi-Camera scene Reconstruction via Graph Cuts" In: European Conference on Computer Vision, May 2002. Vladimir Kolmogorov and Ramin Zabih "Computing Visual Correspondence with Occlusions using Graph Cuts" In: International Conference on Computer Vision, July 2001. and Yuri Boykov, Olga Veksler and Ramin Zabih "Markov Random Fields with Efficient Approximations" In: IEEE Computer Vision and Pattern Recognition Conference, June 1998.
Date : 2010-12-03 Size : 1.26mb User : newship@126.com