Volume 70, Issue 4 pp. 1359-1374
ORIGINAL PAPER

Frame duplication forgery detection and localization based on QR decomposition and Minkowski distance

Khaled Loukhaoukha PhD

Corresponding Author

Khaled Loukhaoukha PhD

École Supérieure de la Gendarmerie Nationale, Zéralda, Algeria

Development Research Center, Algiers, Algeria

Correspondence

Khaled Loukhaoukha, École Supérieure de la Gendarmerie Nationale, Zéralda, Algeria.

Email: [email protected] and [email protected]

Search for more papers by this author
First published: 13 May 2025

Abstract

The widespread use of multimedia editing tools has facilitated the creation of realistic video forgeries, jeopardizing the trust in video content. To address frame duplication forgery, a prevalent technique, this paper introduces a novel algorithm leveraging QR decomposition (orthogonal-triangular decomposition) and Minkowski distance. The algorithm extracts frame features using QR decomposition and compares them with a reference frame using Minkowski distance. Candidate duplicates are identified through random block matching. We evaluate the proposed method on standard datasets (TDTVD, LASIESTA, and IVY LAB) and a self-generated dataset. Our method achieves exceptional performance, attaining a perfect F 1 -score for video-level detection on both the TDTVD and our self-generated datasets. Notably, for frame-level detection, it achieves an average accuracy of 0.9943, precision of 0.9752, recall of 0.9858, and F 1 -score of 0.9803 across all datasets. Our analysis demonstrates the proposed method demonstrates promising performance in detecting multiply-duplicated frames and shows robustness against post-processing, potentially outperforming existing approaches.

CONFLICT OF INTEREST STATEMENT

The authors declare that they have no conflict of interest.

DATA AVAILABILITY STATEMENT

This article's findings rely on data owned by the Development Research Center. Due to confidentiality restrictions, the data is not publicly accessible and the authors cannot share it publicly at this time.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.