Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/CVPR.2010.5540219 | Computer Vision and Pattern Recognition |
Keywords | Field | DocType |
iterative methods,polynomials,shape recognition,exact line search iterative procedure,polyhedral objects,polynomial shape,semidefinite programming relaxation procedure,shading ambiguities | Polynomial,Computer science,Line search,Minification,Artificial intelligence,Smoothness,Computer vision,Boundary value problem,Mathematical optimization,Iterative method,Algorithm,Photometric stereo,Shading | Conference |
Volume | Issue | ISSN |
2010 | 1 | 1063-6919 |
ISBN | Citations | PageRank |
978-1-4244-6984-0 | 20 | 0.70 |
References | Authors | |
25 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ecker, A. | 1 | 20 | 0.70 |
| Jepson, A.D. | 2 | 402 | 81.91 |