• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.6
• /
• pp.1273-1278
• /
• 2012

In this paper, we introduce modified integer transforms for lossless image compression and evaluate their performances for two-dimensional transforms. The two-dimensional extensions of the modified integer transforms show different performances in terms of coding efficiency and computational complexity. Thus, we measure performances for two-dimensional separable transforms and a two-dimensional non-separable transform. The separable modified integer transform used in H.264, the modified integer transform using the lifting scheme, and the non-separable transform in JPEG XR are evaluated in this paper. Also, experiments and their results are given. The experimental results indicate that the modified integer transform using the lifting scheme shows the best performance in terms of compression efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2254-2260
• /
• 2010

This papers describes modification of the integer transform used in H.264/AVC in order to efficiently apply to lossless compression. The previous reversible integer transform is not efficient for lossless compression due to large dynamic range of the transform coefficients. To reduce the problem, efficient and reversible integer transforms are proposed. The modified transforms are designed based on the lifting scheme for fast transforms. This paper introduces signal flow graphs for the proposed fast transforms and provides corresponding experimental results. The results indicate that the proposed modified reversible integer transform are superior to the previous transform in terms of lossless compression efficiency.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.75-80
• /
• 2023

We show the design of fast invertible block transforms that can replace the DCT in future wireless and portable computing application. This is called binDCT. In binDCT, both the forward and the inverse transforms can be implemented using only binary shift and addition operation. And the binDCT inherits all desirable DCT characteristics such as high coding gain, no DC leakage, symmetric basis functions, and recursive construction. The binDCT also inherits all lifting properties such as fast implementations, invertible integer-to-integer mapping, in-place computation. Thus, this method has advantage of fast implementation for complex DCT calculations. In this paper, we present computation costs and performance analysis between DCT and binDCT using Shapiro's EZW.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.11
• /
• pp.66-78
• /
• 2015

With the development of bio computing technology, DNA watermarking to do as a medium of DNA information has been researched in the latest time. However, DNA information is very important in biologic function unlikely multimedia data. Therefore, the reversible DNA watermarking is required for the host DNA information to be perfectively recovered. This paper presents a reversible DNA watermarking using least square based prediction error expansion for noncodng DNA sequence. Our method has three features. The first thing is to encode the character string (A,T,C,G) of nucleotide bases in noncoding region to integer code values by grouping n nucleotide bases. The second thing is to expand the prediction error based on least square (LS) as much as the expandable bits. The last thing is to prevent the false start codon using the comparison searching of adjacent watermarked code values. Experimental results verified that our method has more high embedding capacity than conventional methods and mean prediction method and also makes the prevention of false start codon and the preservation of amino acids.