Journal Article

Variable neighbourhood search for colour image quantization

Pierre Hansen, Jasmina Lazić and Nenad Mladenović

in IMA Journal of Management Mathematics

Published on behalf of Institute of Mathematics and its Applications

Volume 18, issue 2, pages 207-221
Published in print April 2007 | ISSN: 1471-678X
Published online April 2007 | e-ISSN: 1471-6798 | DOI: https://dx.doi.org/10.1093/imaman/dpm008
Variable neighbourhood search for colour image quantization

Show Summary Details

Preview

Colour image quantization is a data compression technique that reduces the total set of colours in a digital image to a representative subset. This problem is first expressed as a large M-median one. The advantages of this model over the usual minimum sum-of-squares model are discussed first and then, the heuristic based on variable neighbourhood search metaheuristic is applied to solve it. Computational experience proves that this approach compares favourably with two other recent state-of-the-art heuristics, based on genetic and particle swarm searches.

Keywords: colour image quantization; variable neighbourhood decomposition search; sum-of-squares; clustering problem; M-median problem

Journal Article.  0 words. 

Subjects: Mathematics

Full text: subscription required

How to subscribe Recommend to my Librarian

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content. subscribe or login to access all content.