ویراساینس.
سند علمی

Terrain-Based Memetic Algorithms for Vector Quantizer Design

Carlos R. B. Azevedo, Flávia E. A. G. Azevedo, Waslon Terllizzie A. Lopes, Francisco Madeiro

چکیده

Recently, a Genetic Accelerated K-Means Algorithm (GAKM) was proposed as an approach for optimizing Vector Quantization (VQ) codebooks, relying on an accelerated version of K-Means algorithm as a new local learning module. This approach requires the determination of a scale factor parameter (η), which affects the local search performed by GAKM. The problem of auto-adapting the local search in GAKM, by adjusting the η parameter, is addressed in this work by the proposal of a Terrain-Based Memetic Algorithm (TBMA), derived from existing spatially distributed evolutionary models. Simulation results regarding image VQ show that this new approach is able to adjust the scale factor (η) for different images at distinct coding rates, leading to better Peak Signal-to-Noise Ratio values for the reconstructed images when compared to both K-Means and Cellular Genetic Algorithm + K-Means. The TBMA also demonstrates capability of tuning the mutation rate throughout the genetic search.

اسناد مشابه

  • VLSI Architecture for Fast Memetic Vector Quantizer Design on Reconfigurable Hardware

    سند علمی۲۰۰۹ICA3PPSheng-Kai Weng, Chien-Min Ou, Wen-Jyi Hwang

    A novel hardware architecture for memetic vector quantizer (VQ) design is presented in this paper. The architecture uses steady-state genetic algorithm (GA) for global search, and C-means algorithm for local refinement. It adopts a shift register based circuit for accelerating mu

  • Vector Quantizer Design Using Genetic Algorithms

    سند علمی۱۹۹۶Data Compression ConferenceSunghyun Choi, Wee Keong Ng

    The design of vector quantizers (VQs) that yield minimal distortion is one of the most challenging problems in source coding. The problem of VQ design is to find a codebook that gives the least overall distortion (or equivalently, the largest signal-to-noise ratio (SNR)) for a gi

  • A clustering algorithm for entropy-constrained vector quantizer design with applications in coding image pyramids

    سند علمی۱۹۹۵IEEE Trans. Circuits Syst. Video Techn.Diego P. de Garrido, William A. Pearlman, Weiler Alves Finamore

    {A clustering algorithm for the design of eecient vector quantizers to be followed by entropy coding is proposed. The algorithm, called entropy-constrained pair-wise nearest neighbor (ECPNN), designs codebooks by merging the pair of Voronoi regions which gives the least increase

  • Efficient VLSI Architecture for Memetic Vector Quantizer Design

    سند علمی۲۰۱۲Chien-Min Ou, Wen-Jyi Hwang

    Memetic algorithms (MA) (Eiben & Smith, 2003; Molina, Lozano & Herrera, 2010; Moscato, 1999; Santos & Alves, 2010) have been found to be effective for evolutionary computation (Areibi, Moussa & Abdullah, 2001; Merz & Freisleben, 1999). It can be viewed as the hybrid genetic algor

  • An algorithm for uniform vector quantizer design

    سند علمی۱۹۸۴IEEE Trans. Information TheoryKhalid Sayood, Jerry D. Gibson, Martin C. Rost

    A vector quantizer maps a k-dimensional vector into one of a finite set of output vectors or “points”. Although certain lattices have been shown to have desirable properties for vector quantization applications, there are as yet no algorithms available in the quantization literat

  • Comments on “ Modified - Means Algorithm for Vector Quantizer Design ”

    سند علمی۲۰۰۰Kuldip K. Paliwal, V. Ramasubramanian

    Recently a modified -means algorithm for vector quantization design has been proposed where the codevector updating step is as follows: new codevector = current codevector + scale factor (new centroid current codevector). This algorithm uses a fixed value for the scale factor. In