Generic black box optimisation algorithms for colour quantisation

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

Abstract

We apply a variant of Simulated Annealing (SA) as a standard black-box optimisation algorithm to the colour quantisation problem. 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. We evaluate the effectiveness of our approach by comparing its performance with several specialized colour quantisation algorithms. The results obtained show that even without any domain specific knowledge our SA based algorithm is able to outperform standard quantisation algorithms and hence to provide images with superior image quality.

Cite

CITATION STYLE

APA

Schaefer, G., & Nolle, L. (2006). Generic black box optimisation algorithms for colour quantisation. In Advances in Soft Computing (Vol. 36, pp. 15–21). https://doi.org/10.1007/978-3-540-36266-1_2

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