S. Acharjee, N. Dey, D. Biswas, P. Das, S. S. Chaudhuri
{"title":"A novel Block Matching Algorithmic Approach with smaller block size for motion vector estimation in video compression","authors":"S. Acharjee, N. Dey, D. Biswas, P. Das, S. S. Chaudhuri","doi":"10.1109/ISDA.2012.6416617","DOIUrl":null,"url":null,"abstract":"The most computationally expensive operation in entire video compression process is Motion Estimation. The challenge is to reduce the computational complexity and time of Exhaustive Search Algorithm without losing too much quality at the output. The proposed work is to implement a novel block matching algorithm for Motion Vector Estimation which performs better than other conventional Block Matching Algorithms such as Three Step Search (TSS), New Three Step Search (NTSS), and Four Step Search (FSS) etc.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2012.6416617","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24
Abstract
The most computationally expensive operation in entire video compression process is Motion Estimation. The challenge is to reduce the computational complexity and time of Exhaustive Search Algorithm without losing too much quality at the output. The proposed work is to implement a novel block matching algorithm for Motion Vector Estimation which performs better than other conventional Block Matching Algorithms such as Three Step Search (TSS), New Three Step Search (NTSS), and Four Step Search (FSS) etc.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
