Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsai, Jang-Jeren_US
dc.contributor.authorHang, Hsueh-Mingen_US
dc.date.accessioned2014-12-08T15:09:35Z-
dc.date.available2014-12-08T15:09:35Z-
dc.date.issued2007en_US
dc.identifier.isbn978-1-4244-0920-4en_US
dc.identifier.issn0271-4302en_US
dc.identifier.urihttp://hdl.handle.net/11536/7334-
dc.identifier.urihttp://dx.doi.org/10.1109/ISCAS.2007.378545en_US
dc.description.abstractPattern-based block motion estimation (PBME) is one of the most effective yet computational intensive tools in digital video coding standards. Many PBME algorithms have been proposed but few papers have investigated in depth the fundamental characteristics of various PBME algorithms. Why one search algorithm outperforms the others? In this paper, we propose a systematic approach to examine this problem. The minimal numbers of search points achievable by a PBME algorithm form a discrete function in the search area. We analyze this so-called weighting function and suggest an ideal target. Then, we design a genetic rhombus pattern search (GRPS) to match this ideal weighting function. Simulations show that comparing to the other popular search algorithms, GRPS reduces the average search points for more than 20% while it maintains a similar level of coded image PSNR quality.en_US
dc.language.isoen_USen_US
dc.titleA genetic rhombus pattern search for block motion estimationen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/ISCAS.2007.378545en_US
dc.identifier.journal2007 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11en_US
dc.citation.spage3655en_US
dc.citation.epage3658en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000251608405001-
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000251608405001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.