首页 | 本学科首页   官方微博 | 高级检索  
     


Variable neighbourhood search for colour image quantization
Authors:Hansen, Pierre   Lazic, Jasmina   Mladenovic, Nenad
Affiliation:1 GERAD and École des Hautes Études Commerciales, 3000 ch. de la Cote-Sainte-Catherine, Montréal, Canada H3T 2A7, 2 Mathematical Institute, Serbian Academy of Sciences and Arts, Kneza Mihaila 35, 11001 Belgrade, Serbia, 3 School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex UB8 3PH, UK
Abstract:
** Email: nenad.mladenovic{at}brunel.ac.uk Colour image quantization is a data compression technique thatreduces the total set of colours in a digital image to a representativesubset. This problem is first expressed as a large M-medianone. The advantages of this model over the usual minimum sum-of-squaresmodel are discussed first and then, the heuristic based on variableneighbourhood search metaheuristic is applied to solve it. Computationalexperience proves that this approach compares favourably withtwo other recent state-of-the-art heuristics, based on geneticand particle swarm searches.
Keywords:colour image quantization   variable neighbourhood decomposition search   sum-of-squares   clustering problem   M-median problem
本文献已被 Oxford 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号