• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.618-622
• /
• 2009

An improvement of standard encoder has been saturated recently. However, new coding method does not have a compatibility with conventional standard. To solve this problem, new concept coding method that has a semicompatibility with standard may be discussed. On the other hand, cyclic Intra-picture coding is used for access and refreshment. However, I-picture spend large amount of bits. An enhancement of I-picture is desired with keeping its refreshment performance. Further, it's a problem that quality change at the border of GOP because of its independency. To respond these, we propose the coding which is applied an inter-frame processing at the border of GOP. Applied method is the reduction of quantization error using the motion compensated inter-picture processing. In this report, we check the improvement of the efficiency and the compatibility of proposed method. As a result of examination, we recognize that the total gain is maximally 1.2dB in PSNR. Generally, the degradation of performance in standard decoding is smaller than its gain. Also the refreshment performance is tested.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.258-264
• /
• 2004

This paper propose a method that GOP structure based on the picture complexity change realtime adaptive without pre-analysis or time delay. Proposed algorithm calculates the complexity of pictures at first, and the ratio of the complexity( X$\sub$p/ /X$\sub$i/) between P picture and I picture is calculated. The suitable M value for the three picture select by comparing with predetermined threshold. Used bit and vbv_delay the value of GOP is calculated according to selected M. Experimental results show that the prediction error is reduce than the fixed GOP structure. Since the complexity distribution of the sequence is different, applied limits of threshold value is changed, also.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2006.08a
• /
• pp.1398-1401
• /
• 2006

Silver paste curing process is very important in LCoS panel manufacture because incomplete curing process will cause poor bonding strength and increase resistance. The imperfection situation results in poor reliability and the variation of the common voltage, respectively. The change of the common voltage causes image flicker. According to Kinetics, we acquire activation energy by using dynamic DSC and compare two kinds of silver paste. From the result of isothermal DSC, we get optimum curing parameters to solve the flicker problem caused of incomplete curing of the silver paste.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.28-34
• /
• 1999

In this paper. we propose the method of Scene Change Detection for video sequence using the DC components and the moving vectors in the Macro Blocks in the DCT blocks. The proposed method detects the Scene Change which would not be related with the specific sequences in the compressed MPEG domain. To do this. we define new metrics for Scene Change Detection using the features of picture component and detect the exact Scene Change point of B-pictures using the characteristics of B-picture's sharp response for the moving vectors. In brief, we will detect the cut point using I-picture and the gradual scene changes such as dissolve, fade, wipe, etc. As a results, our proposed method shows good test results for the various MPEG sequences.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.277-282
• /
• 2005

The arrangement of I-picture starting times of multiplexed variable bit .ate (VBR) MPEG videos may significantly affect the cell loss ratio (CLR) characteristics of the multiplexed traffic. This paper presents an efficient I-picture arrangement method which can minimize the CLR of the multiplexed traffic when multiple VBR MPEG videos are multiplexed onto a single constant bit rate link. In the proposed method, we use the probability that the arrival rate exceeds the link capacity as the measure for the CLR of the multiplexed traffic. Simulation results show that the proposed method can find more optimal arrangement than existing methods in respect of the CLR.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3E
• /
• pp.7-13
• /
• 1997

This paper addresses traffic prediction issues on MPEG. A new adaptive traffic prediction scheme is proposed using MPEG picture characteristic that picture traffic depends on the coding mode of that picture, that is, I, P, and B mode. Our prediction scheme, which is based n picture decomposition (PD) and the cross-correlation of the different types of pictures, has better performance in predicting bursty MPEG traffic than that of the first-order autoregressive (AR) prediction scheme. Our simulation results show that the performance is further improved about 15% by utilizing the cross-correlations between pictures.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.442-446
• /
• 2004

This paper propose scene change detection algorithm using coefficient of forward prediction macro-block, backward prediction macro-block, and intra-coded macro-block on getting motion estimation. Proposed method detect scene change with correlation according picture type forward two picture or forward and backward two picture on video sequences. Proposed algorithm is high accuracy and can detect all scene change on video, and detect to occur scene change on P, B, I-picture.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.269-272
• /
• 2007

The shortcut shot detection based on MPEG compressed video bitstream is presented in this paper. The detection algorithm is used the video picture frame from MPEG compressed video directly not to be decompressed the original image. For shortcut detection, I and P frame of MPEG video bitstream are classified. The changing scene cuts at I pictures are detected by the decompressed DC image and scene cuts at P picture frame by monitoring the percentage of intra-macroblocks per P picture are detected. Experimental results using test video bitstream QVGA results in average 92% detection rate, searching time is taken around 4.5 times faster in comparison with changing scene shot detection algorithm which is decompressed the compressed bitstream.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.258-268
• /
• 2001

The compression method is necessarily used to send the high quality moving picture that contains a number of data in image processing. In the field of moving picture compression method, the motion estimation algorithm is used to reduce the temporal redundancy. Block matching algorithm to be usually used is distinguished partial search algorithm with full search algorithm. Full search algorithm be used in this paper is the method to compare the reference block with entire block in the search window. It is very efficient and has simple data flow and control circuit. But the bigger the search window, the larger hardware size, because large computational operation is needed. In this paper, we design the full search block matching motion estimator. Using the DCT DC values, we decide luminance. And we apply 3 bit compare-selector using bit plane to I(Intra coded) picture, not using 8 bit luminance signals. Also it is suggested that use the same selective bit for the P(Predicted coded) and B(Bidirectional coded) picture. We compare based full search method with PSNR(Peak Signal to Noise Ratio) for C language modeling. Its condition is the reference block 8$\times$8, the search window 24$\times$24 and 352$\times$288 gray scale standard video images. The result has small difference that we cannot see. And we design the suggested motion estimator that hardware size is proved to reduce 38.3％ for structure I and 30.7％ for structure II. The memory is proved to reduce 31.3％ for structure I and II.

• Journal of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.93-96
• /
• 2013

Modified Newtonian Dynamics (MOND) is a possible solution for the missing mass problem in galactic dynamics; its predictions are in good agreement with observations in the limit of weak accelerations. However, MOND does not derive from a physical mechanism and does not make predictions on the transitional regime from Newtonian to modified dynamics; rather, empirical transition functions have to be constructed from the boundary conditions and comparisons with observations. I compare the formalism of classical MOND to the scaling law derived from a toy model of gravity based on virtual massive gravitons (the "graviton picture") which I proposed recently. I conclude that MOND naturally derives from the "graviton picture" at least for the case of non-relativistic, highly symmetric dynamical systems. This suggests that-to first order-the "graviton picture" indeed provides a valid candidate for the physical mechanism behind MOND and gravity on galactic scales in general.