A copy-move detection algorithm based on geometric local binary pattern

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An obvious way of digital image forgery is a copy-move attack. It is quite simple to carry out to hide important information in an image. Copy-move process contains three main steps: copy the fragment from one place of an image, transform it by some means and paste to another place of the same image. A lot of papers on development of copy-move detection algorithms exist nowadays though the achieved results are far from perfect, so they are frequently improved. In this paper, it is proposed a new copy-move detection algorithm based on geometric local binary patterns (GLBP). GLBP features are robust to contrast enhancement, additive Gaussian noise, JPEG compression, affine transform. Another advantage of these features is low computational complexity. Conducted experiments compare GLBP-based features with features based on other forms of local binary patterns. The proposed solution showed high precision and recall values during experimental research for wide ranges of transform parameters. Thus, it showed a meaningful improvement in detection accuracy.

Cite

CITATION STYLE

APA

Kuznetsov, A. (2017). A copy-move detection algorithm based on geometric local binary pattern. In Communications in Computer and Information Science (Vol. 766, pp. 73–83). Springer Verlag. https://doi.org/10.1007/978-3-319-67639-5_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free