Performance Analysis of Block Matching Algorithms for Highly Scalable Video Compression

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI:10.1109/ISAHUC.2006.4290669

D. Babu, P. An, C. Karthikeyan

{"title":"Performance Analysis of Block Matching Algorithms for Highly Scalable Video Compression","authors":"D. Babu, P. An, C. Karthikeyan","doi":"10.1109/ISAHUC.2006.4290669","DOIUrl":null,"url":null,"abstract":"To enable wireless Internet and other data services using mobile appliances, there is a critical need to support content rich cellular data communication, including voice, text, image and video. However, mobile communication of multimedia content has several bottlenecks, including limited bandwidth of cellular networks, channel noise, and battery constraints of the appliances. This paper is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares 7 different types of block matching algorithms such as, exhaustive search, three step search (TSS), new three step search (NTSS), simple and efficient search (SES), four step search (4SS), diamond search (DS), adaptive rood pattern search (ARPS) and conclude the better block estimation algorithm for video compression. The algorithms that are evaluated in this paper are widely accepted by the video compressing community and have been used in implementing various standards. Of the various algorithms studied and simulated ARPS turns out to be the better block matching algorithm for motion estimation.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAHUC.2006.4290669","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

Abstract

To enable wireless Internet and other data services using mobile appliances, there is a critical need to support content rich cellular data communication, including voice, text, image and video. However, mobile communication of multimedia content has several bottlenecks, including limited bandwidth of cellular networks, channel noise, and battery constraints of the appliances. This paper is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares 7 different types of block matching algorithms such as, exhaustive search, three step search (TSS), new three step search (NTSS), simple and efficient search (SES), four step search (4SS), diamond search (DS), adaptive rood pattern search (ARPS) and conclude the better block estimation algorithm for video compression. The algorithms that are evaluated in this paper are widely accepted by the video compressing community and have been used in implementing various standards. Of the various algorithms studied and simulated ARPS turns out to be the better block matching algorithm for motion estimation.

查看原文本刊更多论文

面向高可扩展视频压缩的块匹配算法性能分析

为了使用移动设备实现无线互联网和其他数据服务，迫切需要支持内容丰富的蜂窝数据通信，包括语音、文本、图像和视频。然而，多媒体内容的移动通信有几个瓶颈，包括蜂窝网络的有限带宽、信道噪声和设备的电池限制。本文综述了用于视频压缩中运动估计的块匹配算法。实现并比较了耗尽搜索、三步搜索(TSS)、新三步搜索(NTSS)、简单高效搜索(SES)、四步搜索(4SS)、菱形搜索(DS)、自适应道路模式搜索(ARPS)等7种不同类型的块匹配算法，得出了较好的视频压缩块估计算法。本文评估的算法被视频压缩界广泛接受，并已用于实现各种标准。在研究和仿真的各种算法中，ARPS算法被证明是运动估计中较好的块匹配算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2006 International Symposium on Ad Hoc and Ubiquitous Computing

自引率

0.00%

发文量