This paper presents a modified block truncation coding (ETC) algorithm for image compression. Similar blocks in an image are merged into a cluster and represented with the cluster center. Each cluster center is then e...
详细信息
This paper presents a modified block truncation coding (ETC) algorithm for image compression. Similar blocks in an image are merged into a cluster and represented with the cluster center. Each cluster center is then encoded with a vision block truncation coding (VBTC) algorithm which uses a small set of predefined binary edge patterns to approximate the bit plane of the cluster center. Experimental results show that the computation efficiency of the proposed algorithm is significantly improved when compared to the original BTC. (C) 1998 Elsevier Science B.V. All rights reserved.
This paper presents an image coding method for overdriving of a 10bit Full HD LCD display considering the chip size of TCON (Timing Controller) and real-time operation. The proposed method is an adaptive scheme of AM-...
详细信息
This paper presents an image coding method for overdriving of a 10bit Full HD LCD display considering the chip size of TCON (Timing Controller) and real-time operation. The proposed method is an adaptive scheme of AM-BTC (Absolute Moment block truncation coding). It splits a sample block into two sub-blocks considering the color level distribution of the sample block and applies AM-BTC to each sub-block. Experimental results show that the proposed method is superior to the conventional method in both objective and subjective visual quality.(1).
block truncation coding uses a two-level moment preserving quantizer that adapts to local properties of the images. It has the features of low computation load and low memory requirement while its bit rate is only 2.0...
详细信息
block truncation coding uses a two-level moment preserving quantizer that adapts to local properties of the images. It has the features of low computation load and low memory requirement while its bit rate is only 2.0 bits per pixel. A more efficient algorithm, the absolute moment ETC (AMBTC) has been extensively used in the field of signal compression because of its simple;computation and better MSE performance. We propose postprocessing methods to further reduce the entropy of two output data of AMBTC, including the bit map and two quantization data (a, b). A block of a 2x4 bit map is packaged into a byte-oriented symbol. The entropy can be reduced from 0.965 bpp to 0.917 bpp on average for our test images. The two subimages of quantization data (a, b) are postprocessed by the Peano Scan. This postprocess can further reduce differential entropy about 0.4 bit for a 4x4 block. By applying arithmetic coding, the total bit reduction is about 0.3 similar to 0.4 bpp. The bit rate can reach 1.6 similar to 1.7 bpp with the same quality as traditional AMBTC.
block truncation coding (ETC) is an efficient tool for image compression, To compress color-pixel blocks, a novel color ETC algorithm, called quaternion-moment block truncation coding (QMBTC), is presented in this pap...
详细信息
block truncation coding (ETC) is an efficient tool for image compression, To compress color-pixel blocks, a novel color ETC algorithm, called quaternion-moment block truncation coding (QMBTC), is presented in this paper, Analytical formulas for QMBTC, whose computation time is on the order of pixel block size, are derived by using quaternion arithmetic and the moment-preserving principle, The proposed color ETC algorithm can adaptively truncate a pixel block into one or two output classes according to the distribution of color values inside the blocks, The experimental results show that the compression ratio is increased as compared with existing color ETC algorithms, and the picture quality of reconstructed images is satisfactory, In addition, a post-ETC data compression scheme is proposed to further compress the subimage constructed by reproduction colors of truncated pixel blocks, Using a lookup table to display decoded data, this postprocessing scheme can output images acceptable to human eyes.
Reversible data hiding has been a hot research topic because it can recover both the host media and hidden data without distortion. Because most digital images are stored and transmitted in compressed forms, such as J...
详细信息
Reversible data hiding has been a hot research topic because it can recover both the host media and hidden data without distortion. Because most digital images are stored and transmitted in compressed forms, such as JPEG, vector quantization, and block truncation coding (BTC), the reversible data hiding schemes in compressed domains have been paid more and more attention. Compared with transform coding, BTC has a significantly low complexity and less memory requirement, it therefore becomes an ideal data hiding domain. Traditional data hiding schemes in the BTC domain modify the BTC encoding stage or BTC-compressed data according to the secret bits, and they have a relatively low efficiency and meanwhile may reduce the image quality. This paper presents a novel reversible data hiding scheme based on the joint neighbor coding technique for BTC-compressed images by further losslessly encoding the BTC-compressed data according to the secret bits. First, BTC is performed on the original image to obtain the BTC-compressed data that can be represented by a high mean table, a low mean table, and a bitplane sequence. Then, the secret data are losslessly embedded in both the high mean and low mean tables. Our hiding scheme is a lossless method based on the relation among the current value and the neighboring ones in mean tables. In addition, it can averagely embed 2 bits in each mean value, which increases the capacity and efficiency. Experimental results show that our scheme outperforms three existing BTC-based data hiding works, in terms of the bit rate, capacity, and efficiency.
In this paper, a novel color image hiding scheme that is capable of hiding two color secret images into a color host image is proposed. The secret images to be embedded are first compressed by the single bit map block...
详细信息
In this paper, a novel color image hiding scheme that is capable of hiding two color secret images into a color host image is proposed. The secret images to be embedded are first compressed by the single bit map block truncation coding. DES encryption is then conducted on the compressed message before the secret image is embedded into the rightmost 3, 2, 3 bits of the R, G, B channels of every pixel in the host image. The experimental results show that our scheme provides an average secret image quality of 29.220 dB. In addition to the improved quality of both host images and retrieved secret images, our scheme further strengthens the protection of the secret images by conducting image compression and DES encryption on the secret image in advance. Therefore, our scheme not only extends the hiding capability of host images, but also is practical and secure.
A new approach to improving block truncation coding for gray-scale image compression is proposed. A set of line and edge bit planes is defined independently of input images and adaptively selected to yield lower bit r...
详细信息
A new approach to improving block truncation coding for gray-scale image compression is proposed. A set of line and edge bit planes is defined independently of input images and adaptively selected to yield lower bit rates and better reconstructed image quality.
In this paper, we proposed multi-factors correlation (MFC) to describe the image, structure element correlation (SEC), gradient value correlation (GVC) and gradient direction correlation (GDC). At first, the RGB color...
详细信息
In this paper, we proposed multi-factors correlation (MFC) to describe the image, structure element correlation (SEC), gradient value correlation (GVC) and gradient direction correlation (GDC). At first, the RGB color space image is converted to a bitmap image and a mean color component image utilizing the block truncation coding (BTC). Then, three correlations will be used to extract the image feature. The structure elements can effectively represent the bitmap which is generated by BTC, and SEC can effectively denote the bitmap's structure and the correlation of the block in the bitmap. GVC and GDC can effectively denote the gradient relation, which is computed by a mean color component image. Formed by SEC, GVC and GDC, the image feature vectors can effectively represent the image. In the end, the results demonstrate that the method has better performance than other image retrieval methods in the experiment. (C) 2014 Elsevier Ltd. All rights reserved.
In this paper a new approach of edge-based quantization for the compression of gray scale images using an Adaptive block truncation coding technique (ABTC-EQ) is proposed, to improve the compression ratio (CR) with hi...
详细信息
In this paper a new approach of edge-based quantization for the compression of gray scale images using an Adaptive block truncation coding technique (ABTC-EQ) is proposed, to improve the compression ratio (CR) with high picture quality. Quantization is done based on the edge information contained in each block of pixels of the image. Conventional BTC method retains the visual quality of the reconstructed image but it shows some artifacts near the edges. In conventional BTC and variants, same quantization is done for all pixel values with different block sizes so that CR is static for images with a fixed block size. But in the case of proposed method since the quantization is done based on the edge information, CR become dynamic and consequently achieves better visual quality with better CR. The experimental analysis based on subjective and quantitative analysis proved that the proposed method outperforms other BTC variants. (C) 2015 Elsevier Ltd. All rights reserved.
For a high-quality real-time image compression at moderate bit-rates the equi-spaced 3-level block truncation coding algorithms is an attractive coding method. Unfortunately, the present-day equi-spaced 3-level algori...
详细信息
For a high-quality real-time image compression at moderate bit-rates the equi-spaced 3-level block truncation coding algorithms is an attractive coding method. Unfortunately, the present-day equi-spaced 3-level algorithms are not optimum (in the mean square error sense). In this paper we describe a new equi-spaced 3-level algorithm which is fast and has nearly optimum mean square error.
暂无评论