Shape from Angles Under Perspective Projection
Abstract
This paper provides a mathematical framework for shape-from-angle problems, and discusses four primitive problems based on it. For three of them, algebraic equations are provided from a geometric analysis. A generic lD search algorithm is proposed for designing a 1-D search algorithm, usable for any shape-from-angle problems. By designing the problem-dependent parts of the generic algorithm, specific l-D search algorithms are constructed for each problem. The generic algorithm finds all the feasible configurations by detecting the zero-crossing points of a problem-dependent test function on a constraint curve. Experimental results show the effectiveness of each specific algorithm and the applicability of the generic algorithm to several types of shape-from-angle problems.
Cite
Text
Shakunaga and Kaneko. "Shape from Angles Under Perspective Projection." IEEE/CVF International Conference on Computer Vision, 1988. doi:10.1109/CCV.1988.590049Markdown
[Shakunaga and Kaneko. "Shape from Angles Under Perspective Projection." IEEE/CVF International Conference on Computer Vision, 1988.](https://mlanthology.org/iccv/1988/shakunaga1988iccv-shape/) doi:10.1109/CCV.1988.590049BibTeX
@inproceedings{shakunaga1988iccv-shape,
title = {{Shape from Angles Under Perspective Projection}},
author = {Shakunaga, Takeshi and Kaneko, Hiroshi},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1988},
pages = {671-678},
doi = {10.1109/CCV.1988.590049},
url = {https://mlanthology.org/iccv/1988/shakunaga1988iccv-shape/}
}