2020
DOI: 10.1049/iet-ipr.2019.1059
|View full text |Cite
|
Sign up to set email alerts
|

Optimised robust watermarking technique using CKGSA in DCT‐SVD domain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 40 publications
0
10
0
Order By: Relevance
“…To this end, a combination of fast curvelet transform and SVD embeds watermark (EPR) after encoding into patient's healthy and diseased optical coherence tomography (OCT) scans [19]; this scheme has shown a high level of imperceptibility, robustness, and security of EPRs as compared to existing watermarking schemes. A digital watermark protocol proposed by [20] solves the false-positive problem by using a chaotic Kbest gravitational search algorithm in two domains, i.e., SVD and DCT. An efficient watermarking scheme in terms of imperceptibility, security, and robustness proposed by [21] embeds the watermark by Fractional Moments of Charlier-Meixner.…”
Section: Related Workmentioning
confidence: 99%
“…To this end, a combination of fast curvelet transform and SVD embeds watermark (EPR) after encoding into patient's healthy and diseased optical coherence tomography (OCT) scans [19]; this scheme has shown a high level of imperceptibility, robustness, and security of EPRs as compared to existing watermarking schemes. A digital watermark protocol proposed by [20] solves the false-positive problem by using a chaotic Kbest gravitational search algorithm in two domains, i.e., SVD and DCT. An efficient watermarking scheme in terms of imperceptibility, security, and robustness proposed by [21] embeds the watermark by Fractional Moments of Charlier-Meixner.…”
Section: Related Workmentioning
confidence: 99%
“…The utilization of image compression techniques is of great significance in the process of lowering the file size of digital photos, with the primary objective of preserving the visual quality of the image. Images play a crucial role in a multitude of applications by facilitating efficient storage, transport, and sharing processes [1][2][3][4]. Some prominent image compression techniques, as depicted in Figure 1, are explained as follows:…”
Section: Introductionmentioning
confidence: 99%
“…They are appropriate for applications where pixel precision is essential, such as medical imaging and text documents. Examples of popular algorithms includes run-length encoding (RLE), arithmetic coding, and Huffman coding [1][2][3]. ii.…”
Section: Introductionmentioning
confidence: 99%
“…Approaches of this domain have low computational complexity. However, these methods have poor data-hiding ability and low robustness [6,7]. On the contrary, frequency domain methods are pretty much efficient in this respect.…”
Section: Introductionmentioning
confidence: 99%