Implementation Of New Three Step Search Algorithm For Motion Estimation Using MATLAB

Kong , Khee Kien (2010) Implementation Of New Three Step Search Algorithm For Motion Estimation Using MATLAB. Project Report. UTeM, Melaka, Malaysia. (Submitted)

	PDF (24 pages) Implementation_Of_New_Three_Step_Search_Algorithm_For_Motion_Estimation_Using_MATLAB_-_24_pages.pdf - Submitted Version Download (255kB)
	PDF (Full Text) Implementation_Of_New_Three_Step_Search_Algorithm_For_Motion_Estimation_Using_MATLAB_-_Full_Text.pdf - Submitted Version Restricted to Registered users only Download (918kB)

Abstract

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 (BMAs) 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 points. One of these fast BMAs, which is proposed to be implemented in this project, is called New Three Step Search (NTSS) Algorithm. This project requires the algorithm to be implemented in MATLAB and then its performance is compared to FS algorithm as well as to other fast BMAs in terms of the peak signal-to-noise ratio (PSNR), number of required search points and computational complexity.

Actions (login required)

View Item