Polynomial Shape from Shading

被引：22

作者：

Ecker, Ady ^{[1
]}

Jepson, Allan D. ^{[1
]}

机构：

[1] Univ Toronto, Toronto, ON M5S 1A1, Canada

来源：

2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2010年

关键词：

OPTIMIZATION; RELAXATIONS;

D O I：

10.1109/CVPR.2010.5540219

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects. For the general case we propose a semidefinite programming relaxation procedure, and an exact line search iterative procedure with a new smoothness term that favors folds at edges. We use this numerical technique to inspect shading ambiguities.

引用

页码：145 / 152

页数：8

共 41 条

[1]

[Anonymous], P IEEE C COMP VIS PA

[2]

[Anonymous], 2008, 2008 IEEE C COMP VIS

[3]

BARNES KZI, 2000, ESAIM-MATH MODEL NUM, V34, P127

[4] Distribution of points on a sphere with application to star catalogs [J].