SDCN2: A Shallow Densely connected CNN for multi-purpose image manipulation detection

Gurinder Singh, Puneet Goyal
2022 ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)  
The digital image information can be easily tampered to harm the integrity of someone. Thus, recognizing the truthfulness and processing history of an image is one of the essential concerns in multimedia forensics. Numerous forensic methods have been developed by researchers with the ability to detect targeted editing operations. But, creating a unified forensic approach capable of detecting multiple image manipulations is still a challenging problem. In this paper, a new general-purpose
more » ... c approach is designed based on a shallow densely connected CNN (SDCN2) that exploits local dense connections and global residual learning. The residual domain is considered in the proposed network rather than the spatial domain to analyze the image manipulation artifacts because the residual domain is less dependent on image content information. To attain this purpose, a residual convolutional layer is employed at the beginning of the proposed model to adaptively learn the image manipulation features by suppressing the image content information. Then, the obtained image residuals or prediction error features are further processed by the shallow densely connected CNN for high-level feature extraction. Also, the hierarchical features produced by the densely connected blocks (DCBs) and prediction error features are fused globally for better information flow across the network. The extensive experiment results show that the proposed scheme outperforms the existing state-of-the-art general-purpose forensic schemes even under anti-forensic attacks, when tested on large scale datasets. The proposed model offers overall detection accuracies of 98.34% and 99.22% for BOSSBase and Dresden datasets, respectively for multiple image manipulation detection. Moreover, the proposed network is highly efficient in terms of computational complexity as compared to the existing approaches.
doi:10.1145/3510462 fatcat:7nlndu7wcfaell2pc2gopkutve