Sentence examples for motion search complexity from inspiring English sources

Distributed video coding (DVC) can enable video coding systems to shift motion search complexity from the encoder to the decoder, for which one of the practical constructive frameworks is using coset partition.

As the ACQPPS is a predicted and adaptive multistep algorithm for motion search, the algorithm computational complexity exclusively depends on the object motions contained in the video sequences and scenarios for estimation processing.

It is know that DS has a simple diamond pattern for a very low complexity based motion search.

In addition, there is an increase in the decoder complexity due to the additional motion search task.

However, encoder complexity is caused by the accumulative additions involved in motion search.

Therefore, the complexity of this technique can be reduced by using fast motion search techniques such as a multigrid [27] approach instead of a fixed block size in addition to an N-step [28] search instead of a full search.

where p defines the motion search range.

A fast motion search and mode decision algorithm is proposed in [11] to speed up the motion estimation (ME) stages of the depth coding process, and a fast depth map method is proposed in our previous work [12] based on sharing motion vector and SKIP mode from the texture video to reduce complexity of depth coding.

Furthermore, an efficient search algorithm is derived to reduce the search complexity (search time and computation complexity).

Two main search steps are involved in the motion search: (1) initial search stage; (2) refined search stage.

The framework has been found to be useful in modeling search problems where the cost of backtracking and retracing search paths is important in determining search complexity.