• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.10
• /
• pp.1-12
• /
• 1993

A multiprocessor system for high-speed processing of hybrid image coding algorithms such as H.261, MPEG, or Digital HDTV is presented in this study. Using a combination of highly parallel 32-bit microprocessor, DCT(Discrete Cosine Transform), and motion detection processor, a new processing module is designed for the implementation of high performance coding system. The sysyem is implemented to allow parallel processing since a single module alone cannot perform hybrid coding algorithms at high speed, and crossbar switch is used to realize various parallel processing architectures by altering interconnections between processing modules within the system.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.641-644
• /
• 2011

In this letter, we propose a novel bitrate control, using both Kalman and FIR filters, based on a Hamiltonian analysis with respect to the amount of bits from each macroblock, in an encoding of a general video codec such as H.264/AVC. Since the proposed bitrate control is based on the simple computation of an optimal control method based on the Hamiltonian analysis, it is not necessary to use additional computation, such as a DCT or quantization, to estimate the bits for bitrate control. As a result, the proposed algorithm can be applied to single-pass encoding and can provide sufficient encoding speed with respect to various applications, even those requiring real-time control.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.458-471
• /
• 2006

Digital watermarking of multimedia data is a very active research area that has enjoyed a considerable amount of attention in recent years. In this paper, we propose an algorithm for embedding/detecting a fragile watermark in MPEG-4 compressed video domain (Simple and Advance Simple Profiles). The watermark bits are put directly into Huffman VLC-codespace of quantized DCT domain. The advantage of watermark embedding into the compressed domain is the significant savings for a real-time implementation as it does not require a full decoding operation. The watermark embedding does not change the video file size. The algorithm demonstrates high watermarking capacity, thereby providing reliable foolproof authentication. The results of experimental testing demonstrate that watermark embedding preserves the video quality. Watermark detection is performed without using the original video.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.36-42
• /
• 1997

This paper presents a new design technique for performing high quality low bit rate image compression. A hybrid coder(HC) which combines Mean Removed Important Coefficient Selection based JPEG(MR-ICS-JPEG) and Adaptive Vector Quantization (AVQ) is proposed. A new quantization table is developed using the Important Coefficient Selection(ICS) method; the importance of each coefficient is determined using the orthonormal property of the DCT. This quantization table is applied to standard JPEG with mean removal(MR) strategy before processing. This scheme, called MR-ICS-JPEG, produces more than 2 dB enhanced performance in terms of PSNR over standard JPEG. A set of homogeneous codebooks is generated by homogeneous training vectors. Before compression, an image is uniformly divided into 8${\times}$8 blocks. Low detail regions such as backgrounds are roughly coded by AVQ while high detail regions such as edges or curves are finely coded by the proposed MR-ICS-JPEG. This hybrid coder procuces consistently about 3 dB improved performance in terms of PSNR over standard JPEG.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.3
• /
• pp.37-43
• /
• 2009

Steganography conceals the fact that hidden message is being sent on the internet. Steganalysis can be detected the abrupt changes in the statistics of a stego-data. After message embedding, I have analyzed for the statistical significance of the fact the occurrence of differences among the four-neighboring pixels. In this case, when a embedding messages within a images is small, use EC value and chi-square test to determine whether a distribution in an images matches a distribution that shows distortion from stego-data.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.451-454
• /
• 2004

The reconfigurable architecture is increasingly important for design of multi-mode communication systems and computation-intensive DSP systems. The proposed coarse-grain architecture is based on a reconfigurable processing element consisting of a MAC unit, a register file, a context data register, and PE interconnect control blocks. The main feature of the Proposed architecture is the loop context which enables faster configuration. Also, we propose another area-efficient reconfigurable architecture with improved reconfigurability. The SystemC modeling results show that the proposed architecture can reduce 9 clock cycles of 2D DCT compared to existing architectures.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.553-556
• /
• 2000

This paper proposes an adaptive linearization method of Volterra nonlinear systems using DWT(Discrete Wavelet Transform)and an LMS-type predistorter. In particular, the proposed wavelet transform-domain lineatization method leads to diagonalization of the input vector auto-correlation matrix which yields improvement of the convergence rate of the corresponding transform-domain LMS algorithm. Furthermore, the adaptive Volterra predistorter followed by a corresponding weakly Volterra nonlinear system(here. a TWT amplifier model in a satellite communication system) is utilized to compensate for the distortion in the output. Also,12-PSK and 4-QAM are applied as the input to the nonlinear system to be tested. Some simulation results show that the proposed linearization approach has better performance than DCT-based or conventional normalized LMS algorithms do.

• The Korean Journal of Applied Statistics
• /
• v.24 no.1
• /
• pp.35-43
• /
• 2011

In this paper, we introduce a unit root test via discrete cosine transform in the AR(1) process. We first investigate the statistical properties of DCT coefficients under the stationary AR(1) process and the random walk process in order to verify the validity of the proposed method. A bootstrapping approach is proposed to induce the distribution of the test statistic under the unit root. We performed simulation studies for comparing the powers of the Dickey-Fuller test and the proposed test.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2254-2263
• /
• 2000

This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.577-580
• /
• 1999

Padding is a technique that enables applying conventional discrete cosine transform to encode boundary blocks of arbitrarily shaped objects by assigning imaginary values to the pixels that are not included in the object. Padding prevents the increase of high frequency DCT coefficients. However, in some boundary blocks, too many padded pixels are coded due to a small portion of object pixels. To reduce the number of padded pixels and to improve coding efficiency, we propose a block merging method for texture coding. The proposed mothed searches the shape information of boundary blocks and excludes the 4$\times$4 pixels of 8$\times$8 blocks if all the 4$\times$4 pixels are in the background region, and merges the remained 4$\times$4 pixels into new 8$\times$8 blocks. Experimental results show that our proposed method yields a rate-distortion gain about 0.5~1.6㏈ compared to conventional padding method, LPE