In this paper a new sign coding approximation method for the wavelet coefficients in a 2D image codec based on a simulated annealing metaheuristic is presented. The efficiency of the proposed algorithm versus a genetic algorithm using benchmarks of Kodak is compared and showing that the proposed sign prediction algorithm is efficient and provides a significant reduction of wavelet coefficients sign information in the final bit-stream. The results show that, by including sign coding capabilities to a nonembedded encoder, the sign compression gain is up to 17.35%, being the rate-distortion (R/D) performance improvement up to 0.25 dB.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Simulated Annealing Algorithm for 2D Image Compression




    Publication date :

    2012-11-01


    Size :

    355404 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Iteration-Free Fractal Coding for Image Compression Using Simulated Annealing

    Kamal, A. R. N. B. / Selvi, S. T. / Visual Information Engineering Network (Institution of Engineering and Technology) | British Library Conference Proceedings | 2006


    Iterative sIB Algorithm based on Simulated Annealing

    Yuan, H. / Ye, Y. / Deng, J. | British Library Online Contents | 2010


    Simulated Annealing Algorithm for Berth Allocation Problems

    Line, Shih-Wei / Ting, Ching-Jung | Springer Verlag | 2013


    A Simulated-Annealing-Based Multi-Objective Memetic Algorithm

    Guo, X.-p. / Yang, G.-k. / Wu, Z.-m. | British Library Online Contents | 2007


    Hybrid Simulated Annealing Algorithm for School Timetabling Problem

    Zengzhi, L. / Yunlan, W. / Jing, C. | British Library Online Contents | 2003