Abstract:
In the paper, we propose two algorithms for undistorted copy-move regions’ (coincident rectangular fragments) detection on digital images. Both algorithms represent pixels’ data as the hash function value, which is built using two different mathematical principles: probability-theoretical and number-theoretical. The comparison of the proposed algorithms, as well as recommendations for their use is also proposed in this paper.