{"title":"Digital Image Forgery Detection using Graph Fourier Transform","authors":"J. Thayyil, K. Edet Bijoy","doi":"10.1109/ICFCR50903.2020.9249969","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel method using graph based features for detecting copy move forgery done in digital images. For extracting the features of the image patches the graph Fourier transform are used. A graph can represent data in different applications with a generic data structure. A graph different from classical transforms like DCT and DWT in the sense that it can represent signals on irregular and high dimensional domain. A graph can fit to local characteristics through edges for regular signals like images. Graph Fourier transform extracts the frequency interpretation for signals on graph. To reduce the processing time of feature matching patch match algorithm is used which is a fast approximate nearest neighbor search algorithm. The experiments conducted on the GRIP database shows that the proposed method is highly accurate and are robust to rotation and scaling.","PeriodicalId":165947,"journal":{"name":"2020 International Conference on Futuristic Technologies in Control Systems & Renewable Energy (ICFCR)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Futuristic Technologies in Control Systems & Renewable Energy (ICFCR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFCR50903.2020.9249969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper proposes a novel method using graph based features for detecting copy move forgery done in digital images. For extracting the features of the image patches the graph Fourier transform are used. A graph can represent data in different applications with a generic data structure. A graph different from classical transforms like DCT and DWT in the sense that it can represent signals on irregular and high dimensional domain. A graph can fit to local characteristics through edges for regular signals like images. Graph Fourier transform extracts the frequency interpretation for signals on graph. To reduce the processing time of feature matching patch match algorithm is used which is a fast approximate nearest neighbor search algorithm. The experiments conducted on the GRIP database shows that the proposed method is highly accurate and are robust to rotation and scaling.