A robust image hashing based on discrete wavelet transform
01 Sep 2017-pp 440-444
TL;DR: Experimental evaluations demonstrate that the proposed scheme is providing the better robustness and security of the proposed framework.
Abstract: In this paper, a robust image hashing framework is proposed using image normalization, discrete wavelet transform and singular value decomposition. The stressed motive of the proposed scheme is to obtain a randomize hash sequence which can be used for image authentication and database search. For this purpose, the image is first normalized followed by hash generation in the wavelet domain utilizing the properties of singular value decomposition (SVD). Experimental evaluations demonstrate that the proposed scheme is providing the better robustness and security.
Citations
More filters
TL;DR: A review and performance analysis of several perceptual hashing algorithms against two such datasets is presented, and results show less than ideal performance in distinguishing maliciously manipulated images from legitimate ones.
10 citations
TL;DR: Zhang et al. as discussed by the authors developed SecDH as a medical data hiding scheme, which can guarantee the security and copyright protection of the COVID-19 images by using principal component analysis (PCA) between cover and mark image.
9 citations
TL;DR: The results of the experiments reveal that the wHash mechanism with a color histogram is more accurate than the currently used perceptual Hashing (pHash) mechanism.
Abstract: This work proposes an intelligent visual technique for detecting phishing websites. The phishing websites are classified into three categories: very similar, local similar, and non-imitating. For cases of ‘very similar’, this study uses the wavelet Hashing (wHash) mechanism with a color histogram to evaluate the similarity. In cases of ‘local similarity’, this study uses the Scale-Invariant Feature Transform (SIFT) technique to evaluate the similarity. This work concerns ‘very similar’ and ‘local similar’ cases to detect phishing websites. The results of the experiments reveal that the wHash mechanism with a color histogram is more accurate than the currently used perceptual Hashing (pHash) mechanism. The accuracies of SIFT technique are 97.93%, 98.61%, and 99.95% related to Microsoft, Dropbox, and Bank of America data, respectively.
8 citations
Cites background from "A robust image hashing based on dis..."
...If the amount of data is large, then the time complexity is large [15,16]....
[...]
TL;DR: A new blind image watermarking scheme using binary decimal sequence (d-sequence) and lifting wavelet transform (LWT) for copyright protection and the better robustness of the proposed scheme against different kind of attacks is demonstrated.
Abstract: This paper presents a new blind image watermarking scheme using binary decimal sequence (d-sequence) and lifting wavelet transform (LWT) for copyright protection. The core idea is to produce a d- sequence based on random number generator (RNG) algorithm and secret keys. A reference set is then generated using the d-sequence for embedding purpose. For embedding, the host image is decomposed into different frequency bands using the LWT and watermark bits are then embedded in selected band, considering the reference set. The extensive experimental results, comparative and security analysis demonstrate the better robustness of the proposed scheme against different kind of attacks.
8 citations
TL;DR: A new robust watermarking framework is designed using the discrete cosine transform (DCT), binary decimal sequence (d-sequence) and Dn-structure to generate a binary d-sequence based on random number generator (RNG) and some secret keys.
Abstract: In this paper, a new robust watermarking framework is designed using the discrete cosine transform (DCT), binary decimal sequence (d-sequence) and Dn-structure. The core idea is to generate a binary d-sequence based on random number generator (RNG) and some secret keys. This binary sequence is then utilized to generate reference sets based on Dn-structure. For embedding purpose, the host image is transformed using DCT and selected coefficients are employed to construct a macro block. Each binary watermark bit is securely embedded into macro block by utilizing the reference set. The reverse process is finally formulated to extract the watermark at the receiver end. The proposed technique is experimentally analyzed using various quality metrics and attacks. The comprehensive experimental results illustrate that the proposed watermarking scheme is robust to both geometric distortions (resizing, cropping, wrapping and random row deletion) and general signal processing attacks (various noise addition, blurring, high pass filtering, image sharpening, contrast adjustment, Histogram equalization and gamma correction and JPEG compression) and outperforms state-of-the-art watermarking methods.
6 citations
References
More filters
Book•
01 Jan 1998
TL;DR: An introduction to a Transient World and an Approximation Tour of Wavelet Packet and Local Cosine Bases.
Abstract: Introduction to a Transient World. Fourier Kingdom. Discrete Revolution. Time Meets Frequency. Frames. Wavelet Zoom. Wavelet Bases. Wavelet Packet and Local Cosine Bases. An Approximation Tour. Estimations are Approximations. Transform Coding. Appendix A: Mathematical Complements. Appendix B: Software Toolboxes.
17,693 citations
Additional excerpts
...The Wavelet Transform (WT) is a mathematical tool to analyse steady-state and non-stationary signals in various diciplines due to the fact that it can efficiently analyse the local discontinuities of the signa [11]....
[...]
Book•
01 Jan 1996TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Abstract: From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.
13,597 citations
"A robust image hashing based on dis..." refers background in this paper
...Thus, the integrity of the data can only be authenticate if all message bit are unchanged [1]....
[...]
Book•
01 Jan 1968
1,782 citations
"A robust image hashing based on dis..." refers background in this paper
...Mathematically, the classical cat-map is defined as follows[12] [ xn y′ n ]...
[...]
TL;DR: A novel algorithm for generating an image hash based on Fourier transform features and controlled randomization is developed and it is shown that the proposed hash function is resilient to content-preserving modifications, such as moderate geometric and filtering distortions.
Abstract: Image hash functions find extensive applications in content authentication, database search, and watermarking. This paper develops a novel algorithm for generating an image hash based on Fourier transform features and controlled randomization. We formulate the robustness of image hashing as a hypothesis testing problem and evaluate the performance under various image processing operations. We show that the proposed hash function is resilient to content-preserving modifications, such as moderate geometric and filtering distortions. We introduce a general framework to study and evaluate the security of image hashing systems. Under this new framework, we model the hash values as random variables and quantify its uncertainty in terms of differential entropy. Using this security framework, we analyze the security of the proposed schemes and several existing representative methods for image hashing. We then examine the security versus robustness tradeoff and show that the proposed hashing methods can provide excellent security and robustness.
542 citations
Additional excerpts
...In [8] authors have proposed a Fourier transform based image hashing where the features are extracted by converting it to the polar coordinate system....
[...]
TL;DR: In this article, singular value decomposition (SVD) and pseudoinverse techniques are used for image restoration in space-variant point spread functions (SVPSF).
Abstract: The use of singular value decomposition (SVD) techniques in digital image processing is of considerable interest for those facilities with large computing power and stringent imaging requirements. The SVD methods are useful for image as well as quite general point spread function (impulse response) representations. The methods represent simple extensions of the theory of linear filtering. Image enhancement examples will be developed illustrating these principles. The most interesting cases of image restoration are those which involve space variant imaging systems. The SVD, combined with pseudoinverse techniques, provides insight into these types of restorations. Illustrations of large scale N2× N2point spread function matrix representations are discussed along with separable space variant N2× N2point spread function matrix examples. Finally, analysis and methods for obtaining a pseudoinverse of separable space variant point spread functions (SVPSF's) are presented with a variety of object and imaging system dagradations.
362 citations
"A robust image hashing based on dis..." refers background in this paper
...A detailed analysis on the importance of SVD in digital image processing can be seen in [10]....
[...]