scispace - formally typeset
Search or ask a question

Motion compensated inter-frame coding for video conferencing

01 Jan 1981-pp 0-0
About: The article was published on 1981-01-01 and is currently open access. It has received 1676 citations till now. The article focuses on the topics: Inter frame & Motion compensation.
Citations
More filters
Journal ArticleDOI
TL;DR: Experimental results show that the proposed diamond search (DS) algorithm is better than the four-step search (4SS) and block-based gradient descent search (BBGDS), in terms of mean-square error performance and required number of search points.
Abstract: Based on the study of motion vector distribution from several commonly used test image sequences, a new diamond search (DS) algorithm for fast block-matching motion estimation (BMME) is proposed in this paper. Simulation results demonstrate that the proposed DS algorithm greatly outperforms the well-known three-step search (TSS) algorithm. Compared with the new three-step search (NTSS) algorithm, the DS algorithm achieves close performance but requires less computation by up to 22% on average. Experimental results also show that the DS algorithm is better than the four-step search (4SS) and block-based gradient descent search (BBGDS), in terms of mean-square error performance and required number of search points.

1,949 citations


Additional excerpts

  • ...search(LOGS) [2], three-step search(TSS) [3], conjugate direction search(CDS) [4],cross search(CS) [5],new three-step search (NTSS) [6], four-step search(4SS) [7],block-based gradient descent search (BBGDS) [8], etc....

    [...]

Journal ArticleDOI
TL;DR: Simulation results show that, as compared to TSS, NTSS is much more robust, produces smaller motion compensation errors, and has a very compatible computational complexity.
Abstract: The three-step search (TSS) algorithm has been widely used as the motion estimation technique in some low bit-rate video compression applications, owing to its simplicity and effectiveness. However, TSS uses a uniformly allocated checking point pattern in its first step, which becomes inefficient for the estimation of small motions. A new three-step search (NTSS) algorithm is proposed in the paper. The features of NTSS are that it employs a center-biased checking point pattern in the first step, which is derived by making the search adaptive to the motion vector distribution, and a halfway-stop technique to reduce the computation cost. Simulation results show that, as compared to TSS, NTSS is much more robust, produces smaller motion compensation errors, and has a very compatible computational complexity. >

1,689 citations

Journal ArticleDOI
TL;DR: Simulation results show that the proposed 4SS performs better than the well-known three- step search and has similar performance to the new three-step search (N3SS) in terms of motion compensation errors.
Abstract: Based on the real world image sequence's characteristic of center-biased motion vector distribution, a new four-step search (4SS) algorithm with center-biased checking point pattern for fast block motion estimation is proposed in this paper. A halfway-stop technique is employed in the new algorithm with searching steps of 2 to 4 and the total number of checking points is varied from 17 to 27. Simulation results show that the proposed 4SS performs better than the well-known three-step search and has similar performance to the new three-step search (N3SS) in terms of motion compensation errors. In addition, the 4SS also reduces the worst-case computational requirement from 33 to 27 search points and the average computational requirement from 21 to 19 search points, as compared with N3SS.

1,619 citations


Cites methods from "Motion compensated inter-frame codi..."

  • ...The speed-up ratio of the BMAs is compared by the average search points required for a motion vector estimation....

    [...]

  • ...Among the proposed BMA’s, the 3SS became the most popular one and it is also recommended by RM8 of H.261 and SM3 of MPEG owing to its simplicity and effectiveness....

    [...]

  • ...As a result many fast BMA’s [5-12] had been developed to alleviate the heavy computations of FS....

    [...]

  • ...Using the motion vector found by FS as the true motion vector, Table 4 shows the probability of finding the true motion vector using different fast BMAs....

    [...]

  • ...For examples the three-step search (3SS) [5], the 2D-logarithm search (LOGS) [6], the conjugate directional search [7,8], the cross-search algorithm [9], and the dynamic search-window adjustment algorithm [10], etc....

    [...]

Journal ArticleDOI
01 Apr 1985
TL;DR: This paper presents a review of the advances in digital coding of video signals during the last four years, and summarizes the first promising results of motion adaptive frame interpolation.
Abstract: This paper presents a review of the advances in digital coding of video signals during the last four years. Displacement estimation algorithms for coding applications are compared first and the relationship between the algorithms is pointed out. The developments in predictive and transform coding are described and discussed with view to broadcast television and video-conferencing applications. One chapter summarizes the first promising results of motion adaptive frame interpolation. Some problems to be solved in the future are pointed out in the conclusions.

895 citations

Journal ArticleDOI
TL;DR: A novel unrestricted center-biased diamond search (UCBDS) algorithm is proposed which is more efficient, effective, and robust than the previous techniques and consistently faster than the other suboptimal block-matching techniques.
Abstract: The widespread use of block-based interframe motion estimation for video sequence compression in both MPEG and H.263 standards is due to its effectiveness and simplicity of implementation. Nevertheless, the high computational complexity of the full-search algorithm has motivated a host of suboptimal but faster search strategies. A popular example is the three-step search (TSS) algorithm. However, its uniformly spaced search pattern is not well matched to most real-world video sequences in which the motion vector distribution is nonuniformly biased toward the zero vector. Such an observation inspired the new three-step search (NTSS) which has a center-biased search pattern and supports a halfway-stop technique. It is faster on average, and gives better motion estimation as compared to the well-known TSS. Later, the four-step search (4SS) algorithm was introduced to reduce the average case from 21 to 19 search points, while maintaining a performance similar to NTSS in terms of motion compensation errors. We propose a novel unrestricted center-biased diamond search (UCBDS) algorithm which is more efficient, effective, and robust than the previous techniques. It has a best case scenario of only 13 search points and an average of 15.5 block matches. This makes UCBDS consistently faster than the other suboptimal block-matching techniques. This paper also compares the above methods in which both the processing speed and the accuracy of motion compensation are tested over a wide range of test video sequences.

680 citations


Cites background from "Motion compensated inter-frame codi..."

  • ...As a result, many computationally efficient variants such as the three-step search (TSS) [7], the...

    [...]

  • ...Among these suboptimal BMA’s, TSS [7] became the most widely used technique mainly because of its faster estimation....

    [...]