Soft computing-based colour quantisation
© Schaefer; licensee Springer. 2014
Received: 11 April 2012
Accepted: 9 January 2014
Published: 28 January 2014
Soft computing techniques have shown much potential in a variety of computer vision and image analysis tasks. In this paper, an overview of recent soft computing approaches to the colour quantisation problem is presented. Colour quantisation is a common image processing technique to reduce the number of distinct colours in an image. Those selected colours form a colour palette, while the resulting image quality is directly determined by the choice of colours in the palette. The use of generic optimisation techniques such as simulated annealing and soft computing-based clustering algorithms founded on fuzzy and rough set ideas to formulate colour quantisation algorithms is discussed. These methods are capable of deriving good colour palettes and are shown to outperform standard colour quantisation techniques in terms of image quality. Furthermore, a hybrid colour quantisation algorithm which combines a generic optimisation approach with a common clustering algorithm is shown to lead to improved image quality. Finally, it is demonstrated how optimisation-based colour quantisation can be employed in conjunction with a more appropriate measure for image quality.
Colour quantisation is a common image processing technique that allows the representation of true colour images using only a small number of colours. True colour images typically use 24 bits per pixel resulting overall in 224, i.e. more than 16 million, different colours. Colour quantisation uses a colour palette that contains only a small number of distinct colours (usually between 8 and 256), and pixel data are then stored as indices to this palette. Since each pixel in the image now takes on one of the colours of the palette, the choice of the colours that make up the palette is of crucial importance for the quality of the quantised image.
where R(i,j), G(i,j), and B(i,j) are the red, green, and blue pixel values at location (i,j), and n and m are the dimensions of images.
However, the selection of the optimal colour palette is known to be an NP-complete problem . In the image processing literature, many different algorithms have been introduced that aim to find a palette that allows for good image quality of the quantised image. A relatively simple approach is the popularity algorithm , which - typically following a uniform quantisation to 5 bits per channel - selects the N colours that are represented most often to form the colour palette. In median cut quantisation , an iterative procedure repeatedly splits (by a plane through the median point) colour cells into sub-cells. In octree quantisation , the colour space is represented as an octree where sub-branches are successively merged to form the palette, while Neuquant  employs a one-dimensional self-organising Kohonen neural network to generate the colour map.
In this paper, we present several soft computing approaches to colour quantisation. In particular, in Section 2.1, we show how general purpose optimisation algorithms such as simulated annealing can be used to derive a good colour palette. Colour quantisation can also be regarded as a clustering problem. Consequently, in Section 2.2, several soft computing-based clustering algorithms, namely fuzzy based clustering, rough set based clustering and a combined fuzzy-rough clustering approach, and their application to the colour quantisation problem, are discussed. In Section 2.3, we present experimental results that confirm that these soft computing-based methods do indeed make effective approaches for colour quantisation, outperforming several standard algorithms. A hybrid optimisation scheme for colour quantisation is described in Section 2.4 and shown to lead to improved performance. In Section 2.5, we show that by adapting the objective function, optimisation-based colour quantisation can be formulated, employing a more appropriate image quality metric. Finally, Section 3 concludes the paper.
2.1 Soft computing-based optimisation for colour quantisation
The main advantage of black-box optimisation algorithms is that they do not require any domain-specific knowledge yet are able to provide a near-optimal solution. This makes them suitable for a variety of problems, and in the following, we show how they can be employed to lead to an effective colour quantisation algorithm.
While there are many different optimisation algorithms (e.g. in , genetic algorithms were used for colour quantisation, while in , particle swarm optimisation  was utilised), the approach in  employs a modification of the well-known simulated annealing algorithm. Simulated annealing (SA) was first introduced as a general optimisation method by Kirkpatrick et al. , and it simulates the annealing of metal, in which the metal is heated up to a temperature near its melting point and then slowly cooled down. This allows the particles to move towards a minimum energy state, with a more uniform crystalline structure. The process therefore permits some control over the microstructure.
Simulated annealing is a variation of the hill-climbing algorithm. Both start from a randomly selected point within the search space of all possible solutions. Each point in search space has a measurable error value, E, associated with it, which indicates the quality of the solution. From the current point in search space, new trial solutions are selected for testing from the neighborhood of the current solution. This is usually done by moving a small step in a random direction. Typically, small and equally distributed random numbers from the interval [ −smax,smax] are added to each component of the current solution vector, where smax is called the maximum step width and is chosen from the interval between 0 and the upper limit of the search space dimension.
where T is referred to as ‘temperature’, an abstract control parameter for the cooling schedule. For a given temperature and positive values of Δ E, the probability function shown in Equation 2 has a defined upper limit of 1 and tends towards 0 for large positive values of Δ E.
where T n is the temperature at step n and α is a cooling coefficient (usually between 0.8 and 0.99).
During each step, the temperature must be held constant for an appropriate number of iterations in order to allow the algorithm to settle into a ‘thermal equilibrium’, i.e. a balanced state. If the number of iterations is too small, the algorithm is likely to converge to a local minimum.
For both continuous parameter optimisation and discrete parameters with large search ranges, it is practically impossible to choose direct neighbours of the current solution as new candidate solutions due to the vast number of points in the search space. Therefore, it is necessary to choose new candidates at some distance in a random direction of the current solution in order to navigate through the search space in an acceptable time. This distance could either be a fixed step width s or it could have an upper limit, smax. The maximum step width smax is crucial to the success of SA. If smax is too small and the start point for a search run is too far away from the global optimum, the algorithm might not be able to get near that optimum. If, on the other hand, the step width is too large and the peak of the optimum very narrow, the algorithm might never reach the top because most of the steps are too large.
where smax(n) is the maximum step width at iteration n, s0 is the initial maximum step width, nmax the maximum number of iterations, and β is an adaptation constant.
where l i is the number of pixels I j represented by colour C i of the palette, ||.|| is the Euclidean distance in RGB (red-green-blue) space, and δ is a constant (set to δ=10 in ). The objective function E(C,I) used is hence a combination of the mean Euclidean distance, i.e. the error measure of Equation 1, and a penalty function. The purpose of the penalty function p(C,I) is to avoid unused palette colours by adding a constant penalty value to the error for each entry in the codebook that is not used in the resulting picture.
2.2 Soft computing-based clustering for colour quantisation
Colour quantisation can also be seen as a clustering problem where the task is to identify those clusters that best represent the colours in an image. Consequently, soft computing-based clustering algorithms can be readily adapted to derive a good colour palette. In the following, we discuss how fuzzy c-means, rough c-means, and a combined fuzzy-rough clustering algorithm can be employed for colour quantisation.
2.2.1 Fuzzy c-means
where is the fuzzy membership of pixel x i and the colour cluster identified by its centre c j , and k is a constant that defines the fuzziness of the resulting partitions.
Fuzzy c-means operates iteratively though the following steps :
Step 1. Initialise the cluster centres c i and let t=0.
Step 2. Initialise the fuzzy partition memberships functions μ ij according to Equation 8.
Step 3. Let t=t+1 and compute new cluster centres c i using Equation 9.
Step 4. Repeat steps 2 to 3 until convergence.
An initial setting for each cluster centre is required, and FCM is guaranteed to converge to a local minimisation solution. The efficiency of FCM has been comprehensively investigated in . To address the inefficiency of the original FCM algorithm, several variants of the fuzzy c-means algorithm have been introduced which are discussed in the following.
2.2.2 Fuzzy c-means variants
While FCM often provides good clustering results, it also suffers from a relatively high computational complexity, especially when there are many samples as is the case for colour quantisation. However, a number of faster FCM variants have been developed and have also been shown to work well for colour quantisation .
To combat the computational complexity of FCM, Cheng et al.  proposed a multistage random sampling strategy. This method has a lower number of feature vectors and also needs fewer iterations to converge. The basic idea is to randomly sample and obtain a small subset of the dataset in order to approximate the cluster centres of the full dataset. This approximation is then used to reduce the number of iterations. Random sampling FCM (RSFCM) consists of two phases. First, a multistage iterative process of a modified FCM is performed. In the second phase, standard FCM is performed with the cluster centres approximated by the final cluster centres from the first phase. It has been shown that RSFCM is able to reduce the computational complexity compared to the classical FCM method.
Ahmed et al.  introduced an alternative to classical FCM by adding a term that enables the labelling of a pixel to be associated with its neighbourhood. As a regulator, the neighbourhood term can change the solution towards piecewise homogeneous labelling. As a further extension, in , the enhanced FCM (EnFCM) algorithm was presented. In order to reduce the computational complexity, a linearity-weighted sum image is formed from the original image, and a modified objective function is employed. EnFCM considers a number of pixels with similar colours as a weight. Thus, this approach can accelerate the convergence of searching for global similarity.
Anisotropic mean shift-based FCM (AMSFCM) is an efficient approach to fuzzy c-means clustering which utilises an anisotropic mean shift algorithm coupled with fuzzy clustering . Mean shift-based techniques have been shown to be capable of estimating the local density gradients of similar pixels. These gradient estimates are iteratively performed so that all pixels can find similar pixels in the same image . AMSFCM combines fuzzy c-means and anisotropic mean shift, a mean shift variant that does not suffer of shortcomings due to radially symmetric kernels . Importantly, the AMSFCM algorithm continuously inherits and updates the states, based on the mutual correction of FCM and mean shift.
2.2.3 Rough c-means
Lingras and West  introduced a rough set-inspired clustering algorithm based on the well-known c-means algorithm. In this rough c-means (RCM) approach, each cluster c k is described not only by its centre m k , but also contains additional information, in particular its lower approximation , its upper approximation , and its boundary area . The clustering algorithm proceeds in the following steps:
Step 1. Each data sample is randomly assigned to one lower approximation. Since the lower approximation of a cluster is a subset of its upper approximation, this also automatically assigns the sample to the upper approximation of the same cluster.
The cluster centres are hence determined as a weighted average of the samples belonging to the lower approximation and the boundary area, where the weights ω l and ω b define the relative importance of the two sets.
Step 3. For each data sample, the closest cluster centre is determined and the sample is assigned to its upper approximation. Then, all clusters that are at most ε further away than the closest cluster are determined. If such clusters exist, the sample will also be assigned to their upper approximations. If no such cluster exists, the sample is assigned also to the lower approximation of the closest cluster.
Step 4. If the algorithm has converged (i.e. if the cluster centres do not change any more, or after a pre-set number of iterations), terminate; otherwise, go to step 2.
Strictly speaking, this algorithm does not implement all properties set out for rough sets  and hence belongs to the reduced interpretation of rough sets as lower and upper approximations of data .
with ω l +ω u =1, i.e. as a convex combination of lower and upper approximation means. In order to overcome the possibility of situations with empty lower approximations, the calculation of cluster centres can be modified so that for empty lower approximations, the cluster centre is calculated as the average of samples in the upper approximation or by ensuring that each lower approximation has at least one member.
In , an RCM-based colour quantisation is introduced which follows the clustering approach from  and , assigning the data sample closest to the cluster centre to its lower approximation, though with a different initialisation approach where rather than randomly assigning samples to clusters, random cluster centres are generated first and then the algorithm proceeds with steps 3, 2, and 4 (i.e., steps 2 and 3 reversed) in order to derive a colour palette.
2.2.4 Fuzzy-rough c-means
Calculation of cluster centres m j remains as given in Equation 9, while lower and upper approximations are defined as detailed in Section 2.2.3 for rough c-means. The difference between fuzzy c-means and fuzzy-rough c-means is hence that the membership values in the lower approximation are 1 (i.e. crisp), while those in the boundary region are fuzzy memberships. In other words, fuzzy-rough c-means first partitions the data into two classes: lower approximation and boundary area, and only those points in the boundary region are fuzzified. This in turn leads to faster convergence when compared to FCM . In contrast to rough c-means, samples in the boundary region are not all treated equally but are rather assigned membership values depending on their distance to the cluster centroids. In addition, there is no need to specify weights for the calculation for cluster centroids.
2.3 Colour quantisation performance
In order to evaluate the various colour quantisation algorithms, we performed a set of experiments on a set of six test images. These images, Lenna, Peppers, Mandrill, Sailboat, Airplane, and Pool, are commonly used in the colour quantisation literature and hence present a good test bed for evaluation purposes. We applied all seven discussed algorithms, that is SWASA, FCM, RSFCM, EnFCM, AMSFCM, RCM, and FRCM, to all images to generate quantised images with a palette of 16 colours.
For the simulated annealing algorithm, a population-based version of the SWASA algorithm with a population size of 10 was employed. The start temperature T0 was chosen to be 20, and the cooling coefficient α was set to 0.9. The parameters s0 and β were set to 100 and 5.3, respectively. The temperature was kept constant for over 20 iterations, and the maximum number of iterations was set to 10,000. For the rough c-means approach, we adopted the parameters ω l =0.7, ω u =0.3, and τ=0.001 (image pixel values are normalised to [0;3]3). For the fuzzy c-means and fuzzy rough c-means algorithms, the fuzziness exponent α was set to 1.2.
To put the results we obtained into context, we also implemented four popular colour quantisation algorithms (which are often integrated in typical image processing software) to generate corresponding quantised images with palette size 16. The algorithms we tested were as follows:
Popularity algorithm: Following a uniform quantisation to 5 bits per channel, the N colours that are represented most often form the colour palette.
Median cut quantisation: An iterative algorithm that repeatedly splits (by a plane through the median point) colour cells into sub-cells.
Octree quantisation: The colour space is represented as an octree where sub-branches are successively merged to form the palette.
Neuquant: A one-dimensional self-organising Kohonen neural network is applied to generate the colour map.
For all algorithms, pixels in the quantised images were assigned to their nearest neighbours in the colour palette to provide the best possible image quality.
Quantisation results, given in terms of PSNR (dB) with the best result for each image in boldface
Popularity algorithm 
Median cut 
with MSE(O,Q) calculated as in Equation 1. A higher PSNR hence indicates better image quality.
As can be seen from Table 1, all the soft computing algorithms provide very good results and clearly outperform standard colour quantisation algorithms. The results of the different fuzzy clustering approaches are fairly similar which suggests that the computationally more efficient versions (RSFCM, EnFCM, AMSFCM) can be employed without sacrificing image quality. Also, the rough set approach gives similar performance and the presented rough colour quantisation approach hence adds to the applications of rough sets in the field of imaging and vision. The best performance is achieved by the combined fuzzy-rough c-means approach, which gives the best image quality for four of the six images and overall provides a PSNR improvement of more than 0.5 compared to the next ranked algorithm.
2.4 Hybrid optimisation-based colour quantisation
As can be seen in Figure 3, there is always a variation in error values within the population which indicates that although simulated annealing is able to find good solutions (as was confirmed in Section 2.3), i.e. solutions from within the region around the global optimum, it rarely exploits that region completely. Therefore, in , SWASA was combined with a standard c-means clustering algorithm  to provide a stacked hybrid optimisation method. C-means clustering is guaranteed to converge towards the local clustering minimum by iteratively carrying out the following two steps:
Each input vector is mapped to its closest codeword by a nearest neighbour search.
The input vectors assigned in each class (i.e. for each codeword) are represented by the centroid of the vectors in that class.
In this hybridised algorithm, the SA component is hence responsible for identifying the region in the search space that will contain the global optimum while the c-means component will then descend into the minimum present in that region.
2.5 Image quality metric-based colour quantisation
Although many colour quantisation algorithms have been proposed, virtually all of them define the goal of quantisation as that of finding a palette that minimises the MSE, given in Equation 1, of the resulting image. It is however well known that metrics such as MSE and PSNR do not correspond very well to how the human visual system operates and how humans judge differences between images. An image with a higher MSE does not necessarily have perceptually lower image quality; similarly, two images that are perceived with equal quality are likely to have different values in terms of MSE or PSNR.
Furthermore, RGB, the device space, is poorly related to the human visual system. Colour differences calculated as Euclidean distances between RGB co-ordinates do not correspond well to how humans perceive colour differences. Much research has been done on deriving colour spaces such as CIELAB and CIELUV that are designed to be perceptually uniform, i.e. where Euclidean distances correspond to perceived distances in all regions of the colour space . Uniform colour spaces have been used in colour quantisation algorithms and have been shown to perform better compared to algorithms based on the RGB space .
However, the application of a perceptual uniform colour space alone does not guarantee improved image quality. Uniform colour spaces were developed for and hence only accurately model the colour differences between large patches of uniformly coloured samples. Real images on the other hand seldomly comprise such large areas. Therefore, it is crucial to also take into account the spatial characteristics of images when developing an appropriate image quality metric .
S-CIELAB (for spatial CIELAB ) first converts the RGB image into an opponent colour space. The individual channels are then convolved with a kernel whose shape is estimated from the visual spatial sensitivity to that channel. This convolution simulates the blurring that occurs in the human visual system. Both the opponent colour space and the convolution kernels were derived following a series of experiments on the pattern-colour separability of the visual system . After the filtering, the image is converted to XYZ and then to CIELAB to provide spatial CIELAB co-ordinates. The difference between two images can then be expressed as the average colour difference, expressed in terms of Δ E units, between the two S-CIELAB representation, where the colour difference is usually calculated as the Euclidean distance between two colours.
In contrast to colour spaces such as CIELAB, for which colour quantisation can be easily adapted  by converting the RGB image to the new colour space and then applying the quantisation algorithm, this is not possible for S-CIELAB. The reason is that S-CIELAB does not simply provide a new colour space but takes into account the spatial interaction between neighbouring pixels. It is therefore image dependent, and identical S-CIELAB co-ordinates in two different images can originate from fairly different original RGB values. In the context of colour quantisation, this means that converting an image to S-CIELAB and performing the quantisation there will not lead to an optimal palette. Rather, the palette has to be found in the palette search space, and then the image quality is calculated based on the quantised image. This is possible using optimisation techniques such as the SWASA algorithm explained in Section 2.1 to develop an image metric-based colour quantisation algorithm . The objective function to be minimised here is defined as the average Δ E between the original image O and the image quantised using the colour palette.
Quantisation results, given in terms of Δ E S−CIELAB
Popularity algorithm 
Median cut 
In this paper, we have given an overview of recent soft computing-based colour quantisation approaches and have shown that this family of algorithms work very well, resulting in quantised images with high image quality. In particular, we have discussed the use of optimisation algorithms such as simulated annealing and of soft computing-based clustering algorithms including fuzzy c-means, rough c-means, and combined fuzzy-rough c-means approaches in this context. All techniques were compared against standard colour quantisation methods and were shown to clearly outperform them. A hybrid colour quantisation algorithm, combining simulated annealing with a c-means clustering algorithm, was shown to lead to improved performance, while by modifying the objective function, optimisation-based colour quantisation algorithms can be tuned with respect to a particular image quality metric. Although the compiled results convincingly demonstrate that soft computing-based methods are well suited for the colour quantisation problem, it should also be noted that they typically have higher demands in terms of computational complexity and might hence be suitable only for situations where the quantisation stage is not time critical.
- Wu X: Color quantization by dynamic programming and principal analysis. ACM Trans. Graph 1992, 11(4):348-372. 10.1145/146443.146475MATHView ArticleGoogle Scholar
- Heckbert P. S: Color image quantization for frame buffer display. ACM Comput. Graph. (ACM SIGGRAPH ’82 Proc.) 1982, 16(3):297-307. 10.1145/965145.801294View ArticleGoogle Scholar
- Gervautz M, Purgathofer W: A simple method for color quantization: octree quantization. In Graphics Gems. Edited by: Glassner A. S.. San Diego: ACM; 1990:287-293.View ArticleGoogle Scholar
- Dekker A. H: Kohonen neural networks for optimal colour quantization. Network: Comput. Neural Syst 1994, 5: 351-367. 10.1088/0954-898X/5/3/003MATHView ArticleGoogle Scholar
- Scheunders P: A genetic c-means clustering algorithm applied to color image quantization. Pattern Recognit 1997, 30(6):859-866. 10.1016/S0031-3203(96)00131-8View ArticleGoogle Scholar
- Omran M, Engelbrecht A, Salman A: A color image quantization algorithm based on particle swarm optimization. Informatica 2005, 29: 263-271.MATHGoogle Scholar
- Kennedy J, Eberhart R: Particle swarm optimization. IEEE Int. Conference on Neural Networks 1995, 4: 1942-1948.Google Scholar
- Schaefer G, Nolle L: An optimisation approach to colour palette generation. Int. J. Pattern Recognit. Mach. Intell 2006, 1(1):40-46.Google Scholar
- Kirkpatrick S, Gelatt CD, Vecchi MP: Optimization by simulated annealing. Science 1983, 220(4598):671-680. 10.1126/science.220.4598.671MATHMathSciNetView ArticleGoogle Scholar
- Nolle L: On the effect of step width selection schemes on the performance of stochastic local search strategies. In 18th European Simulation Multi-Conference, ESM 2004, Magdeburg. Erlangen: Gruner, Druck; 2004:149-153.Google Scholar
- Chuang K, Tzeng S, Chen H, Wu J, Chen T: Fuzzy c-means clustering with spatial information for image segmentation. Comput. Med. Imaging Graph 2006, 30: 9-15. 10.1016/j.compmedimag.2005.10.001View ArticleGoogle Scholar
- Bezdek J: A convergence theorem for the fuzzy isodata clustering algorithms. IEEE Trans. Pattern Anal. Mach. Intell 1980, 2: 1-8.MATHView ArticleGoogle Scholar
- Hu R, Hathaway L: On efficiency of optimization in fuzzy c-means. Neural, Parallel Sci. Comput 2002, 10: 141-156.MATHMathSciNetGoogle Scholar
- Schaefer G, Zhou H: Fuzzy clustering for colour reduction in images. Telecommun. Syst 2009, 40(1–2):17-25. doi:10.1007/s11235-008-9143-8View ArticleGoogle Scholar
- Cheng T, Goldgof D, Hall L: Fast fuzzy clustering. Fuzzy Sets Syst 1998, 93: 49-56. 10.1016/S0165-0114(96)00232-1MATHView ArticleGoogle Scholar
- Ahmed M, Yamany S, Farag A, Moriaty T, Mohamed N: A modified fuzzy c-means algorithm for bias field estimation and segmentation of MRI data. IEEE Trans. Med. Imaging 2002, 21: 193-199. 10.1109/42.996338View ArticleGoogle Scholar
- Szilagyi L, Benyo Z, Szilagyii SM, Adam HS: MR brain image segmentation using an enhanced fuzzy c-means algorithm. In 25th IEEE International Conference on Engineering in Medicine and Biology. Piscataway: IEEE; 2003:724-726.Google Scholar
- Comaniciu D, Meer P: Mean shift: a robust approach toward feature space analysis. IEEE Trans. Pattern Anal. Mach. Intell 2002, 24: 603-619. 10.1109/34.1000236View ArticleGoogle Scholar
- Wang J, Thiesson B, Xu Y, Cohen M: Image and video segmentation by anisotropic kernel mean shift. In 8th European Conference on Computer Vision. Berlin: Springer; 2004:238-2492.Google Scholar
- Lingras P, West C: Interval set clustering of web users with rough k-means. J. Intell. Inform. Syst 2004, 23: 5-16.MATHView ArticleGoogle Scholar
- Pawlak Z: Rough sets. Int. J. Inform. Comput. Sci 1982, 11: 145-172.MathSciNetView ArticleMATHGoogle Scholar
- Yao YY, Li X, Lin TY, Liu Q: Representation and classification of rough set models. In Soft Computing: Third International Workshop on Rough Sets and Soft Computing : (RSSC94). Edited by: Lin TY, Martin Wildberger A. San Diego: Society for Computer Simulation International; 1994:630-637.Google Scholar
- Peters G: Some refinements of rough k-means clustering. Pattern Recognit 2006, 39: 1481-1491. 10.1016/j.patcog.2006.02.002MATHView ArticleGoogle Scholar
- Schaefer G, Zhou H, Celebi M, Hassanien A: Rough colour quantisation. Int. J. Hybrid Inform. Syst 2011, 8(1):25-30. doi10.3233/HIS-2011-0128Google Scholar
- Hu Q, Yu D: An improved clustering algorithm for information granulation. In Fuzzy Systems and Knowledge Discovery. Edited by: Wang L, Jin Y. Heidelberg: Springer; 2005:494-504.View ArticleGoogle Scholar
- Schaefer G, Hu G, Zhou H, Peters J, Hassanien A: Rough c-means and fuzzy rough c-means for colour quantisation. Fundam. Inform 2012, 119(1):113-120. doi10.3233/FI-2012-729MathSciNetGoogle Scholar
- Nolle L, Schaefer G: Color map design through optimization. Eng. Optimization 2007, 39(3):327-343. 10.1080/03052150601127958View ArticleGoogle Scholar
- Linde Y, Buzo A, Gray RM: An algorithm for vector quantizer design. IEEE Trans. Commun 1980, 28: 84-95. 10.1109/TCOM.1980.1094577View ArticleGoogle Scholar
- Hill B, Roger T, Vorhagen FW: Comparative-analysis of the quantization of color spaces on the basis of the CIELAB color-difference formula. ACM Trans. Graph 1997, 16(2):109-154. 10.1145/248210.248212View ArticleGoogle Scholar
- Gentile RS, Allebach JP, Walowit E: Quantization of color images based on uniform color spaces. J. Imaging Technol 1990, 16: 11-21.Google Scholar
- Eckert MP, Bradley AP: Perceptual quality metrics applied to still image compression. Signal Process 1998, 70: 177-200. 10.1016/S0165-1684(98)00124-8MATHView ArticleGoogle Scholar
- Zhang X, Wandell BA: A spatial extension of CIELAB for digital color image reproduction. Journal of the Society for Information Display 1997, 5(1):61-63. 10.1889/1.1985127View ArticleGoogle Scholar
- Poirson AB, Wandell BA: Pattern-colour separable pathways predict sensitivity to simple coloured patterns. Vis. Res 1996, 36(4):515-526. 10.1016/0042-6989(96)89251-0View ArticleGoogle Scholar
- Schaefer G, Nolle L: Quality metric based colour palette optimisation. In 2006 IEEE International Conference on Image Processing. Piscataway: IEEE; 2006:1793-1796.View ArticleGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.