CHAPTER 1
INTRODUCTION
1.1 Introduction
To achieve high compression ratio in video coding, a technique known as Block Matching Motion Estimation has been widely adopted in various coding
standards. This technique is implemented conventionally by exhaustively testing all the candidate blocks within the search window. This type of implementation, called
Full Search FS Algorithm, gives the optimum solution. However, substantial amount of computational workload is required in this algorithm. To overcome this
drawback, many fast Block Matching Algorithms BMA‘s have been proposed and developed. Different search patterns and strategies are exploited in these algorithms
in order to find the optimum motion vector with minimal number of required search p
oints. One of these fast BMA‘s, which is proposed to be implemented in this project, is called Diamond Search DS Algorithm.
1.1 Objective
The objective of this project is to implement the DS algorithm in MATLAB
and to compare its performance to FS algorithm as well as to other fast BMAs which are New Three Step Search NTSS, Four Step Search 4SS, Cross Search CS and
Cross Diamond Search CDS.
1.2 Problem Statement
A substantial amount of computational workload is required during the execution of Full Search algorithm; however this drawback can be overcome by
many types of fast BMAs which have been proposed and developed. Different types of search patterns and strategies are exploited in these fast BMAs
‘ algorithms in order to find the optimum motion vector with minimal number of required search
point. However, there is a need to determine which of these fast BMAs perform the best as well as to identify their suitable characteristic when implemented on different
type of video sequences.
1.3 Project Scope
This project will focus on 3 main areas which first include literature review on video coding, BMAs and DS Algorithm. Second is the development and
implementation of DS algorithm using MATLAB platform. Last but not least is the performance analysis of DS algorithm to Full Search FS algorithm and DS algorithm
to other BMAs‘.
1.4 Thesis Structure
Kategori