• Title/Summary/Keyword: Cross-center-biased property

Search Result 2, Processing Time 0.016 seconds

A Cross-Diamond-Triangle Search Algorithm for Fast Block-Matching Motion Estimation (고속 블록 정합 움직임 측정을 위한 십자-다이아몬드-삼각 탐색 알고리즘)

  • Kim, Seong-Hoon;Shin, Jae-Min;Oh, Seoung-Jun;Ahn, Chang-Beom;Park, Ho-Chong;Sim, Dong-Gyu
    • 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.

HDS Method for Fast Searching of Motion Vector (움직임 벡터의 빠른 추정을 위한 HDS기법)

  • 김미영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.338-343
    • /
    • 2004
  • In Block Matching Algorithm (BMA), a search pattern has a very important affect on the search time and the output quality. In this paper, we propose the HDS( Half Diamond Search) pattern based on the cross center-biased distribution property of a motion vector. At lust, the 4 points in the above, below, left, and right around the search center is calculated to decide the point of the MBD (Minimum Block Distortion). And an above point of the MBD is checked to calculate the SAD. If the SAD is less than the previous MBD, this process is repeated. Otherwise, the left and right points of MBD are calculated to decide the points that have the MBD between two points. These processes are repeated to the predicted direction for motion estimation. Experiments show that the speedup improvement of the proposed algorithm can be up to 23% while maintaining similar image quality.