Abstract
Following K. Sugihara (Artif. Intell. 23, 1984, 59-95), we represent the geometric constraints imposed by the line-drawing of a polyhedron as a set of linear equalities and inequalities. Unlike him, we explicitly take into account the uncertainty in vertex position. This allows us to circumvent the superstrictness of the constraints without deleting any of them. For a given error bound, deciding whether a line-drawing is the correct projection of a polyhedron is reduced to linear programming, and 3D shape recovery is reduced to optimization under linear constraints. Our method can be used for recovering the shape of any polyhedral object whose reflectance can be modelled accurately. We have implemented it for the following reflectance models: the Lambertian model, a Lambertian model with interreflections, and a reflectance model for specular objects. We present results obtained using real images.
| Original language | English |
|---|---|
| Pages (from-to) | 296-310 |
| Number of pages | 15 |
| Journal | Computer Vision and Image Understanding |
| Volume | 65 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 1997 |
| Externally published | Yes |
Bibliographical note
Funding Information:This work was supported in part by the Beckman Institute and the Center for Advanced Study of the University of Illinois at Urbana-Champaign, by the National Science Foundation under Grant IRI-9224815, and by the National Aeronautics and Space Administration under Grant NAG 1-613.
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition