• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.357-371
• /
• 2005

In this Paper, we propose a new motion search algorithm called CDTS (Cross-Diamond-Triangle Search algorithm) that uses optimal search pattern according to the position of a search area to improve the performance of CDS(Cross-Diamond Search algorithm) as well as CDHSs(Cross-Diamond-Hexagonal Searches algorithms). We analyze motion distributions in various test video sequences to apply optimal search pattern according to a position of search area. Based on the result of this analysis, we propose a new triangle-shaped search pattern whose structure is asymmetric while previous search patterns are generally symmetric in conventional algorithms. In CDTS, we apply cross- and diamond-shaped search patterns to central search areas, and triangle- and diamond-shaped patterns to the other areas. Applying CDTS to test video sequences, the proposed scheme can reduce search points more than CDS and CDHSs by 16.22$\%$ and 3.09$\%$, respectively, without any visual quality degradation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.586-590
• /
• 2006

본 논문에서는 다이아몬드 탐색(diamond search, DS)과 효율적인 3 단계 탐색(efficient three-step search, E3SS) 등의 블록 정합 기법(block matching algorithm, BMA)들에서 이용된 작은 다이아몬드(small diamond) 패턴을 광역 탐색에 적합하도록 확장시킨 고속의 움직임 추정 알고리즘을 제안한다. 제안된 알고리즘에서는 탐색 윈도우(search window)의 중앙으로부터 설치된 정사각형 패턴의 크기가 내부에서 대수적으로 감소되며 작은 다이아몬드 탐색(small diamond search, SDS) 기법에 의해 탐색이 완료된다. 실험 결과는 제안된 알고리즘이 DS 보다 평균 3개의 탐색 점을 더 적게 사용하고 E3SS에 비하여 약 5개 정도의 탐색 점 수에 대한 이득을 보이지만 움직임 추정상의 정확도는 다른 고속 BMA들과 거의 동일한 수준을 유지하는 것으로 확인된다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.57-65
• /
• 2004

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1527-1533
• /
• 2009

In this paper, we design directional search pattern using motion direction biased characteristics of MVP distribution, and proposes a direction applied cross diamond search method that adaptively change search pattern according to moving direction of search point. Proposed method predict motion vectors from neighbor macro blocks, and define initial motion direction by using predicted motion vectors. It improve search efficiency by using alternately proposed search pattern according to motion direction of BMP in search process. The simulation results show that proposed method is able to fast motion estimation compared with conventional cross diamond search, according as it reduce computational complexity that is required of motion estimation with $0.43%{\sim}1.76%$.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.153-157
• /
• 2006

기존의 탐색 알고리즘은 탐색 창 내의 원점에서 탐색을 시작한다. 하지만 영상은 일정한 방향으로 규칙적으로 움직이는 것이 많기 때문에 Frame$_t$ 의 움직임 벡터(MV)가 Frame$_{t-1}$의 움직임 벡터와 같을 가능성이 크다. 이를 참고하여 본 논문에서는 시작점을 원점뿐만 아니라 Frame$_{t-1}$의 MV까지도 예측 시작점으로 선택하여 탐색의 시작점을 다양화 하였다. 실험 결과 탐색 시작점을 다양화 함으로써 full search를 제외한 diamond search, hexagonal search, 4 step search등 기존의 탐색 알고리즘보다 30$\sim$80% 더 작은 SAD값을 구할 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.2
• /
• pp.78-84
• /
• 2009

In general video coding systems, motion estimation (ME) is regarded as a vital component in a video coder as it consumes a large amount of computation resources. Fractional pixel motion estimation can improve the video compression rate at the cost of higher computational complexity. 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 technique. In this paper, we propose a fast fractional pixel search algorithm by combining SASR (Simplified Adaptive Search Range) and the CBCDS (Center Biased Cross-Diamond Search) pattern with the predicted motion vector. Compare with the fractional pel full search and the CBFPS, the proposed CBCDS algorithms can reduce fractional pel search points up to 81.4%, respectively with the PSNR lost about 0.05dB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.19-33
• /
• 2008

A method that is adaptively selecting among previous fast motion estimation algorithms and a newly proposed fast motion estimation algorithm(UCDS) is presented in this paper. The algorithm named AUDC and a newly proposed fast motion estimation algorithms are based on the Diamond Search(DS) algorithm and Three Step Search(TSS). Although many previous fast motion estimation algorithms have lots of advantages, those have lots of disadvantages. So we thought better adaptive selection of fast motion estimation algorithms than only using one fast motion estimation algorithm. Therefore, we propose AUDC that is using length of the MV, Search Point, SAD of the neighboring block and adaptively selecting among Cross Three Step Search(CTSS), Diamond Search(DS) and Ungraded Cross Diamond Search(UCDS). Experimental results show that the AUDC is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching at algorithms.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.49-60
• /
• 2010

H.264/AVC offers a better encoding efficiency than conventional video standards by adopting many new encoding techniques. However, the advanced coding techniques also add to the overall complexity for H.264/AVC encoder. Accordingly, it is necessary to perform optimization to alleviate the level of complexity for the video encoder. The amount of computation for motion estimation is of particular importance. In this paper, we propose a diamond web-grid search algorithm combined with efficient stationary block skip method which employs full diamond and dodecagon search patterns, and the variable thresholds are used for performing an effective skip of stationary blocks. The experimental results indicate that the proposed technique reduces the computations of the unsymmetrical-cross multi-hexagon-grid search algorithm by up to 12% while maintaining a similar PSNR performance.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.43-46
• /
• 2000

In this paper, we propose a fast adaptive diamond search algorithm(FADS) for block matching motion estimation. Fast motion estimation algorithms reduce the computational complexity by using the UESA (Unimodal Error Search Assumption) that the matching error monotonically increases as the search moves away from the global minimum error. Recently many fast BMAs(Block Matching Algorithms) make use of the fact that the global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the adjacent blocks. We change the origin of search window according to the spatially adjacent motion vectors and their MAE(Mean Absolute Error). The computer simulation shows that the proposed algorithm has almost the same computational complexity with UCBDS(Unrestricted Center-Biased Diamond Search)〔1〕, but enhance PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS(Full Search), even for the large motion case, with half the computational load.