Efficient labeling procedures for image partition encoding

Signal Processing

Volumn 80, Issue 6, 2000, Pages 1127-1131

  Accame, Marco ^a   Natale, Francesco G B De ^b   Granelli, Fabrizio ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; EDGE DETECTION; IMAGE RECONSTRUCTION; IMAGE SEGMENTATION; INFORMATION THEORY; TREES (MATHEMATICS);

IMAGE PARTITION ENCODING;

IMAGE CODING;

EID: 0033733784     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(00)00080-3     Document Type: Article

References (5)

1. K. Appel, W. Haken, J. Koch, Every planar map is four colorable: Part 1, 2, Illinois J. Math 21 (3) (September 1977).
2. M. Eden, M. Kocker, On the performance of a contour coding algorithm in the context of image coding. Part 1: contour segment coding, Signal Processing 8(4) (July 1986) 381-386.
3. M. Kunt, A. Ikonomopoulos, M. Kocher, Second generation image coding techniques, IEEE Proc. 73 (1985) 549-575.
4. J. Ostermann, E.S. Jang, J.-S. Shin, T. Chen, Coding of arbitrarily shaped video objects in MPEG-4, ICIP97, 1997, pp. 496-499.
5. H. Samet, R.E. Webber, On encoding boundaries with quadtrees, IEEE Trans. PAMI 6 (3) (May 1984) 365-369.