Globally optimal bilinear programming for computer vision applications

By Manmohan Chandraker, David J. Kriegman. 2008

35 citations recorded by the source corpus.

Subfields: Computational Mechanics, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Numerical Analysis, Mathematical Optimization

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

1. Anders P. Eriksson
2. Daniel Tarlow
3. Anton van den Hengel

In Computational Theory and Mathematics

1. Anders P. Eriksson
2. Daniel Tarlow
3. Chris J. Maddison
4. Tom Minka
5. Anton van den Hengel

In Computer Vision and Pattern Recognition

1. Anton van den Hengel
2. Luc Van Gool
3. Anders P. Eriksson
4. Daniel Tarlow
5. Chris J. Maddison
6. Tom Minka
7. Dacheng Tao
8. Xiaogang Wang

In Numerical Analysis

1. Anders P. Eriksson
2. Anton van den Hengel

In Mathematical Optimization

1. Anders P. Eriksson
2. Daniel Tarlow
3. Chris J. Maddison
4. Tom Minka
5. Anton van den Hengel
6. Matthias W. Seeger
7. Tom M. Heskes

Citations in the corpus

• A* Sampling (2014, background): “Example starting points might be ideas from AND/OR search [20] or branch and bound algorithms that only branch on a subset of dimensions [21].”
• Efficient Computation of Robust Weighted Low-Rank Matrix Approximations Using the L_1 Norm (2012, methodology): “We also use the convention that v ¼ vecðV Þ, a notation that will be used interchangeably throughout the remainder of this paper.”