Referenced Items are not available for this document.
The compression efficiency of an indexed image depends on the palette ordering. However, obtaining an optimal palette ordering is not an easy task, and approximate solutions are usually sought in practice. Among the available methods, the pairwise merging technique proposed by Memon is the best in terms of compression efficiency. However, this method needs extensive computations. In this letter, a novel algorithm is presented to find an approximate solution of the palette reordering problem. Combined with Pinho's method, our approach is better than the pairwise merging technique in terms of compression efficiency and computing time
Published in:
Signal Processing Letters, IEEE
(Volume:14
,
Issue:
2
)
Date of Publication: Feb. 2007
- Page(s):
- 117 - 120
- ISSN :
- 1070-9908
- INSPEC Accession Number:
- 9254724
- Digital Object Identifier :
- 10.1109/LSP.2006.882106
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 15 January 2007
- Issue Date :
- Feb. 2007
- Sponsored by :
- IEEE Signal Processing Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
