English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 612736      Online Users : 68
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/27759

Title: A Novel Approach of Reordering Color Palette for Indexed Image Compression
Authors: Lai;Jim Z. C. Liaw;Yi-Ching
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: Color palette;indexed image;lossless compression;palette reordering
Date: 2007-02
Issue Date: 2011-10-21T02:33:55Z
Publisher: IEEE Signal Processing Letters
Abstract: Abstract: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
Relation: 14(2), pp.117-120
URI: http://ntour.ntou.edu.tw/handle/987654321/27759
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback