Colour image quantisation using KM and KHM clustering techniques with outlier-based initialisation

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter deals with some problems of using clustering techniques Kmeans (KM) and K-harmonic means (KHM) in colour image quantisation. A lot of attention has been paid to initialisation procedures, because they strongly affect the results of the quantisation. Classical versions of KM and KHM start with randomly selected centres. Authors are more interested in using deterministic initialisations based on the distribution of image pixels in the colour space. In addition to two previously proposed initialisations (DC and SD), here is considered a new outlierbased initialisation. It is based on the modified Mirkin’s algorithm (MM) and places the cluster centres in peripheral (outlier) colours of pixels cloud. New approach takes into account small clusters, sometimes representing colours important for proper perception of quantised image. Pixel clustering was created in the RGB, YCbCr and CIELAB colour spaces. Finally, resulting quantised images were evaluated by means of average colour differences in RGB (PSNR) and CIELAB(ΔE) colour spaces and additionally by the loss of colourfulness (ΔM).

Cite

CITATION STYLE

APA

Palus, H., & Frackiewicz, M. (2015). Colour image quantisation using KM and KHM clustering techniques with outlier-based initialisation. Lecture Notes in Computational Vision and Biomechanics, 19, 261–278. https://doi.org/10.1007/978-3-319-13407-9_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free