{"title":"A low power optimal motion search algorithm","authors":"Shih-Chang Hsia, Wei-Chih Hsu, Po-yuan Cheng","doi":"10.1109/TENCON.1999.818373","DOIUrl":null,"url":null,"abstract":"We propose an efficient algorithm using temporal correlation, which employs a lower computational complexity but without sacrificing the accuracy. To achieve this goal, two techniques are employed, one is recursive motion vector estimation, and the other is a hierarchical layer processing for different motion feature. With this approach, we can attain near-global optimization and local optimization. In the final evaluation, the proposed complexity is only 1/2/spl sim/1/5 of full search, but the accuracy is slightly higher than one of full search in the particular range.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.1999.818373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We propose an efficient algorithm using temporal correlation, which employs a lower computational complexity but without sacrificing the accuracy. To achieve this goal, two techniques are employed, one is recursive motion vector estimation, and the other is a hierarchical layer processing for different motion feature. With this approach, we can attain near-global optimization and local optimization. In the final evaluation, the proposed complexity is only 1/2/spl sim/1/5 of full search, but the accuracy is slightly higher than one of full search in the particular range.