It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
We propose an algorithm that simultaneously extracts
disparities and alpha matting information given a stereo
image pair. Our method divides the reference image into
a set of ov...
Michael Bleyer (Vienna University of Technology), ...
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the method...
Xin Li, William Kwok-Wai Cheung, Jiming Liu, Zhili...