A New Efficient Reordering Algorithm for Color Palette Image
Автор: Somaye Akbari Moghadam, Mahnaz Rajabzade, Mohammad Sadeq Garshasbi, Javad Sadri
Журнал: International Journal of Image, Graphics and Signal Processing(IJIGSP) @ijigsp
Статья в выпуске: 1 vol.6, 2013 года.
Бесплатный доступ
Palette re-ordering is a class of pre-processing methods aiming at finding a permutation of color palette such that the resulting image of indexes is more amenable for compression. The efficiency of lossless compression algorithms for fixed-palette images (indexed images) may change if a different indexing scheme is adopted. Obtaining an optimal re-indexing scheme is suspected to be a hard problem and only approximate solutions have been provided in literature. In this paper, we explore a heuristic method to improve the performances on compression ratio. The results indicate that the proposed approach is very effective, acceptable and proved.
Reindexing, NP-Complete, Lossless, Compression, Genetic Algorithms
Короткий адрес: https://sciup.org/15013197
IDR: 15013197
Список литературы A New Efficient Reordering Algorithm for Color Palette Image
- Ming-ni wu, Chia-chen lin and Chin-chen chang, " A Color Re-Indexing Scheme Using Genetic Algorithm", Proceedings of the 6th WSEAS International Conference on Multimedia Systems & Signal Processing, Hangzhou, China, April 16-18, 2006 (pp125-131).
- Sebastiano Battiato, Giovanni Gallo, Gaetano Impoco, and Filippo Stanco, " An Efficient Re- Indexing Algorithm for Color-Mapped Images ", IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 13, NO. 11, NOVEMBER 2004.
- Chin-Chen Changa, Chih-Yang Linb and Yi-Hsuan Fanb, " Lossless data hiding for color images based on block truncation coding ", Elsevier, Pattern Recognition 41 (2008) 2347 – 2357.
- P. Niraimathia, M.S. Sudhakara and K. Bhoopathy Baganb, " Efficient reordering algorithm for color palette image using adaptive particle swarm technique ", Elsevier, Applied Soft Computing 12 (2012) 2199–2207.
- A.J. Pinho, A.J.R. Neves, A note on Zeng’s technique for color reindexing of palette-based images, IEEE Signal Process. Lett. 11 (2) (2004) 232–234.
- Z. Arnavut, F. Sahin, Lossless compression of color palette images with one dimensional technique, J. Electron. Imaging 15 (2) (2006).
- A.J. Pinho, A.J.R. Neves, Survey on palette reordering methods, IEEE Trans. Image Process. 13 (11) (2004) 1411–1418.
- J.V. Hook, F. Sahin, Z. Arnavut, Application of particle swarm optimization for traveling salesman problem to lossless compression of color palette images, in: Proceedings of IEEE SMC System of Systems Engineering, 2008, pp. 1–5.
- P.T. de Boer, D.P. Kroese, S. Mannor, R.Y. Rubinstein, A tutorial on the crossentropy method, Ann. Oper. Res. (2005) 19–67.
- Cengiz Kahramana, Orhan Enginb, Ihsan Kayaa, and R. Elif, Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach, Elsevier, Applied Soft Computing 10 (2010) 1293–1300.
