RWM-cut for color image quantization

doi:10.1016/0097-8493(96)00028-3

Full metadata record

DC Field	Value	Language
dc.contributor.author	Yang, CY	en_US
dc.contributor.author	Lin, JC	en_US
dc.date.accessioned	2014-12-08T15:02:33Z	-
dc.date.available	2014-12-08T15:02:33Z	-
dc.date.issued	1996-07-01	en_US
dc.identifier.issn	0097-8493	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/0097-8493(96)00028-3	en_US
dc.identifier.uri	http://hdl.handle.net/11536/1199	-
dc.description.abstract	A new simple method for constructing a color palette that uses the radius weighted mean cut (RWM-cut) is proposed. The method is a hierarchically divisive method, and each two-class partition uses the centroid and the RWM only. Experiments show that the RWM-cut algorithm is feasible and visually acceptable. The algorithm can either be used alone or be used to create a good initial palette for the LBG algorithm. Besides the 3-D version, a 1-D version of the RWM-cut algorithm is also included in the paper for realtime color quantization. The quantization error is small and the processing speed is competitive. Dithered images are also provided. Copyright (C) 1996 Elsevier Science Ltd	en_US
dc.language.iso	en_US	en_US
dc.title	RWM-cut for color image quantization	en_US
dc.type	Article; Proceedings Paper	en_US
dc.identifier.doi	10.1016/0097-8493(96)00028-3	en_US
dc.identifier.journal	COMPUTERS & GRAPHICS	en_US
dc.citation.volume	20	en_US
dc.citation.issue	4	en_US
dc.citation.spage	577	en_US
dc.citation.epage	588	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1996VP05200011	-
Appears in Collections:	Conferences Paper

Files in This Item:

A1996VP05200011.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.