Recent years have witnessed increasing interest in using metaheuristics to solve the codebook generation problem (CGP) of vector quantization as well as increasing interest in reducing the computation time of metaheuristics. One of the recently proposed methods aimed at reducing the computation time of metaheuristics is based on the notion of pattern reduction (PR). The problem with PR is in that it may compress and remove patterns that are not supposed to be compressed and removed, thus decreasing the quality of the solution. In this thesis, we proposed a fuzzy version of PR called fuzzy pattern reduction (FPR) to reduce the possibility of compressing and removing patterns that are not supposed to be compressed and removed. To evaluate the performance of the proposed algorithm, we apply it to the following four metaheuristics: generalized Lloyd algorithm, code displacement, genetic k-means algorithm, and particle swarm optimization and use them to solve the CGP. Our experimental results show that the proposed algorithm can not only significantly reduce the computation time but also improve the quality of all the metaheuristics evaluated.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0217111-182333 |
| Date | 17 February 2011 |
| Creators | Lin, Chung-fu |
| Contributors | Chung-nan Lee, Ming-Chao Chiang, Chun-Wei Tsai, Shiann-Rong Kuang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0217111-182333 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0021 seconds