A pyramid that grows by powers of 2

Authors:
Walter G. Kropatsch
Affiliations:
Center for Automation Research, University of Maryland, College Park, MD 20742, USA
Venue:
Pattern Recognition Letters
Year:
1985

Citing 1
Cited 2

Structured Computer Vision; Machine Perception through Hierarchical Computation Structures

Structured Computer Vision; Machine Perception through Hierarchical Computation Structures

Pyramid segmentation algorithms revisited

Pattern Recognition
Pyramid transform and scale-space analysis in image analysis

Proceedings of the 15th international conference on Theoretical Foundations of Computer Vision: outdoor and large-scale real-world scene analysis

Quantified Score

Hi-index	0.10

Visualization

Abstract

The features of a new pyramid scheme are presented. It is based on a decomposition of a square grid into overlapping 2 x 2 blocks. The diagonal of the square cell becomes the side of a square at the next higher level. Assume unit length at the bottom level 0 of the pyramid, then the side length of a cell at level n is 2^n^2. The number of the elements at level n + 1 is one half of the level n.