Construction of combinatorial pyramids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2726, Issue , 2003, Pages 1-12

  Brun, Luc ^a   Kropatsch, Walter G ^b  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); GRAPHIC METHODS; IMAGE SEGMENTATION; PATTERN RECOGNITION;

COMBINATORIAL MAPS; COMBINATORIAL PYRAMIDS; CONNECTED SETS; CONSTRUCTION SCHEME; IRREGULAR PYRAMIDS; RECEPTIVE FIELDS; REDUCED GRAPHS; REGION ADJACENCY GRAPHS;

GRAPH THEORY;

EID: 35248890511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45028-9_1     Document Type: Article

References (16)

1. rd Workshop on Graph-based Representations in Pattern Recognition, pages 64-73, Ischia(Italy), May 2001. IAPR-TC15, CUEN.
2. L. Brun. Traitement d'images couleur et pyramides combinatoires. Habilitation à diriger des recherches, Université de Reims, 2002.
3. L. Brun and W. Kropatsch. The construction of pyramids with combinatorial maps. Technical Report 63, Institute of Computer Aided Design, Vienna University of Technology, lstr. 3/1832,A-1040 Vienna AUSTRIA, June 2000.
4. rd IAPR-TC15 Workshop on Graphbased Representations in Pattern Recognition, pages 12-21, Ischia Italy, May 2001. IAPR-TC15, CUEN.
5. R. Diestel. Graph theory. Springer-Verlag, New York, 2 edition, 2000.
6. C. Fiorio and J. Gustedt. Two linear time union-find strategies for image processing. Technical Report 375/1994, Technische Universität Berlin, 1994.
7. A. J. Gareth and D. Singerman. Theory of maps on orientable surfaces. Proceedings of the London Mathematical Society, 3(37):273-307, 1978.
8. Y. Haxhimusa, R. Glantz, M. Saib, G. Langs, and W. G. Kropatsch. Logarithmic Tapering Graph Pyramid. In L. Van Gool, editor, Pattern Recognition, 24th DAGM Symposium, volume 2449 of Lecture Notes in Computer Science, pages 117-124, Zurich, Switzerland, September 2002. Springer, Berlin Heidelberg.
9. rd IAPR-TC15 Workshop on Graph based Representation in Pattern Recognition, pages 105-114, Ischia-Italy, May 2001.
10. J. M. Jolion and A. Montanvert. The adaptative pyramid: A framework for 2d image analysis. Computer Vision, Graphics, and Image Processing, 55(3):339-348, May 1992.
11. P. Lienhardt. Topological models for boundary representations: a comparison with n-dimensional generalized maps. Computer-Aided Design, 23(1):59-82, 1991.
12. P. Meer. Stochastic image pyramids. Computer Vision Graphics Image Processing, 45:269-294, 1989.
13. A. Montanvert, P. Meer, and A. Rosenfeld. Hierarchical image analysis using irregular tessellations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(4):307-316, APRIL 1991.
14. R. E. Tarjan. Efficiency of a good but non linear set union algorithm. J. Assoc. Comput. System Mach., 22:215-225, 1975.
15. D. Willersinn and W. G. Kropatsch. Dual graph contraction for irregular pyramids. In International Conference on Pattern Recogntion D: Parallel Computing, pages 251-256, Jerusalem, Israel, 1994. International Association for Pattern Recognition.
16. S. Wong, S. Wan, and P. Prusinkiewicz. Monochrome image quantization. In Canadian conference on electrical and computer engineering, pages 17-20, September 1989.