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}
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.