ML Anthology

Parallel Line Grouping in Irregular Curve Pyramids

Walter G. Kropatsch, Dieter Willersinn
CVPR 1993 pp. 784-785
doi:10.1109/CVPR.1993.341174 /cvpr/1993/kropatsch1993cvpr-parallel/

Abstract

In order to usefully apply the concept of the curve pyramid on grouping problems, the shift variance problem must be overcome by extending the concept to irregular pyramids. These have a structure that adapts to the image data by deriving control information from curve relations. The algorithm that builds the irregular curve pyramid by deriving higher levels of abstraction from a set of relations goes far beyond merely solving the shift variance problem. It can reduce the computational complexity in comparable applications where all possible combinations of parts have to be checked in order to reassemble complex objects.< <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

Kropatsch and Willersinn. "Parallel Line Grouping in Irregular Curve Pyramids." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993. doi:10.1109/CVPR.1993.341174

Markdown

[Kropatsch and Willersinn. "Parallel Line Grouping in Irregular Curve Pyramids." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993.](https://mlanthology.org/cvpr/1993/kropatsch1993cvpr-parallel/) doi:10.1109/CVPR.1993.341174

BibTeX

@inproceedings{kropatsch1993cvpr-parallel,
  title     = {{Parallel Line Grouping in Irregular Curve Pyramids}},
  author    = {Kropatsch, Walter G. and Willersinn, Dieter},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1993},
  pages     = {784-785},
  doi       = {10.1109/CVPR.1993.341174},
  url       = {https://mlanthology.org/cvpr/1993/kropatsch1993cvpr-parallel/}
}