### Abstract

A mathematical framework is provided for shape-from-angle problems, and four primitive problems based on it are discussed. For three of them, algebraic equations are provided from a geometric analysis. A generic 1-D 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 1-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.

Original language | English |
---|---|

Title of host publication | Second Int Conf on Comput Vision |

Publisher | Publ by IEEE |

Pages | 671-678 |

Number of pages | 8 |

ISBN (Print) | 0818608838 |

Publication status | Published - 1988 |

Externally published | Yes |

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Second Int Conf on Comput Vision*(pp. 671-678). Publ by IEEE.

**Shape from angles under perspective projection.** / Shakunaga, Takeshi; Kaneko, Hiroshi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Second Int Conf on Comput Vision.*Publ by IEEE, pp. 671-678.

}

TY - GEN

T1 - Shape from angles under perspective projection

AU - Shakunaga, Takeshi

AU - Kaneko, Hiroshi

PY - 1988

Y1 - 1988

N2 - A mathematical framework is provided for shape-from-angle problems, and four primitive problems based on it are discussed. For three of them, algebraic equations are provided from a geometric analysis. A generic 1-D 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 1-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.

AB - A mathematical framework is provided for shape-from-angle problems, and four primitive problems based on it are discussed. For three of them, algebraic equations are provided from a geometric analysis. A generic 1-D 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 1-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.

UR - http://www.scopus.com/inward/record.url?scp=0024171828&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024171828&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024171828

SN - 0818608838

SP - 671

EP - 678

BT - Second Int Conf on Comput Vision

PB - Publ by IEEE

ER -