Scribd
Upload
27 views

Video Compression Introduction

Three step search &Ftss

Uploaded by

singarayyaswamy
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
27 views

Video Compression Introduction

Three step search &Ftss

Uploaded by

singarayyaswamy
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
The passage you've provided explains the principles behind two motion estimation algorithms used in video compression: the Three ‘Step Search (155) algorithm and the Fast Three Step Search (FTSS) algorithm. These algorithms are particularly relevant in contexts where reducing computational complexity is crucial, such as in low bit-rate video applications (e.g, videophone and video conferencing), Here's a breakdown of the key points: Three Step Search (TSS) Algorithm: 1 Purpose: TSS is designed to find the best motion vector for a block of video data in a more computationally efficient manner thar exhaustive search methods 2. Process: © Step 1 Evaluate nine sparsely located candidate motion vectors around the current block and select the one with the minimurr Sum of Absolute Differences (SAD). SAD is a measure used to quantify the difference between the current block and the candidate alock © Step 2: Focus the search around the winning candidate from Step 1, but with the distances between candidate locations halved ‘Again, select the candidate with the minimum SAD. © Step 3:Ferform a final comparison of SAD for nine locations around the winner from Step 2 to determine the final motion vector 3. Efficiency: By using this hierarchical, coarse-to-fine approach, TSS significantly reduces the number of locations that need to be searched, For a common search range (eg, (41 = d2 = 7), the number of search locations is reduced to 1/Sth of what would be required in an exhaustive search Fast Three Step Search (FTSS) Algorithm: 1. Enhancements over TSS: FTSS builds on the TSS algorithm by incorporating directional information from adjacent, previously determined motion vectors and leveraging the unimodal error surface assumption (UESA). 2. Directional Information: FTSS uses the direction of the previous motion vector to guide the search for the current motion vector, potentially reducing the number of candidates that need to be evaluated 3, Unimodal Error Surface Assumption (UESA): This assumption posits that the error {measured as SAD) increases monotonically as fone moves away from the global minimum. By relying on this assumption, FTSS can more efficiently narrow down the search for the ‘optimal motion vector. Summary: Both TSS and FTSS algorithms aim to optimize the motion estimation process in video compression by reducing computational complexity. 155 does this through a systematic reduction of candidate locations, while FTSS further refines this approach by using directional cues and the UESA to more quickly converge on the optimal motion vector. These methods are particularly useful in applications where computational resources are limited, and fast, efficient processing is necessary

You might also like