Globally optimal bilinear programming for computer vision applications

  title={Globally optimal bilinear programming for computer vision applications},
  author={Manmohan Krishna Chandraker and David J. Kriegman},
  journal={2008 IEEE Conference on Computer Vision and Pattern Recognition},
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 on constructing tight convex relaxations of the objective function and minimizing it in a branch and bound framework. A key contribution of the paper is a novel, provably convergent branching strategy that allows us to solve large-scale problems by restricting the branching dimensions to just one set of variables… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
21 Citations
31 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 21 extracted citations


Publications referenced by this paper.
Showing 1-10 of 31 references

Similar Papers

Loading similar papers…