Single bitmap block truncation coding of color images using hill climbing algorithm  

作　　者：Zhang Lige Qin Xiaolin Li Qing Peng Haoyue Hou Yu 张力戈;Qin Xiaolin;Li Qing;Peng Haoyue;Hou Yu(hengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu 610041,P.R.China;School of Computer and Control Engineering,University of Chinese Academy of Sciences,Beijing 100049,P.R.China)

机构地区：[1]hengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu 610041,P.R.China [2]School of Computer and Control Engineering,University of Chinese Academy of Sciences,Beijing 100049,P.R.China

出　　处：《High Technology Letters》2019年第4期355-363,共9页高技术通讯（英文版）

基　　金：Supported by the National Natural Science Foundation of China(No.61402537);the Open Fund of Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis(No.HCIC201706);the Sichuan Science and Technology Programme(No.2018GZDZX0041)

摘　　要：In order to generate an efficient common bitmap in single bitmap block truncation coding(SBBTC)of color images,an improved SBBTC scheme based on weighted plane(W-plane)method and hill climbing algorithm is proposed.Firstly,the incoming color image is partitioned into non-overlapping blocks and each block is encoded using the W-plane method to get an initial common bitmap and quantization values.Then,the hill climbing algorithm is applied to optimize an initial common bitmap and generate a near-optimized common bitmap.Finally,the quantization values are recalculated by the near-optimized common bitmap and the considered color image is reconstructed block by block through the common bitmap and the new quantization values.Since the processing of each image block in SBBTC is independent and identical,parallel computing is applied to reduce the time consumption of this scheme.The simulation results show that the proposed scheme has better visual quality and time consumption than those of the reference SBBTC schemes.In order to generate an efficient common bitmap in single bitmap block truncation coding(SBBTC) of color images, an improved SBBTC scheme based on weighted plane(W-plane) method and hill climbing algorithm is proposed. Firstly, the incoming color image is partitioned into non-overlapping blocks and each block is encoded using the W-plane method to get an initial common bitmap and quantization values. Then, the hill climbing algorithm is applied to optimize an initial common bitmap and generate a near-optimized common bitmap. Finally, the quantization values are recalculated by the near-optimized common bitmap and the considered color image is reconstructed block by block through the common bitmap and the new quantization values. Since the processing of each image block in SBBTC is independent and identical, parallel computing is applied to reduce the time consumption of this scheme. The simulation results show that the proposed scheme has better visual quality and time consumption than those of the reference SBBTC schemes.

关 键 词：block truncation coding(BTC) common bitmap parallel computing hill climbing algorithm 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]