Copy-Move Detection Algorithm Efficiency Increase Using Binary Space Partitioning Trees

Abstract

Abstract.Duplicates embedding is one of the most frequently used type of digital image change. The copy-move procedure includes copying an image fragment from one part and pasting it to another part of the same image. Moreover, this fragment can be changed using some transformations, like affine or contrast enhancement. Existing copy-move detection methods consist of two main steps: feature calculation in overlapping processing windows and the nearest feature search in Euclidean space using lexicographic sorting or kd-tree search. In this paper we suggest to use binary space partitioning trees on the second step of the detection algorithm -vp-tree (vantage-point tree). We present the search speed comparison using vp-tree and kd-tree. The results show advantage of the proposed solution over kd-tree use.Keywords: duplicate, copy-move, forgery, kd-tree, vp-tree, binary space partitioning tree Citation: Kuznetsov A, Myasnikov E. Copy-move detection algorithm efficiency increase using binary space partitioning trees.

A New Anonymization Model for Privacy Preserving Data Publishing: CANON

“…In the literature, there are some works comparing KD-tree and VP-tree [46,49,[56][57][58]. Based on the results of these works, it can be seen that VP-tree data structure is more successful than KD-tree.…”