2013
DOI: 10.3390/e15083260
|View full text |Cite
|
Sign up to set email alerts
|

A Maximum Entropy-Based Chaotic Time-Variant Fragile Watermarking Scheme for Image Tampering Detection

Abstract: Abstract:The fragile watermarking technique is used to protect intellectual property rights while also providing security and rigorous protection. In order to protect the copyright of the creators, it can be implanted in some representative text or totem. Because all of the media on the Internet are digital, protection has become a critical issue, and determining how to use digital watermarks to protect digital media is thus the topic of our research. This paper uses the Logistic map with parameter u = 4 to ge… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 22 publications
0
11
0
Order By: Relevance
“…An effective solution in this respect is to employ the discrete chaotic dynamics provided by the hyperbolic toral automorphism, known as Arnold's cat map [39,40]. This discrete 2D map is one of the most investigated examples of dynamical systems mainly due to its broad range of applications in image encryption and watermarking [41]. It is described by the following equations:…”
Section: Arnold's Cat Mapmentioning
confidence: 99%
“…An effective solution in this respect is to employ the discrete chaotic dynamics provided by the hyperbolic toral automorphism, known as Arnold's cat map [39,40]. This discrete 2D map is one of the most investigated examples of dynamical systems mainly due to its broad range of applications in image encryption and watermarking [41]. It is described by the following equations:…”
Section: Arnold's Cat Mapmentioning
confidence: 99%
“…In practical applications, AT not only scrambles the pixel position by encoding the iterative number of the process, but also reduces the key spaces of storage and transmission. Although there are many ways for scrambling, here we will discuss only the AT in [10,14], which is an iterative process of moving the pixel position. Suppose that the original image is a × array and the coordinate of the pixel is = {( , ) | , = 0, 1, 2, .…”
Section: Arnold Transform (At)mentioning
confidence: 99%
“…Chen et al [13] designed a new image encryption algorithm based on singular value decomposition and AT. Chen et al [14] offered a watermarking scheme based on Arnold cat map. AT has periodicity and the transform is simple, but the periodicity depends on image size.…”
Section: Introductionmentioning
confidence: 99%
“…Regardless of the fact that their installation packs are different, this make them similar in a way that they may launch applications with the same features. This simplicity of malicious code development and the effectiveness of obfuscation mechanisms [6,7] available for the attackers nowadays make them armed with a powerful weapon.…”
Section: Introductionmentioning
confidence: 99%