Pyramid computer algorithms for determining geometric properties of images

Authors:
Russ Miller;Quentin F. Stout
Affiliations:
Mathematical Sciences, State University of New York, Binghamton, NY;Elec. Eng. and Comp. Sci., University of Michigan, Ann Arbor, MI
Venue:
SCG '85 Proceedings of the first annual symposium on Computational geometry
Year:
1985

Citing 5
Cited 3

Pyramid computer solutions of the closest pair problem

Journal of Algorithms
Sorting on a mesh-connected parallel computer

Communications of the ACM
Multicomputers and Image Processing: Algorithms and Programs; Based on a Symposium Held in Madison, WISC., May 26-29, 1981

Multicomputers and Image Processing: Algorithms and Programs; Based on a Symposium Held in Madison, WISC., May 26-29, 1981
Structured Computer Vision; Machine Perception through Hierarchical Computation Structures

Structured Computer Vision; Machine Perception through Hierarchical Computation Structures
Computational Aspects of VLSI

Computational Aspects of VLSI

Hierarchical Data Structures and Algorithms for Computer Graphics

IEEE Computer Graphics and Applications
Efficient Mappings of Pyramid Networks

IEEE Transactions on Parallel and Distributed Systems
Object-based and image-based object representations

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives several pyramid computer algorithms for determining geometric properties of black/white digitized pictures stored in the base of the pyramid. These algorithms determine properties such as convexity and nearest neighbors of black figures. We show that the pyramid is faster than either a tree of mesh machine, but, like the tree, the time needed by algorithms is quite sensitive to the amount of data movement required. We also consider modified pyramids in which each base processor stores many pixels, and machine models which are related to the pyramid.