Shape from angles under perspective projection

Takeshi Shakunaga, Hiroshi Kaneko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

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 languageEnglish
Title of host publicationSecond Int Conf on Comput Vision
PublisherPubl by IEEE
Pages671-678
Number of pages8
ISBN (Print)0818608838
Publication statusPublished - 1988
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Shakunaga, T., & Kaneko, H. (1988). Shape from angles under perspective projection. In Second Int Conf on Comput Vision (pp. 671-678). Publ by IEEE.

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

Second Int Conf on Comput Vision. Publ by IEEE, 1988. p. 671-678.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shakunaga, T & Kaneko, H 1988, Shape from angles under perspective projection. in Second Int Conf on Comput Vision. Publ by IEEE, pp. 671-678.
Shakunaga T, Kaneko H. Shape from angles under perspective projection. In Second Int Conf on Comput Vision. Publ by IEEE. 1988. p. 671-678
Shakunaga, Takeshi ; Kaneko, Hiroshi. / Shape from angles under perspective projection. Second Int Conf on Comput Vision. Publ by IEEE, 1988. pp. 671-678
@inproceedings{418a8a29cb1244138649fb8647289e82,
title = "Shape from angles under perspective projection",
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.",
author = "Takeshi Shakunaga and Hiroshi Kaneko",
year = "1988",
language = "English",
isbn = "0818608838",
pages = "671--678",
booktitle = "Second Int Conf on Comput Vision",
publisher = "Publ by IEEE",

}

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 -