基于fpga的视频编码运动估计SIFT结构

Narasak Boonthep, K. Chamnongthai, Pranithan Phensadsaeng
{"title":"基于fpga的视频编码运动估计SIFT结构","authors":"Narasak Boonthep, K. Chamnongthai, Pranithan Phensadsaeng","doi":"10.1109/GWS.2018.8686403","DOIUrl":null,"url":null,"abstract":"In multi-view video coding (MVC), inter-view and temporal redundancies worsen coding efficiency and video quality, and they are needed to eliminate. Motion Estimation (ME) is a key factor for high quality video coding to reducing complexity. This paper proposes a parallel hardware architecture for computing ME by using scale-invariant feature transform (SIFT). It has advantages over many other algorithms because features that detected are fully invariant to image scaling and rotation. This paper applies Fast Fourier Transform (FFT) to reduce the complexity in SIFT algorithm. SIFT feature is used to matching corresponding point to find the search range. The experimental results shown that the hardware architecture for SIFT algorithm realized fast feature extraction, and reduces the computational load and memory.","PeriodicalId":256742,"journal":{"name":"2018 Global Wireless Summit (GWS)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A FPGA-Based SIFT Architecture for Motion Estimation in Video Coding\",\"authors\":\"Narasak Boonthep, K. Chamnongthai, Pranithan Phensadsaeng\",\"doi\":\"10.1109/GWS.2018.8686403\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In multi-view video coding (MVC), inter-view and temporal redundancies worsen coding efficiency and video quality, and they are needed to eliminate. Motion Estimation (ME) is a key factor for high quality video coding to reducing complexity. This paper proposes a parallel hardware architecture for computing ME by using scale-invariant feature transform (SIFT). It has advantages over many other algorithms because features that detected are fully invariant to image scaling and rotation. This paper applies Fast Fourier Transform (FFT) to reduce the complexity in SIFT algorithm. SIFT feature is used to matching corresponding point to find the search range. The experimental results shown that the hardware architecture for SIFT algorithm realized fast feature extraction, and reduces the computational load and memory.\",\"PeriodicalId\":256742,\"journal\":{\"name\":\"2018 Global Wireless Summit (GWS)\",\"volume\":\"144 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Global Wireless Summit (GWS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GWS.2018.8686403\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Global Wireless Summit (GWS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GWS.2018.8686403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在多视点视频编码(MVC)中,视点间冗余和时间冗余会降低编码效率和视频质量,需要消除。运动估计是降低视频编码复杂度的关键因素。本文提出了一种利用尺度不变特征变换(SIFT)计算ME的并行硬件架构。与许多其他算法相比,它具有优势,因为检测到的特征对图像缩放和旋转是完全不变的。本文采用快速傅里叶变换(FFT)来降低SIFT算法的复杂度。利用SIFT特征对对应点进行匹配,找到搜索范围。实验结果表明,SIFT算法的硬件架构实现了快速特征提取,减少了计算量和内存。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A FPGA-Based SIFT Architecture for Motion Estimation in Video Coding
In multi-view video coding (MVC), inter-view and temporal redundancies worsen coding efficiency and video quality, and they are needed to eliminate. Motion Estimation (ME) is a key factor for high quality video coding to reducing complexity. This paper proposes a parallel hardware architecture for computing ME by using scale-invariant feature transform (SIFT). It has advantages over many other algorithms because features that detected are fully invariant to image scaling and rotation. This paper applies Fast Fourier Transform (FFT) to reduce the complexity in SIFT algorithm. SIFT feature is used to matching corresponding point to find the search range. The experimental results shown that the hardware architecture for SIFT algorithm realized fast feature extraction, and reduces the computational load and memory.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信