ML Anthology

On Finding the Ends of Straight Homogeneous Generalized Cylinders

Hiroaki Sato, Thomas O. Binford
CVPR 1992 pp. 695-698
doi:10.1109/CVPR.1992.223198 /cvpr/1992/sato1992cvpr-finding/

Abstract

Algorithms to detect pairs of edges that could be ends of a straight homogeneous generalized cylinder (SHGC) are proposed. Geometrical constraints for the ends of an SHGC are utilized to group edge elements and edge segments in a complex image. Two methods are investigated. The first algorithm is for a subset of SHGCs for which scaling factors of the cross section at both ends are the same. The second algorithm is for any SHGC. However, a modified version is implemented to reduce computation; given a reference and edge, it finds the edges possibly paired with it. Several examples of ends extracted from real images are reported to show the feasibility of the algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

CVPR Semantic Scholar

Cite

Text

Sato and Binford. "On Finding the Ends of Straight Homogeneous Generalized Cylinders." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223198

Markdown

[Sato and Binford. "On Finding the Ends of Straight Homogeneous Generalized Cylinders." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/sato1992cvpr-finding/) doi:10.1109/CVPR.1992.223198

BibTeX

@inproceedings{sato1992cvpr-finding,
  title     = {{On Finding the Ends of Straight Homogeneous Generalized Cylinders}},
  author    = {Sato, Hiroaki and Binford, Thomas O.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1992},
  pages     = {695-698},
  doi       = {10.1109/CVPR.1992.223198},
  url       = {https://mlanthology.org/cvpr/1992/sato1992cvpr-finding/}
}