Article ID Journal Published Year Pages File Type
457846 Digital Investigation 2013 12 Pages PDF
Abstract

Apart from robustness and accuracy of copy–paste image forgery detection, time complexity also plays an important role to evaluate the performance of the system. In this paper, the focus point is to improve time complexity of the block-matching algorithm. Hence, a coarse-to-fine approach is applied to propose an enhanced duplicated region detection model by using sequential block clustering. Clustering minimizes the search space in block matching. This significantly improves time complexity as it eliminates several extra block-comparing operations. We determine time complexity function of the proposed algorithm to measure the performance. The experimental results and mathematical analysis demonstrate that our proposed algorithm has more improvement in time complexity when the block size is small.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Networks and Communications
Authors
, , , ,