3D Recovery of Polyhedra by Parallelism Heuristics
Toshie Tanaka, Takao Kawashima, Kenichi Kanatani · Systems and Computers in Japan · 1990
Abstract A method is presented which recovers the 3‐D shape of a polyhedron under the assumption of a large number of parallel edges. The method is based on the fact that three or more parallel edges intersect at a point (vanishing point) when extended on the image plane. To determine a pair of two parallel edges, a heuristic method based on the structure of polyhedra is employed. To cope with the error in the image, a threshold processing based on the causes of error is proposed. When parallel edges are found, the 3‐D orientation of each edge can be determined from the vanishing point. However, contradictions may arise in the calculated 3‐D orientations of the edges due to errors. To overcome such a problem, an optimization technique based on the constraint on polyhedra is proposed. Then our method is applied to an actual image.