Residential Collegefalse
Status已發表Published
SIFT Keypoint Removal via Directed Graph Construction for Color Images
Yuanman Li1; Jiantao Zhou1; An Cheng2
2017-07-21
Source PublicationIEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
ISSN1556-6013
Volume12Issue:12Pages:2971-2985
Abstract

As one of the most successful feature extraction algorithms, scale invariant feature transform( SIFT) has been widely employed in many applications. Recently, the security of SIFT against malicious attack has been attracting increasing attention, and several techniques have been devised to remove SIFT keypoints intentionally. However, most of the existing methods still suffer from the following three problems: 1) the keypoint removal rate achieved by many techniques is unsatisfactory when removing keypoints within multiple octaves; 2) noticeable artifacts are introduced in the processed image, especially in those highly textured regions; and 3) the color information is totally neglected, precluding the widespread adoption of those methods. To tackle these challenges, in this paper, we propose a novel SIFT keypoint removal framework. By modeling the difference of Gaussian space as a directed weighted graph, we derive a set of strict inequality constraints to remove a SIFT keypoint along a pre-constructed acyclic path. To minimize the incurred distortion, the path is strategically designed over the directed graph. Furthermore, we propose a simple yet effective optimization framework for recovering the color information of the keypoint-removed image. Extensive experiments are provided to show the superior performance of our proposed scheme over the state-of-the-art techniques, in both the scenarios of removing keypoints in a single octave and in multiple octaves.

KeywordSift Keypoint Removal Directed Graph Convex Optimization
DOI10.1109/TIFS.2017.2730362
URLView the original
Indexed BySCIE
Language英語English
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Theory & Methods ; Engineering, Electrical & Electronic
WOS IDWOS:000409037000011
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
The Source to ArticleWOS
Scopus ID2-s2.0-85028864731
Fulltext Access
Citation statistics
Document TypeJournal article
CollectionDEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Faculty of Science and Technology
Affiliation1.Department of Computer and Information Science, Faculty of Science and Technology, University of Macau, Macau, China
2.Meitu, Inc., Xiamen, China
First Author AffilicationFaculty of Science and Technology
Recommended Citation
GB/T 7714
Yuanman Li,Jiantao Zhou,An Cheng. SIFT Keypoint Removal via Directed Graph Construction for Color Images[J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2017, 12(12), 2971-2985.
APA Yuanman Li., Jiantao Zhou., & An Cheng (2017). SIFT Keypoint Removal via Directed Graph Construction for Color Images. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 12(12), 2971-2985.
MLA Yuanman Li,et al."SIFT Keypoint Removal via Directed Graph Construction for Color Images".IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 12.12(2017):2971-2985.
Files in This Item: Download All
File Name/Size Publications Version Access License
SIFT_Keypoint_Remova(4469KB)期刊论文作者接受稿开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yuanman Li]'s Articles
[Jiantao Zhou]'s Articles
[An Cheng]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yuanman Li]'s Articles
[Jiantao Zhou]'s Articles
[An Cheng]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yuanman Li]'s Articles
[Jiantao Zhou]'s Articles
[An Cheng]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: SIFT_Keypoint_Removal_via_Directed_Graph_Construction_for_Color_Images.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.