Computer Vision, Graphics, and Image Processing
Subdivisions of n-dimensional spaces and n-dimensional generalized maps
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Hierarchical Image Analysis Using Irregular Tessellations
IEEE Transactions on Pattern Analysis and Machine Intelligence
The adaptive pyramid: a framework for 2D image analysis
CVGIP: Image Understanding
Irregular Pyramids with Combinatorial Maps
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Introduction to Combinatorial Pyramids
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Receptive Fields within the Combinatorial Pyramid Framework
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Contraction kernels and combinatorial maps
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
nD generalized map pyramids: Definition, representations and basic operations
Pattern Recognition
Generalized map pyramid for multi-level 3d image segmentation
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
A pyramid of n-dimensional generalized maps is a hierarchical data structure. It can be used, for instance, in order to represent an irregular pyramid of n-dimensional images. A pyramid of generalized maps can be built by successively removing and/or contracting cells of any dimension. In this paper, we define generalized orbits, which extend the classical notion of receptive fields. Generalized orbits allow to establish the correspondence between a cell of a pyramid level and the set of cells of previous levels, the removal or contraction of which have led to the creation of this cell. In order to define generalized orbits, we extend, for generalized map pyramids, the notion of connecting walk defined by Brun and Kropatsch.