• Title/Summary/Keyword: 비용함수H.263

Search Result 1, Processing Time 0.017 seconds

An Improved Three Step Search Algorithm for the Motion Match Blocks in H.263 (H.263에서 움직임 정합 블록을 위한 개선된 3단계 탐색 알고리즘)

  • Sim, Jong-Chae;Park, Yeong-Mok;Seong, Yun-Ju;Seong, Yun-Ju;Yoo, Kyeong-Jong;Park, Jae-Hong
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.86-96
    • /
    • 2002
  • In video conferencing system using H.263 encoding and decoding time is as important as compression rate is. To reduce encoding time, a number of methods were proposed. We use a method of them that reduces the computational complexity in motion estimation. The complexity is determined by three factors, such as a cost function, a search range parameter, and a motion search algorithm. In fact, it takes a lot of time to encode the video data on account of the cost function factor. That's the reason that we use the factor to reduce encoding time. In this paper, we tried to reduce total encoding time by reducing the number of calling the cost function. In case of a little moving, our algorithm enabled faster motion searching than TSS(Three Step Search) and NTSS(New TSS). Here, we called the algorithm by an ITSS(Improved TSS) that improves a shortcoming of NTSS requiring more checkpoints than TSS. For an experimentation, our algorithm was compared to other algorithms using PSNR, file size and SAD call times.