A New Efficient Reordering Algorithm for Color Palette Image | Zendy

Somaye Akbari Moghadam | Zendy; Mahnaz Rajabzade | Zendy; Mohammad Sadeq Garshasbi | Zendy; Javad Sadri | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Efficient Reordering Algorithm for Color Palette Image

Author(s) -

Somaye Akbari Moghadam,

Mahnaz Rajabzade,

Mohammad Sadeq Garshasbi,

Javad Sadri

Publication year - 2013

Publication title -

international journal of image graphics and signal processing

Language(s) - English

Resource type - Journals

eISSN - 2074-9082

pISSN - 2074-9074

DOI - 10.5815/ijigsp.2014.01.08

Subject(s) - palette (painting) , lossless compression , computer science , permutation (music) , search engine indexing , image compression , dither , heuristic , algorithm , scheme (mathematics) , data compression , image (mathematics) , artificial intelligence , computer vision , image processing , mathematics , mathematical analysis , physics , noise shaping , acoustics , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research