On minimum entropy graph colorings

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 43-

  Cardinal, Jean ^a   Fiorini, Samuel ^a   Van Assche, Gilles ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMATIC ENTROPY; COLOR INFORMATION; DIGITAL IMAGE PARTITION CODING; GRAPH COLORING;

ALGORITHMS; COLORING; COMPUTATIONAL COMPLEXITY; ENTROPY; GRAPH THEORY; IMAGE COMPRESSION; INFORMATION RETRIEVAL; OPTIMIZATION; PROBABILISTIC LOGICS;

IMAGE CODING;

EID: 5044251909     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M. Accame, F.G.B. De Natale and F. Granelli, Efficient Labeling Procedures for Image Partition Encoding, Signal Processing, 80(6), pp. 1127-1131, June 2000.
2. S. Agarwal and S. Belongie, On the Non-Optimality of Four Color Coding of Image Partitions, Proc. IEEE International Conference on Image Processing, 2002.
3. N. Alon and A. Orlitsky, Source Coding and Graph Entropies, IEEE Transactions on Information Theory, 42(5), pp. 1329-1339, sept. 1996.
4. J. Cardinal, S. Fiorini and G. Van Assche, Technical Report 517, http://www.ulb.ac.be/di/publications/.
5. P. Koulgi, E. Tuncel, S. Regunathan, and K. Rose, On Zero-error Source Coding with Decoder Side Information, IEEE Transactions on Information Theory, 49(1), pp. 99-111, Jan. 2003.
6. Q. Zhao and M. Effros, Low Complexity Code Design for Loss-less and Near-Lossless Side Information Source Codes, Proc. IEEE Data Compression Conference, 2003.