Image Hash Minimization for Tamper Detection

Tamper detection using image hash is a very common problem of modern days. Several research and advancements have already been done to address this problem. However, most of the existing methods lack the accuracy of tamper detection when the tampered area is low, as well as requiring long image hashes. In this paper, we propose a novel method objectively to minimize the hash length while enhancing the performance at low tampered area.Comment: Published at the 9th International Conference on Advances in Pattern Recognition, 201

Identification of Sparse Audio Tampering Using Distributed Source Coding and Compressive Sensing Techniques

In the past few years, a large amount of techniques have been proposed to identify whether a multimedia content has been illegally tampered or not. Nevertheless, very few efforts have been devoted to identifying which kind of attack has been carried out, especially due to the large data required for this task. We propose a novel hashing scheme which exploits the paradigms of compressive sensing and distributed source coding to generate a compact hash signature, and we apply it to the case of audio content protection. The audio content provider produces a small hash signature by computing a limited number of random projections of a perceptual, time-frequency representation of the original audio stream; the audio hash is given by the syndrome bits of an LDPC code applied to the projections. At the content user side, the hash is decoded using distributed source coding tools. If the tampering is sparsifiable or compressible in some orthonormal basis or redundant dictionary, it is possible to identify the time-frequency position of the attack, with a hash size as small as 200 bits/second; the bit saving obtained by introducing distributed source coding ranges between 20% to 70%

ROI–Based Tamper Detection And Recovery For Medical Images Using Reversible Watermarking Technique.

Digital image watermarking is proposed to overcome the problems of security, capacity and cost in health care management systems

Survey on relational database watermarking techniques

Digital watermarking has been in multimedia data use over the past years. Recently it has become applicable in relational database system not only to secure copyright ownership but also to ensure data contents integrity. Further, it is used in locating tampered and modified places. However, the watermarking relational database has its own requirements, challenges, attacks and limitations. This paper, surveys recent database watermarking techniques focusing on the importance of watermarking relational database, the difference between watermarking relational database and multimedia objects, the issues in watermarking relational database, type of attacks on watermarked database, classifications, distortion introduced and the embedded information. The comparative study shows that watermarking relational database can be an effective tool for copyright protection, tampered detection, and hacker tracing while maintaining the integrity of data contents. In addition, this study explores the current issues in watermarking relational database as well as the significant differences between watermarking multimedia data and relational database contents. Finally, it provides a classification of database watermarking techniques according to the way of selecting the candidate key attributes and tuples, distortion introduced and decoding methods used

An improved discrete cosine transformation block based scheme for copy-move image forgery detection

Copy-moved forgery is a common method to manipulate images. Several attempts of image forgery have been discovered and involves a region been duplicated and copied and pasted on another region of the same image in other to achieve selfish gain. Generally, there are two classification of copy-move forgery detection technique such as the block-based and key point-based. The block-based division is mostly used and divides image into blocks during the stage of image pre-processing before features are extracted, whereas key-point based technique skips the division of image into blocks and directly extracts different local feature from the image. In this paper, we review various block based and key point approach which has been proposed by various researchers. There is a problem of achieving a balance between improving the detection accuracy and having minimal computational complexity. The proposed technique is based on an improved DCT based copy-move image forgery detection (IDB-CFD), which involves using an octagonal block to reduce the number of features for matching, thereby improving detection accuracy while having minimal complexity. The analysis of this work as compared to previous proposed works which is based on a robust detection algorithm for copy-move image forgery (RDA-CF) and involves using circle block to reduce the number of features, results show that previous work represents about 79% of the quantized DCT coefficients on each image block and this proposed work represents about 85% of quantized DCT coefficients, therefore, recovery of about 6% more features using the IDB-CFD technique was observed as the improvement over the previously proposed RDA-CF

Image authentication using LBP-based perceptual image hashing

Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for perceptual image hashing. In feature extraction, we propose to use both sign and magnitude information of local differences. So, the algorithm utilizes a combination of gradient-based and LBP-based descriptors for feature extraction. To provide security needs, two secret keys are incorporated in feature extraction and hash generation steps. Performance of the proposed hashing method is evaluated with an important application in perceptual image hashing scheme: image authentication. Experiments are conducted to show that the present method has acceptable robustness against perceptual content-preserving manipulations. Moreover, the proposed method has this capability to localize the tampering area, which is not possible in all hashing schemes