• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.1-9
• /
• 2009

This paper develops a fast method performing intra prediction which only restores block boundary pixels without decoding all blocks in an I slice of H.264/AVC. To accomplish this, we develop a fast integer inverse DCT scheme that quickly decodes residual block boundary which can be consisted of references pixels. we add the restored block boundary pixels and appropriate calculated prediction pixels for each intra prediction mode and consist of needed reference pixels. The experiments showed that the proposed method produces the reliable performance with reducing the computational complexity, compared to conventional method when applied to H.264/AVC integer DCT.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.1
• /
• pp.55-63
• /
• 2000

This paper investigated the sub-region compression effect of the three dimensional DCT(3D-DCT) using the difference component(DC) of inter-frame in images. The proposed algorithm are the method that obtain compression effect to divide the information into subband after 3D-DCT, the data appear the type of cubic block(8${\times}$8${\times}$8) in eight difference components per unit. In the frequence domain that transform the eight differential component frames into eight DCT frames with components of both spatial and temporal frequencies of inter-frame, the image data are divided into frame component(8${\times}$8 block) of time-axis direction into 4${\times}$4 sub block in order to effectively obtain compression data because image components are concentrate in corner region with low-frequency of cubic block. Here, using the weight of sub block, we progressed compression ratio as consider to adaptive sub-region of low frequency part. In simulation, we estimated compression ratio, reconstructed image resolution(PSNR) with the simpler image and the complex image contained the higher frequency component. In the result, we could obtain the high compression effect of 30.36dB(average value in the complex-image) and 34.75dB(average value in the simple-image) in compression range of 0.04~0.05bpp.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.331-342
• /
• 2005

In this paper, we propose an efficient watermarking algorithm using block indexing. The proposed algorithm is a novel blind watermarking scheme using the indexed watermark value based on the spread spectrum method. The watermark insertion is allocated into index value of each block after dividing original image into sub-blocks. The watermark embedded in mappinged with index values of blocks, And the mappinged blocks convert to DCT and then the PN sequence embedded to middle frequency band. Consequently the watermark is expressed by index value of sub-blocks. The watermark extracted from the correlation of between PN sequence and watermarked image. Experimental results demonstrate that the watermarked image has a good quality in terms of imperceptibility and is robust against various attacks.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.42-53
• /
• 2000

Efficient implementation of pre-filtering has been an important issue in video sequence coding, because it can remove camera noise and improve coding efficiency dramatically This paper introduces a novel pre-filtering scheme that is performed inside a video encoder The proposed pre-filtering is based on the approximated generalized Wiener filtering and two-dimensional discrete cosine transform (DCT) factorization. and is achieved by scaling the DCT coefficients of original image blocks for intra block coding and those of motion-compensated error blocks for inter block coding, respectively Even though the pre-filtering operation is embedded in a video encoder, its additional computational complexity is marginal compared to the encoding process, and the overall architecture of the conventional video encoder is maintained In spite of its simplicity, the proposed pre-filtering scheme provides good filtering and coding performance for noisy video sequences.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.113-122
• /
• 2006

In this paper, we propose a fuzzy method to control bit-rate in the DCT Domain. The method consists of a bit-rate allocation with fuzzy measures and a least-distortion bit-rate reduction. Fuzzy measures are calculated by the code length, the discontinuity ambiguity, and the neighborhood momentum in each DCT block. These measures are summed with weights and form a reduction fuzziness to indicate the degree of preferable reduction. Using the reduction fuzziness. each DCT block is filtered by the least-distortion reduction method to adjust the bit-rate for the target bandwidth. In the experiment, we show the results that the transcoded video quality by the method is better and the bandwidth is more regular than those of existing methods in both visually and quantitatively.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.956-962
• /
• 2005

To improve video quality and coding efficiency, H.264/AVC adopts different half pixel calculating method compared with the previous standards. So, the transcoder requires additional works to transcode the pre-coded video contents with the previous standards to H.264/AVC in DCT domain. In this paper, we propose the first half-pixel correction method for MPEG-2 to H.264 transcoding in DCT domain. In the proposed method, MPEG-2 block is added to the correction block obtained by difference calculation of half-pixel values between two standards using DCT reference frame. Experimental results show that the proposed achieves better quality than pixel based cascaded transcoding method.

• 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 Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.93-103
• /
• 2005

In this paper, we propose a RST resistant robust logo embedding technique for multimedia copyright protection Geometric manipulations are challenging attacks in that they do not introduce the quality degradation very much but make the detection process very complex and difficult. Watermark embedding in the normalized image directly suffers from smoothing effect due to the interpolation during the image normalization. This can be avoided by estimating the transform parameters using an image normalization technique, instead of embedding in the normalized image. Conventional RST resistant schemes that use full frame transform suffer from the absence of effective perceptual masking methods. Thus, we adopt $8\times8$ block DCT and calculate masking using a spatio-frequency localization of the $8\times8$ block DCT coefficients. Simulation results show that the proposed algorithm is robust against various signal processing techniques, compression and geometrical manipulations.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.138-148
• /
• 2001

Digital Video (DV) coding standards for digital video cassette recorder are based mainly on DCT and variable length coding. DV has low hardware complexity but high compressed bit rate of about 26 Mb/s. Thus, it is necessary to encode video with low complex video coding at the studios and then transcode compressed video into MPEG-2 for video-on-demand system. Because these coding methods exploit DCT, transcoding in the DCT domain can reduce computational complexity by excluding duplicated procedures. In transcoding DV into MPEC-2 intra coding, multiplying matrix by transformed data is used for 4:1:1-to-4:2:2 chroma format conversion and the conversion from 2-4-8 to 8-8 DCT mode, and therefore enables parallel processing. Variance of sub block for MPEG-2 rate control is computed completely in the DCT domain. These are verified through experiments. We estimate motion hierarchically using DCT coefficients for transcoding into MPEG-2 inter coding. First, we estimate motion of a macro block (MB) only with 4 DC values of 4 sub blocks and then estimate motion with 16-point MB using IDCT of 2$\times$2 low frequencies in each sub block, and finish estimation at a sub pixel as the fifth step. ME with overlapped search range shows better PSNR performance than ME without overlapping.

• Journal of Korea Multimedia Society
• /
• v.9 no.10
• /
• pp.1276-1281
• /
• 2006

In this paper, We proposed a robust blind digital watermarking algorithm using variance and DCT domain. The proposed method embedded watermark signals into DC components of $8{\times}8$ block DCT using valiance, texture regions and smooth regions. In the digital watermarking algorithms using DCT domain, more robustness can be achieved if watermarks are embedded in DC components since DC components have much larger perceptual capacity than AC components. Experiment showed that robustness of the proposed method better than that of the conventional methods in JPEG quality and scaling attack.