| Summary: | 碩士 === 國立成功大學 === 電機工程學系碩博士班 === 93 === Multimedia communication relies on data compression technologies to reduce the data bytes of transmission and enhance the speed of transmission. Motion estimation is vital to many motion-compensated video-coding techniques/standards, such as ISO MPEG-1/2/4 and ITU-T H.261/262/263/264。In block motion estimation, a search pattern with a different shape and size has a very important impact on performance of motion estimation. The performance indicates that the speed of finding out motion vectors and the visual quality of predicted results. In recent years, many computationally efficient fast search algorithm were developed, among which are typically the three-step search (3SS) in 1994, the new diamond search (DS) in 2000, the hexagon-based Search (HEXBS) in 2002, and the efficient three-step search (E3SS) in 2004. Here we propose a pair of simple, robust and efficient fast block matching motion estimation algorithms, called double-layered initial search patterns (DLISP). Simulation experiments demonstrate that the proposed DLISP algorithm greatly outperforms the well-known hexagon-based Search (HEXBS) algorithm and achieves similar MSE performance compared to efficient three-step search (E3SS) while reducing its computation by up to 22% approximately. Compared with other recently proposed block-matching algorithms, the proposed DLISP algorithms works better on average in terms of MSE values, reconstructed image quality, and average number of search points.
|
|---|
