@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}
}

{"_id":"shtp6QTSFXNAfFcNR","bibbaseid":"furht-reindexingtechniques-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","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":[{"propositions":[],"lastnames":["Furht"],"firstnames":["Borko"],"suffixes":[]}],"year":"2008","note":"00000","pages":"768–769","bibtex":"@incollection{furht_reindexing_2008,\n\ttitle = {Reindexing {Techniques}},\n\tcopyright = {©2008 Springer-Verlag},\n\tisbn = {978-0-387-74724-8 978-0-387-78414-4},\n\turl = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_62},\n\tabstract = {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 ...},\n\tlanguage = {en},\n\turldate = {2016-05-03},\n\tbooktitle = {Encyclopedia of {Multimedia}},\n\tpublisher = {Springer US},\n\teditor = {Furht, Borko},\n\tyear = {2008},\n\tnote = {00000},\n\tpages = {768--769}\n}\n\n","editor_short":["Furht, B."],"key":"furht_reindexing_2008","id":"furht_reindexing_2008","bibbaseid":"furht-reindexingtechniques-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_62"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:15.163Z","downloads":0,"keywords":[],"search_terms":["reindexing","techniques"],"title":"Reindexing Techniques","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}