scholarly journals Nonoverlapping Blocks Based Copy-Move Forgery Detection

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Yu Sun ◽  
Rongrong Ni ◽  
Yao Zhao

In order to solve the problem of high computational complexity in block-based methods for copy-move forgery detection, we divide image into texture part and smooth part to deal with them separately. Keypoints are extracted and matched in texture regions. Instead of using all the overlapping blocks, we use nonoverlapping blocks as candidates in smooth regions. Clustering blocks with similar color into a group can be regarded as a preprocessing operation. To avoid mismatching due to misalignment, we update candidate blocks by registration before projecting them into hash space. In this way, we can reduce computational complexity and improve the accuracy of matching at the same time. Experimental results show that the proposed method achieves better performance via comparing with the state-of-the-art copy-move forgery detection algorithms and exhibits robustness against JPEG compression, rotation, and scaling.

2012 ◽  
Vol 4 (3) ◽  
pp. 20-32 ◽  
Author(s):  
Yongjian Hu ◽  
Chang-Tsun Li ◽  
Yufei Wang ◽  
Bei-bei Liu

Frame duplication is a common way of digital video forgeries. State-of-the-art approaches of duplication detection usually suffer from heavy computational load. In this paper, the authors propose a new algorithm to detect duplicated frames based on video sub-sequence fingerprints. The fingerprints employed are extracted from the DCT coefficients of the temporally informative representative images (TIRIs) of the sub-sequences. Compared with other similar algorithms, this study focuses on improving fingerprints representing video sub-sequences and introducing a simple metric for the matching of video sub-sequences. Experimental results show that the proposed algorithm overall outperforms three related duplication forgery detection algorithms in terms of computational efficiency, detection accuracy and robustness against common video operations like compression and brightness change.


Due to easy availability of image editing software applications, many of the digital images are tempered, either to hide some important facts of the image or just to enhance the image. Hence, the integrity of the image is compromised. Thus, in order to preserve the authenticity of an image, it is necessary to develop some algorithms to detect counterfeit parts of an image, if there is any. Two kinds of classic methods exist for the detection of forgery: the key- point based method in which major key points of the image is found and forged part is detected and the block based method that locates the forged part by sectioning the whole image into blocks. Unlike these two classic methods that require multiple stages, our proposed CNN solution provides better image forgery detection. Our experimental results revealed a better forgery detection performance than any other classic approaches.


CONVERTER ◽  
2021 ◽  
pp. 745-755
Author(s):  
Peng Liang, Et al.

Block-based image copy-move detection algorithms disregard the spatial layout of the features, leading to the poor detection performance under small-region tampering samples. Therefore, we propose a pyramid correlation network (PCNet) for copy-move forgery detection, whose goal is to obtain rich and detailed image representation via a pyramid cascaded correlation architecture. Experimental results show that PCNet outperforms the comparison algorithm on USCISI, CASIA and CoMoFoD data sets. Compared to the benchmark model BusterNet, F1 scores of PCNet has increased by 33.84% and 30.62% on CASIA CMFD dataset and CoMoFoD dataset respectively.


2021 ◽  
Vol 23 (08) ◽  
pp. 457-461
Author(s):  
Sudhakar K ◽  
◽  
Dr.Subhash Kulkarni ◽  

This paper presents the performance evaluation of various distance metric in copy move forger detection algorithms. The choice of distance metric affects the detection speed. The proposed approach is tested over 9 different distance metrics. The experimental results found indicate the choice of distance metric has a considerable impact on forgery detection speed.


2017 ◽  
Vol 77 (12) ◽  
pp. 15111-15111
Author(s):  
Yuecong Lai ◽  
Tianqiang Huang ◽  
Jing Lin ◽  
Henan Lu

2021 ◽  
Vol 11 (23) ◽  
pp. 11344
Author(s):  
Wei Ke ◽  
Ka-Hou Chan

Paragraph-based datasets are hard to analyze by a simple RNN, because a long sequence always contains lengthy problems of long-term dependencies. In this work, we propose a Multilayer Content-Adaptive Recurrent Unit (CARU) network for paragraph information extraction. In addition, we present a type of CNN-based model as an extractor to explore and capture useful features in the hidden state, which represent the content of the entire paragraph. In particular, we introduce the Chebyshev pooling to connect to the end of the CNN-based extractor instead of using the maximum pooling. This can project the features into a probability distribution so as to provide an interpretable evaluation for the final analysis. Experimental results demonstrate the superiority of the proposed approach, being compared to the state-of-the-art models.


2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Jiaxi Ye ◽  
Ruilin Li ◽  
Bin Zhang

Directed fuzzing is a practical technique, which concentrates its testing energy on the process toward the target code areas, while costing little on other unconcerned components. It is a promising way to make better use of available resources, especially in testing large-scale programs. However, by observing the state-of-the-art-directed fuzzing engine (AFLGo), we argue that there are two universal limitations, the balance problem between the exploration and the exploitation and the blindness in mutation toward the target code areas. In this paper, we present a new prototype RDFuzz to address these two limitations. In RDFuzz, we first introduce the frequency-guided strategy in the exploration and improve its accuracy by adopting the branch-level instead of the path-level frequency. Then, we introduce the input-distance-based evaluation strategy in the exploitation stage and present an optimized mutation to distinguish and protect the distance sensitive input content. Moreover, an intertwined testing schedule is leveraged to perform the exploration and exploitation in turn. We test RDFuzz on 7 benchmarks, and the experimental results demonstrate that RDFuzz is skilled at driving the program toward the target code areas, and it is not easily stuck by the balance problem of the exploration and the exploitation.


2020 ◽  
Vol 10 (8) ◽  
pp. 2864 ◽  
Author(s):  
Muhammad Asad ◽  
Ahmed Moustafa ◽  
Takayuki Ito

Artificial Intelligence (AI) has been applied to solve various challenges of real-world problems in recent years. However, the emergence of new AI technologies has brought several problems, especially with regard to communication efficiency, security threats and privacy violations. Towards this end, Federated Learning (FL) has received widespread attention due to its ability to facilitate the collaborative training of local learning models without compromising the privacy of data. However, recent studies have shown that FL still consumes considerable amounts of communication resources. These communication resources are vital for updating the learning models. In addition, the privacy of data could still be compromised once sharing the parameters of the local learning models in order to update the global model. Towards this end, we propose a new approach, namely, Federated Optimisation (FedOpt) in order to promote communication efficiency and privacy preservation in FL. In order to implement FedOpt, we design a novel compression algorithm, namely, Sparse Compression Algorithm (SCA) for efficient communication, and then integrate the additively homomorphic encryption with differential privacy to prevent data from being leaked. Thus, the proposed FedOpt smoothly trade-offs communication efficiency and privacy preservation in order to adopt the learning task. The experimental results demonstrate that FedOpt outperforms the state-of-the-art FL approaches. In particular, we consider three different evaluation criteria; model accuracy, communication efficiency and computation overhead. Then, we compare the proposed FedOpt with the baseline configurations and the state-of-the-art approaches, i.e., Federated Averaging (FedAvg) and the paillier-encryption based privacy-preserving deep learning (PPDL) on all these three evaluation criteria. The experimental results show that FedOpt is able to converge within fewer training epochs and a smaller privacy budget.


Physics ◽  
2020 ◽  
Vol 2 (1) ◽  
pp. 49-66 ◽  
Author(s):  
Vyacheslav I. Yukalov

The article presents the state of the art and reviews the literature on the long-standing problem of the possibility for a sample to be at the same time solid and superfluid. Theoretical models, numerical simulations, and experimental results are discussed.


Sign in / Sign up

Export Citation Format

Share Document