T. Sappasitwong, S. Aramvith, S. Jitapunkul, A. Tamtrakarn, P. Kitti-punyangam, H. Kortrakulkij
{"title":"Adaptive asymmetric diamond search algorithm for block-based motion estimation","authors":"T. Sappasitwong, S. Aramvith, S. Jitapunkul, A. Tamtrakarn, P. Kitti-punyangam, H. Kortrakulkij","doi":"10.1109/ICDSP.2002.1028152","DOIUrl":null,"url":null,"abstract":"We present an adaptive asymmetric diamond search (AADS) for block based motion estimation. The proposed method exploits an adaptive search pattern based on the predicted motion vector. In addition, the accuracy of the prediction is improved by changing the initial search center position. Simulation results show that the proposed algorithm can reduce the number of search points by up to about 50% compared to the regular diamond search while keeping the picture quality similar to other fast search algorithms.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"200 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2002.1028152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
We present an adaptive asymmetric diamond search (AADS) for block based motion estimation. The proposed method exploits an adaptive search pattern based on the predicted motion vector. In addition, the accuracy of the prediction is improved by changing the initial search center position. Simulation results show that the proposed algorithm can reduce the number of search points by up to about 50% compared to the regular diamond search while keeping the picture quality similar to other fast search algorithms.