Subdivisions of n-dimensional spaces and n-dimensional generalized maps
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The adaptive pyramid: a framework for 2D image analysis
CVGIP: Image Understanding
Universal segmentation with PIRRAMIDS
Proceedings of the 20th workshop of the Austrian Association for Pattern Recognition (OAGM/AAPR) on Pattern recognition 1996
Picture Segmentation by a Tree Traversal Algorithm
Journal of the ACM (JACM)
Object Matching on Irregular Pyramid
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Hierarchical representation of discrete data on graphs
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Considerations regarding the minimum spanning tree pyramid segmentation method
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Receptive fields for generalized map pyramids: the notion of generalized orbit
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Hi-index | 0.00 |
This paper presents a new formalism for irregular pyramids based on combinatorial maps. Such pyramid consists of a stack of successively reduced graph. Each smaller graph is deduced from the preceding one by a set of edges which have to be contracted or removed. In order to perform parallel contractions or removals, the set of edges to be contracted or removed has to verify some properties. Such a set of edges is called a Decimation Parameter. A combinatorial map encodes a planar graph thanks to two permutations encoding the edges and their orientation around the vertices. Combining the useful properties of both combinatorial maps and irregular pyramids offers a potential alternative for representing structures at multiple levels of abstraction.