Mohamed Ghoniem, A. Haggag, Yuzhen Li, Jianming Lu, T. Yahagi, Sekiya Lab
{"title":"视频编码中的自适应运动估计块匹配算法","authors":"Mohamed Ghoniem, A. Haggag, Yuzhen Li, Jianming Lu, T. Yahagi, Sekiya Lab","doi":"10.1109/ISPACS.2006.364690","DOIUrl":null,"url":null,"abstract":"In most block-based video coding systems, the fast block matching algorithms (BMAs) use the origin as the initial search center, which may not track the motion very well. To improve the accuracy of the fast BMAs, a new adaptive motion tracking search algorithm is proposed in this paper. Based on the spatial correlation of motion blocks, a predicted starting search point, which reflects the motion trend of the current block, is adaptively chosen. It does not have the problem of being trapped by local minimum, and is characterized by finding the majority motion vector in one step. When compared with six other block-based search algorithms including the full-search and three-step-search, the new algorithm has an average PSNR very close to that of full search, yet an average search time faster than the three step-search","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Adaptive Motion Estimation Block Matching Algorithms for Video Coding\",\"authors\":\"Mohamed Ghoniem, A. Haggag, Yuzhen Li, Jianming Lu, T. Yahagi, Sekiya Lab\",\"doi\":\"10.1109/ISPACS.2006.364690\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In most block-based video coding systems, the fast block matching algorithms (BMAs) use the origin as the initial search center, which may not track the motion very well. To improve the accuracy of the fast BMAs, a new adaptive motion tracking search algorithm is proposed in this paper. Based on the spatial correlation of motion blocks, a predicted starting search point, which reflects the motion trend of the current block, is adaptively chosen. It does not have the problem of being trapped by local minimum, and is characterized by finding the majority motion vector in one step. When compared with six other block-based search algorithms including the full-search and three-step-search, the new algorithm has an average PSNR very close to that of full search, yet an average search time faster than the three step-search\",\"PeriodicalId\":178644,\"journal\":{\"name\":\"2006 International Symposium on Intelligent Signal Processing and Communications\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Symposium on Intelligent Signal Processing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPACS.2006.364690\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Symposium on Intelligent Signal Processing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS.2006.364690","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Adaptive Motion Estimation Block Matching Algorithms for Video Coding
In most block-based video coding systems, the fast block matching algorithms (BMAs) use the origin as the initial search center, which may not track the motion very well. To improve the accuracy of the fast BMAs, a new adaptive motion tracking search algorithm is proposed in this paper. Based on the spatial correlation of motion blocks, a predicted starting search point, which reflects the motion trend of the current block, is adaptively chosen. It does not have the problem of being trapped by local minimum, and is characterized by finding the majority motion vector in one step. When compared with six other block-based search algorithms including the full-search and three-step-search, the new algorithm has an average PSNR very close to that of full search, yet an average search time faster than the three step-search