This paper proposes an effective lossless information hiding scheme, in which a host image is quantized firstly to generate spare spaces for hiding secret messages. The proposed scheme applies the complexity analysis ...
详细信息
ISBN:
(纸本)9780769531229
This paper proposes an effective lossless information hiding scheme, in which a host image is quantized firstly to generate spare spaces for hiding secret messages. The proposed scheme applies the complexity analysis of neighboring pixels to predict the number of secret message bits concealed in a pixel. In addition, it reserves the differences between the host image and the quantized image for completely restoring the host image. According to the experimental results, the information capacity of the proposed scheme is 0.9 bpp for the standard Lena while that of Maniccam and Bourbakis's scheme is 0.3 bpp.
To improve the JPEG2000 compression standard error resiliency in the wireless environment, the use of ternary MQ arithmetic coders/decoders that are based on the concept of forbidden symbol has been proposed. This pap...
详细信息
ISBN:
(纸本)9781424417650
To improve the JPEG2000 compression standard error resiliency in the wireless environment, the use of ternary MQ arithmetic coders/decoders that are based on the concept of forbidden symbol has been proposed. This paper presents two ternary MQ based techniques to reduce both the computational complexity and the memory requirement during the decoding process, with no or little degradation in the PSNR.
Because of the feedback loops caused by iterative operations, MQ arithmetic coder usually acts as the performance bottleneck of the hardware architecture for JPEG2000 algorithm. According to the different features of ...
详细信息
ISBN:
(纸本)9781424424238
Because of the feedback loops caused by iterative operations, MQ arithmetic coder usually acts as the performance bottleneck of the hardware architecture for JPEG2000 algorithm. According to the different features of the loops, this paper adopts different optimizing methods rather than general concurrent techniques to improve the hardware efficiency as well as throughput. Based on careful analysis of data dependency, circuit-level optimizations such as assistant loops, inverse multi branches selection (IMBS) are used to improve clock frequency. For the low hardware utilization caused by variable features of inside dataflow, reorganization of dataflow is performed and both the hardware-efficiency and the throughput are improved. The implementation result shows that the throughput of our design can exceed those based on traditional concurrent techniques. Moreover, the hardware utilization is much higher than exiting architectures.
In the fast algorithm of arithmetic coding proposed by Jiang, the normalization is controlled by the width of the coding range and the output codes are in bits style. But the bit-stuffing technique to
In the fast algorithm of arithmetic coding proposed by Jiang, the normalization is controlled by the width of the coding range and the output codes are in bits style. But the bit-stuffing technique to
Because of the feedback loops caused by iterative operations, MQ arithmetic coder usually acts as the performance bottleneck of the hardware architecture for JPEG2000 algorithm. According to the different features of ...
详细信息
Because of the feedback loops caused by iterative operations, MQ arithmetic coder usually acts as the performance bottleneck of the hardware architecture for JPEG2000 algorithm. According to the different features of the loops, this paper adopts different optimizing methods rather than general concurrent techniques to improve the hardware efficiency as well as throughput. Based on careful analysis of data dependency, circuit-level optimizations such as assistant loops, inverse multi branches selection (IMBS) are used to improve clock frequency. For the low hardware utilization caused by variable features of inside dataflow, reorganization of dataflow is performed and both the hardware-efficiency and the throughput are improved. The implementation result shows that the throughput of our design can exceed those based on traditional concurrent techniques. Moreover, the hardware utilization is much higher than exiting architectures.
We propose applying an adaptive context-tree weighting (CTW) method in the H.264 video coders. We first investigate two different ways to incorporating the CTW method into an H.264 coder and compare the coding effecti...
详细信息
ISBN:
(纸本)0819452114
We propose applying an adaptive context-tree weighting (CTW) method in the H.264 video coders. We first investigate two different ways to incorporating the CTW method into an H.264 coder and compare the coding effectiveness of using the method with that of using the context models specified in the H.264 standard. We then describe a novel approach for automatically adapting the CTW method based on the syntactic element to be coded and the encoding parameters. We show that our CTW-based arithmetic coding method yields similar or better compression results compared with the context-based adaptive arithmetic coding method used in H.264, without having to specify so many context models.
In this paper, an application of wavelet packet-enhanced arithmetic coding to compress the electric power disturbance data is proposed. In the proposed method, the wavelet packet is first applied in anticipation that ...
详细信息
In this paper, an application of wavelet packet-enhanced arithmetic coding to compress the electric power disturbance data is proposed. In the proposed method, the wavelet packet is first applied in anticipation that the disturbance signal can be optimally decomposed into higher frequency components and lower frequency ones on a best wavelet basis. Then, the arithmetic coding approach is utilized to reduce the redundancy of data encoding, thereby lowering down the cost related with data storage and transmission. This integrated method has been tested on different scenarios and the results are compared with other published techniques.
Recently, several efficient context-based arithmetic coding algorithms have been developed successfully for lossless compression of error-diffused images. In this paper, we first present a novel block- and texture-bas...
详细信息
Recently, several efficient context-based arithmetic coding algorithms have been developed successfully for lossless compression of error-diffused images. In this paper, we first present a novel block- and texture-based approach to train the multiple-template according to the most representative texture features. Based on the trained multiple template, we next present an efficient texture- and multiple-template-based (TM-based) algorithm for lossless compression of error-diffused images. In our proposed TM-based algorithm, the input image is divided into many blocks and for each block, the best template is adaptively selected from the multiple-template based on the texture feature of that block. Under 20 testing error-diffused images and the personal computer with Intel Celeron 2.8-GHz CPU, experimental results demonstrate that with a little encoding time degradation, 0.365 s (0.901 s) on average, the compression improvement ratio of our proposed TNI-based algorithm over the joint bilevel image group (JBIG) standard [over the previous block arithmetic coding for image compression (BACIC) algorithm proposed by Reavy and Boncelet is 24%] (19.4%). Under the same condition, the compression improvement ratio of our proposed algorithm over the previous algorithm by Lee and Park is 17.6% and still only has a little encoding time degradation (0.775 s on average). In addition, the encoding time required in the previous free tree-based algorithm is 109.131 s on average while our proposed algorithm takes 0.995 s;the average compression ratio of our proposed TM-based algorithm, 1.60, is quite competitive to that of the free tree-based algorithm, 1.62.
In this paper, an innovative joint-source channel coding scheme is presented. The proposed approach enables iterative soft decoding of arithmetic codes by means of a soft-in soft- out decoder based on suboptimal searc...
详细信息
In this paper, an innovative joint-source channel coding scheme is presented. The proposed approach enables iterative soft decoding of arithmetic codes by means of a soft-in soft- out decoder based on suboptimal search and pruning of a binary tree. An error-resilient arithmetic coder with a forbidden symbol is used in order to improve the performance of the joint source/channel scheme. The performance in the case of transmission across the AWGN channel is evaluated in terms of word error probability and compared to a traditional separated approach. The interleaver gain, the convergence property of the system, and the optimal source/channel rate allocation are investigated. Finally, the practical relevance of the proposed joint decoding approach is demonstrated within the JPEG 2000 coding standard. In particular, an iterative channel and JPEG 2000 decoder is designed and tested in the case of image transmission across the AWGN channel.
An affine motion model provides better motion representation than a translational motion model. Therefore, it is a good candidate for advanced video compression algorithms, requiring higher compression efficiency than...
详细信息
An affine motion model provides better motion representation than a translational motion model. Therefore, it is a good candidate for advanced video compression algorithms, requiring higher compression efficiency than current algorithms. One disadvantage of the affine motion model is the increased number of motion vector parameters, therefore increased motion vector bit rate. We develop and analyze several simulation based approaches of entropy coding for orthonormalized affine motion vector (AMV) coefficients, by considering various context-types and coders. In our work we expand the traditional idea of a context type by introducing four new context types. We compare our method of contexts-type and coder selection with context quantization. The best of our contexts-type and coder solutions produces 4% to 15% average AMV bit-rate reductions over the original VLC approach. For more difficult content AMV bit rate reduction up to 26% is reported.
暂无评论