A video forgery detection algorithm based on compressive sensing

Video processing software is often used to delete moving objects and modify the forged regions with the information provided by the areas around them. However, few algorithms have been suggested for detecting this form of tampering. In this paper, a novel algorithm based on compressive sensing is pr...

Full description

Saved in:
Bibliographic Details
Published inMultimedia tools and applications Vol. 74; no. 17; pp. 6641 - 6656
Main Authors Su, Lichao, Huang, Tianqiang, Yang, Jianmei
Format Journal Article
LanguageEnglish
Published New York Springer US 01.09.2015
Springer Nature B.V
Subjects
Algorithms
Analysis
Computer Communication Networks
Computer programs
Computer Science
Data Structures and Information Theory
Detection
Digital video
Forensic sciences
Forgery
Forges
Multimedia
Multimedia Information Systems
Noise
Projection
Remote sensing
Robustness
Signal processing
Software
Special Purpose and Application-Based Systems
Studies
Video compression
K-SVD
Compressive Sensing
Video Forgery
Passive Forensics
Online AccessGet full text

Cover

More Information
Summary:Video processing software is often used to delete moving objects and modify the forged regions with the information provided by the areas around them. However, few algorithms have been suggested for detecting this form of tampering. In this paper, a novel algorithm based on compressive sensing is proposed for the detection in which the moving foreground was removed from background. Firstly, the features of the difference between frames are obtained through K-SVD (k-Singular Value Decomposition), and then random projection is used to project the features into the lower-dimensional subspace which is clustered by k-means, and finally the detection results are combined to output. The experimental results show that our algorithm has higher detection accuracy and better robustness than that of the previous algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-014-1915-4