• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.1-5
• /
• 2001

네트워크를 통한 영상 데이터 전송 시 에러가 발생하면 복원 영상의 화질 열화는 매우 심각하다. 따라서, 에러 영상을 복원하기 위한 에러 은닉 기술은 복호기 쪽에 매우 중요하다. 본 논문에서는 매크로블록이 움직임 벡터와 함께 손상이 되었을 때 주변 매크로블록의 움직임 벡터를 이용한 빠르고 효율적인 에러 은닉 기법을 제안한다. 실험 결과 에러 은닉 기법을 제안한다. 실험 결과 에러 블록 주변의 경계화소를 이용한 기존의 방법과 비교하여 거의 동등한 복원 화질을 얻으면서도 에러 은닉을 위한 처리 시간을 획기적으로 단축하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.288-296
• /
• 2009

In POCS (projection onto convex sets)-based reconstruction of HR (high resolution) image, the quality of reconstructed image is gradually improved through iterative motion estimation and image restoration. The amount of computation, however, increases because of the repeated inter-frame motion estimation. In this paper, an HR reconstruction algorithm is proposed where modified ARPS (adaptive rood pattern search) and POCS are simultaneously performed. In the modified ARPS, the motion estimates obtained from phase correlation or from the previous steps in POCS restoration are utilized as the initial reference in the motion estimation. Moreover, estimated motion is regularized with reference to the neighboring blocks' motion to enhance the reliability. Computer simulation results show that, when compared to conventional methods which are composed of full search block matching and POCS restoration, the proposed method is about 30 times faster and yet produces HR images of almost equal or better quality.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.159-161
• /
• 2017

In this paper, we propose an adaptive search range allocation algorithm for high-performance HEVC encoder and a hardware architecture suitable for the proposed algorithm. In order to improve the prediction performance, the existing motion vector is configured with the motion vectors of the neighboring blocks as prediction vector candidates, and a search range of a predetermined size is allocated using one motion vector having a minimum difference from the current motion vector. The proposed algorithm reduces the computation time by reducing the size of the search range by assigning the size of the search range to the rectangle and octagon type according to the structure of the motion vectors for the surrounding four blocks. Moreover, by using all four motion vectors, it is possible to predict more precisely. By realizing it in a form suitable for hardware, hardware area and computation time are effectively reduced.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.742-744
• /
• 2005

본 논문에서는 인접 블록의 움직임 벡터를 이용한 움직임 예측 알고리즘을 제안하였다. 제안된 알고리즘은 두개의 탐색 단계로 구성된다. 첫 번째 단계는 인접 블록의 움직임 벡터를 이용한 탐색점에서 오차값이 제일 작은 위치를 초기 시작 위치로 사용하였다. 두 번째 단계는 첫 번째 단계에서 찾은 시작 위치에서 정확한 움직임 예측을 위한 패턴과 방법을 적용 하였다. 제안된 알고리즘은 움직임 벡터가 클 경우에 불필요한 탐색점 개수를 줄이고, 성능저하의 원인인 지역적 최소값(local minimum)에 빠질 위험을 감소시켰다. 제안된 알고리즘은 NTSS, 4SS, IDFS, ARPS와 비교 했으며, 성능면에서는 평균 PSNR이 $0.27\~2.56dB$향상되었고, 탐색점 개수면에서는 평균 27개 감소 하였다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.11
• /
• pp.1820-1828
• /
• 2001

The dynamics of the 6-3 Stewart platform manipulator (SPM) is newly derived based on the kinematic relations particularly developed fur the SPM. The essence of the analysis is to deal with three subsystems of the SPM, each consisting of the command and feedback line links associated with two joined neighboring actuators. The dynamics of the command and feedback line links are first formulated using Lagrange and Newton-Euler method and then combined to derive the dynamic equations of motion fur the SPM. The derived nonlinear equations of motion are so computationally effective that it can be easily applied to real-time high-speed tracking control of 6-3 SPM.

• Journal of the Ergonomics Society of Korea
• /
• v.20 no.3
• /
• pp.11-25
• /
• 2001

AS human movements have the inherent property of anticipating target and can be coordinated to realize a given schedule, finger movements have stereotyped patterns during hand grasping. Finger movements have been studied in the past to find out the coordination pattern of hand joint angular movement. These studies analyzed only a few finger joints for a limited number of hand postures. This study investigated fourteen joint angles during eight hand-grasping motions to analyze the angular correlations between finger joints and to suggest motion factors which represent hand grasping. Hand grasping motions including forward arm motion were examined in ten healthy volunteers. Eight objects were used to represent real hand grasping tasks. $CyberGlove^{TM}$ and $Fasreack^{TM}$ measured hand joint angles and wrist origin. Joint angle correlations between PIJ(proximal interphalangeal joint) and MPJ(metacarpophalangeal joint) at one finger, between neighboring PIJs and MPJs were four factors related to the fast phase of hand grasping motions and eight factors related to the slow phase of hand grasping motions.

• Bulletin of the Korean Chemical Society
• /
• v.19 no.11
• /
• pp.1217-1221
• /
• 1998

We present results of molecular dynamic (MD) simulations for the segmental motion of liquid n-heptadecane in order to investigate conformational transitions from one rotational isomeric state to another. The behavior of the hazard plots for n-heptadecane obtained from our MD simulations are compared with that for polymer of Brownian dynamics (BD) study. The transition rate at the ending dihedrals of the n-heptadecane chain is much higher than that at the central dihedrals. In the study of correlation between transitions of neighboring dihedrals, the large value of c2 implies that some 30% of the transitions of the second neighbors can be regarded as following transitions two bonds away in a correlated fashion. Finally the analysis of multiple transitions and the number of times occurred in the initial 0.005 ns are discussed.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.411-417
• /
• 2006

Motion Estimation (ME) is an important part of video coding process and it takes the largest amount of computation in video compression. Half-pixel and quarter-pixel motion estimation can improve the video compression rate at the cost of higher computational complexity In this paper, we suggest a new efficient low-complexity algorithm for half-pixel and quarter pixel motion estimation. It is based on the experimental results that the sum of absolute differences(SAD) shows parabolic shape and thus can be approximated by using interpolation techniques. The sub-pixel motion vector is searched from the minimum SAD integer-pixel motion vector. The sub-pixel search direction is determined toward the neighboring pixel with the lowest SAD among 8 neighbors. Experimental results show that more than 20% reduction in computation time can be achieved without affecting the quality of video.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.321-328
• /
• 2003

This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.434-445
• /
• 2004

Motion Estimation is an essential module in video encoders based on international standards such as H.263 and MPEG. Many fast motion estimation algorithms have been proposed in order to reduce the computational complexity of a well-known full search algorithms(FS). However, these fast algorithms can not work efficiently in DSP processors recently developed for video processing. To solve for this. we propose an efficient motion estimation scheme optimized in the DSP processor like Philips TM1300. A motion vector predictor is pre-estimated and a small search range is chosen in the proposed scheme using strong motion vector correlation between a current macro block (MB) and its neighboring MB's to reduce computation time. An MPEG-4 SP@L3(Simple Profile at Level 3) encoding system is implemented in Philips TM1300 to verify the effectiveness of the proposed method. In that processor, we can achieve better performance using our method than other conventional ones while keeping visual quality as good as that of the FS.