Scribd
Upload
32 views6 pages

Binary Search-Soni Yora

The binary search algorithm is used for motion estimation. It divides the search window into regions based on evaluating the cost function at the window center, corners, and boundaries. The region corresponding to the point with the smallest cost value undergoes a full search to find the final motion vector. In the best case, the algorithm evaluates the cost at 17 points, and in the worst case it evaluates the cost at 33 points.

Uploaded by

dokeos
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
32 views6 pages

Binary Search-Soni Yora

The binary search algorithm is used for motion estimation. It divides the search window into regions based on evaluating the cost function at the window center, corners, and boundaries. The region corresponding to the point with the smallest cost value undergoes a full search to find the final motion vector. In the best case, the algorithm evaluates the cost at 17 points, and in the worst case it evaluates the cost at 33 points.

Uploaded by

dokeos
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Binary Search Algorithm (CDSA)

Soni Yora
2301181009

1
INDEX

1 Introduction

2 Binary Search Algorithm (BSA)

5
1. Introduction
Binary search this is one of the algorithms that are
very popular for motion estimation & used by MPEG-
Tool. The basic idea behind this algorithm is to divide
the search window into a number of regions and do a
full search only in one of these regions. The cost
function is evaluated on a grid of 9 pixels that include
the centre, the four corners of the search window and
four pels at the boundaries. The search window is
divided into regions based on these points.A full
search is performed in the region corresponding to
the point with the smallest value.

3
2. BSA Outline

4 4/30/2019
Steps

The BDM is evaluated on a grid of 9 pixels, one at


the center, 4 at the boundaries and 4 at the
corners of the searching window. The pixel with
smallest BDM is choosen.
A full search is focused on the area centered at
the pixel of the best match in the first step
providing final motion vector.

5
Complexity
If minimum BDM point is found at the center, corner
and middle of the search window then the number
of checking points required for BSA is 25+9=33 for
the worst case, 8+9=17 for the best case.

6 4/30/2019

You might also like