Globally optimal bilinear programming for computer vision applications

26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR

Volumn , Issue , 2008, Pages

  Chandraker, Manmohan ^a   Kriegman, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; FACE RECOGNITION; FEATURE EXTRACTION; IMAGE PROCESSING; PATTERN RECOGNITION; RELAXATION PROCESSES; SINGULAR VALUE DECOMPOSITION;

BILINEAR PROGRAMMING; BILINEARITY; BRANCH AND BOUND; COMPUTER VISION APPLICATIONS; CONVEX RELAXATIONS; FACE RECONSTRUCTION; GLOBAL OPTIMUM; LARGE-SCALE PROBLEMS; OBJECTIVE FUNCTION; OPTIMALITY; POTENTIAL APPLICATIONS; RIGID STRUCTURES; SINGLE IMAGES; SINGULAR VALUE DECOMPOSITIONS; SYNTHETIC AND REAL DATA;

COMPUTER APPLICATIONS;

EID: 51949088639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587846     Document Type: Conference Paper

References (30)

1. S. Agarwal, M. Chandraker, F. Kahl, S. Belongie, and D. Kriegman. Practical global optimization for multiview geometry. In ECCV, pages 592-605, 2006.
2. F. Al-Khayyal and J. Falk. Jointly constrained biconvex programming. Math. Oper. Res., 8:273-286, 1983.
3. E. Andersen, C. Roos, and T. Terlaki. On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Prog., 95(2):249-277, 2003.
4. V. Balakrishnan, S. Boyd, and S. Balemi. Branch and bound algorithm for computing minimum stability degree of parameter-dependent linear systems. Int. J. Rob. & Non-lin. Cont., 1(4):295-317, 1991.
5. B. Bascle and A. Blake. Separability of pose and expression in facial tracking and animation. In ICCV, pages 323-328, 1998.
6. P. Belhumeur and D. Kriegman. What is the set of images of an object under all possible lighting conditions? In CVPR, pages 270-277, 1996.
7. V. Blanz and T. Vetter. A morphabe model for the synthesis of 3D faces. In SIGGRAPH, pages 187-194, 1999.
8. M. Chandraker, S. Agarwal, D. Kriegman, and S. Belongie. Globally optimal affine and metric upgrades in stratified autocalibration. In ICCV, 2007.
9. W. Freeman and J. Tenenbaum. Learning bilinear models for two-factor problems in vision. In CVPR, pages 554-560, 1997.
10. A. Fusiello, A. Benedetti, M. Farenzena, and A. Busti. Globally convergent autocalibration using interval analysis. PAMI, 26(12):1633-1638, 2004.
11. P. Hallinan. A low-dimensional representation of human faces for arbitrary lighting conditions. In CVPR, pages 995-999, 1994.
12. D. Henrion and J. B. Lasserre. GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Soft., 29(2):165-194, 2003.
13. R. Horst and H. Tuy. Global Optimization: Deterministic Approaches. Springer Verlag, 2006.
14. A. Hyvarinen, J. Karhunen, and E. Oja. Independent Component Analysis. John Wiley & Sons, Inc., 2001.
15. ∞-norm. In ICCV, pages 1002-1009, Beijing, China, 2005.
16. F. Kahl and D. Henrion. Globally optimal estimates for geometric reconstruction problems. In ICCV, pages 978-985, 2005.
17. J. Koenderink and A. van Doorn. The generic bilinear calibration- estimation problem. IJCV, 23(3):217-234, 1997.
18. H. Konno. A cutting plane algorithm for solving bilinear programs. Math. Prog., 11:14-27, 1976.
19. J. Lasserre. Global optimization with polynomials and problem of moments. SIAM J. Opt., 11(3):796-817, 2001.
20. D. Marimont and B. Wandell. Linear models of surface and illuminant spectra. JOSA, 9(11):1905-1913, 1992.
21. G. McCormick. Computability of global solutions to factorable nonconvex programs. Math. Programming, 10:147-175, 1976.
22. H. Murase and S. K. Nayar. Visual learning and recognition of 3-d objects from appearance. IJCV, 14(1), 1995.
23. P. Parrilo. Sum of squares decompositions for structured polynomials via semidefinite programming. PhD thesis, TU München, 2003.
24. Y. Seo and R. Hartley. A fast method to minimize L-infinity error norm for geometric vision problems. In ICCV, 2007.
25. H. Sherali and A. Alameddine. A new reformulation-linearization technique for bilinear programming problems. J. Glob. Opt., 2(4):379-410, 1992.
26. H. Stewënius, F. Schaffalitzky, and D. Nistër. How hard is three-view triangulation really? In ICCV, pages 686-693, 2005.
27. J. Tenenbaum and W. Freeman. Separating style and content with bilinear models. Neu. Comp., 12(6):1247-1283, 2000.
28. C. Tomasi and T. Kanade. Shape & motion from image streams under orthography: a factorization method. IJCV, 9(2):137-154, 1992.
29. L. Torresani, A. Hertzmann, , and C. Bregler. Learning non-rigid 3d shape from 2d motion. In NIPS, pages 1555-1562, 2003.
30. C. Zach, T. Pock, and H. Bischof. A globally optimal algorithm for robust TV-L1 range image integration. In ICCV, 2007.