In *Encyclopedia of Multimedia*, pages 768–769. Springer US, 2008. 00000

Paper abstract bibtex

Paper abstract bibtex

SynonymsColor palette reorderingDefinitionReindexing techniques refer to imaging algorithms able to reorder the color palette of color-mapped images. Such techniques are able to reduce the overall entropy of the signal attacking the local index redundancy.In color-mapped imaging, higher compression of color-mapped data is often achieved by reducing the local index redundancy. The so-called reindexing techniques aim at finding the optimal reordering without the consideration of all possible color indexing combinations (M! combinations for an image with M colors). The existing reindexing algorithms are devoted to obtain respectively color and index similarity. An extensive survey of popular reindexing techniques can be found in [1].The pixels in the image I with m rows, n columns, and M distinct colors can be represented as I(x,y) = P(I’(x,y)), where P = \S1, S2, ..., SM\ is the set of all the colors in I, and I’ is an m×n matrix of indexes in \1, 2, ..., M\. Most of th ...

@incollection{furht_reindexing_2008, title = {Reindexing {Techniques}}, copyright = {©2008 Springer-Verlag}, isbn = {978-0-387-74724-8 978-0-387-78414-4}, url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_62}, abstract = {SynonymsColor palette reorderingDefinitionReindexing techniques refer to imaging algorithms able to reorder the color palette of color-mapped images. Such techniques are able to reduce the overall entropy of the signal attacking the local index redundancy.In color-mapped imaging, higher compression of color-mapped data is often achieved by reducing the local index redundancy. The so-called reindexing techniques aim at finding the optimal reordering without the consideration of all possible color indexing combinations (M! combinations for an image with M colors). The existing reindexing algorithms are devoted to obtain respectively color and index similarity. An extensive survey of popular reindexing techniques can be found in [1].The pixels in the image I with m rows, n columns, and M distinct colors can be represented as I(x,y) = P(I’(x,y)), where P = \{S1, S2, ..., SM\} is the set of all the colors in I, and I’ is an m×n matrix of indexes in \{1, 2, ..., M\}. Most of th ...}, language = {en}, urldate = {2016-05-03}, booktitle = {Encyclopedia of {Multimedia}}, publisher = {Springer US}, editor = {Furht, Borko}, year = {2008}, note = {00000}, pages = {768--769} }

Downloads: 0