• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.23-33
• /
• 2007

Video compression is essential technique for fast and efficient transmission of a large amount of video data maintaining high quality. Also, motion estimation and motion compensation is most important technique for efficient video compression. A proposed method is improved diamond search method which uses split diamond pattern and rotated diamond pattern. In particular, the proposed method shows superb result when it is used for the sequence with a direction of camera moving. Moreover when it is used for the sequence with little motion, complexity is reduced considerably by using fewer search points. Also, by varying the number of initial search points, the propose method can provide several options in terms of duality or speed. Simulation results shows that the proposed method sustains better visual quality compared with diamond search method and HEXBS even by using fewer search points. Besides, compared with existing methods, it is able to conduct a motion estimation more efficiently by changing the number of search points adaptively according to motion of video data.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.1
• /
• pp.17-27
• /
• 2014

Numerical model became one of most important tools for identifying the state of an existing structure in accordance with development of numerical analysis techniques. A numerical model should be updated based on the measured responses from the existing structure to accurately use the model for identifying the state of the bridge and executing numerical experiments. In this study, a new model updating method based on repetition method without a differential function is introduced and applicability for high speed railway bridge is verified with dynamic stability analysis. A fine measurement based on measurement points roaming method was executed with an wireless measurement system for precise dynamic characteristic analysis. The natural frequencies and mode shapes were estimated by correlation analysis and a mode decomposition technique. An initial numerical model was constructed based on design drawings and the model have been updated in accordance with the introduced model updating method. The results from numerical experiment and field test have been compared for verifying the applicability of the model updating method. And the dynamic stability analysis has been executed to verify the usability of the updated numerical model and the model updating method. It seems that the model updating method can be used for various bridges after evaluation of applicability for other type bridges in further studies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8C
• /
• pp.764-771
• /
• 2009

In this paper, we propose a fast multiple reference frame selection method using neighboring motion vectors and the correlation of inter-mode blocks in H.264 video coding. Using the property that an optimal reference frame has the statistical characteristics, the motion estimation of small Inter-block size is estimated from the motion estimation of the larger Inter-block size. Simulation results show that the proposal method decreased the computations about 91%. Without the sacrifice of coding performance, comparing to the H.264 multiple reference picture coding.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.203-206
• /
• 2015

본 논문은 4K UHD 입력 영상에 대한 HEVC 고속 부호화를 위하여 대부분의 상용 CPU 및 AP 에서 사용되고 있는 SIMD (Single Instruction Mutiple Data) 명령어를 사용한 고속의 정수 화소 단위 움직임 추정 방법에 대한 연구이다. 특히, IT 기기에서의 고속 동영상 부호화를 위해 기존의 SIMD 명령어를 개량하여 동일한 CPU 실행시간에 다수의 움직임 추정을 수행할 수 있는 SIMD 명령어를 사용하여 보다 같은 실행시간에 보다 넓은 영역에 대한 움직임 벡터 탐색을 수행할 수 있도록 Search Box 기법을 새로이 개발하고 이를 토대로 기존 HEVC 에서 사용되고 있는 움직임 추정 방법에 대하여 연산시간을 줄이는 동시에 화질 열화를 최소화 시킬 수 있는 방법에 대하여 논한다.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.147-154
• /
• 2007

In this paper, we propose a new parallel search algorithm to acquire synchronization for UWB(Ultra Wideband) systems that reduces computation of the correlation. The conventional synchronization acquisition algorithms check all the possible signal phases simultaneously using multiple correlators. However it reduces the acquisition time, it makes high power consumption owing to increasing of correlation. The proposed algorithm divides the preamble signal to input the correlator into an m-bit bunch. We check the result of the correlation at first stage of an m-bit bunch data and predict whether it has some synchronization acquisition information or not. Thus, it eliminates the unnecessary operation and save the number of correlation. We evaluate the proposed algorithm under the AWGN and the multi-Path channel model with MATLAB. The proposed parallel search scheme reduces number of the correlation 65% on the AWGN and 20% on the multi-path fading channel.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.247-256
• /
• 2004

In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.539-548
• /
• 2013

Although Motion estimation (ME) plays an important role in digital video compression, it requires a complicated search procedure to find an optimal motion vector. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. The computational complexity of motion estimation for Multi-view video coding increases in proportion to the number of cameras. To reduce computational complexity and maintain the image quality, a low complexity motion estimation search method is proposed in this paper. The proposed search method consists of four-grid diamond search patten, two-gird diamond search pattern and TZ 2 Point search pattern. These search patterns exploit the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over TZ search method (JMVC) can be up to 1.8~4.5 times faster by reducing the computational complexity and the image quality degradation is about to 0.01~0.24 (dB).

• Journal of Broadcast Engineering
• /
• v.23 no.5
• /
• pp.628-635
• /
• 2018

In this paper, we propose a fast motion estimation algorithm which is important in video encoding. So many fast motion estimation algorithms have been published for improving prediction quality and computational reduction. In the paper, we propose an algorithm that reduces unnecessary computation, while almost keeping prediction quality compared with the full search algorithm. The proposed algorithm calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, and finds optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain fast computational speed by reducing unnecessary computations. Additionally, the proposed algorithm can be used with conventional fast motion estimation algorithms and prove it in the experimental results.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.119-124
• /
• 1998

Block Matching Motion Estimation(BMME) Algorithm is demands a very large amount of computing power and have been proposed many fast algorithms. These algorithms are many problem that larger size of VLSI scale due to non-localized search block data and problem of non-reuse of input data for each processing step. In this paper, we designed systolic arry of high processing capacity, constraints input output pin size and reuse of input data for small VLSI size. The proposed systolic array is optimized memory access time because of iterative reuse of input data on search block and become independent of problem size due to increase of algorithm's parallelism and total processing elements connection is localized spatial and temporal. The designed systolic array is reduced O(N6) time complexity to O(N3) on moving vector and has O(N) input/output pin size.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.6
• /
• pp.692-702
• /
• 2001

In this paper, a new block-matching algorithm for standard video encoder is proposed. The algorithm finds a motion vector using the increasing SAD transition curve for each predefined candidates, not a coarse-to-fine approach as a conventional method. To remove low-probability candidates at the early stage of accumulation, a dispersed accumulation matrix is also proposed. This matrix guarantees high-linearity to the SAD transition curve. Therefore, base on this method, we present a new fast block-matching algorithm with the slice competition technique. The Candidate Selection Step and the Candidate Competition Step makes an out-performance model that considerably reduces computational power and not to be trapped into local minima. The computational power is reduced by 10%~70% than that of the conventional BMAs. Regarding computational time, an 18%~35% reduction was achieved by the proposed algorithm. Finally, the average MAD is always low in various bit-streams. The results were also very similar to the MAD of the full search block-matching algorithm.