Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...
Qingxiong Yang, Liang Wang, Ruigang Yang, Henrik S...
This paper presents a probabilistic framework for computing correspondences and fundamental matrix in the structure from motion problem. Inspired by Moisan and Stival [1], we sugg...
This paper presents an efficient method for the estimation and recovering from nonlinear or local geometrical distortions, such as the random bending attack and restricted project...
Web crawlers generate significant loads on Web servers, and are difficult to operate. Instead of repeatedly running crawlers at many "client" sites, we propose a central...