A hybrid domain-based watermarking for vector maps utilizing a complementary advantage of discrete fourier transform and singular value decomposition

数字水印 水印 奇异值分解 算法 嵌入 不变(物理) 矢量地图 数学 奇异值 缩放比例 计算机科学 模式识别(心理学) 人工智能 几何学 图像(数学) 特征向量 物理 量子力学 数学物理
作者
Cheng-yi Qu,Jinglong Du,Xugang Xi,Hanqin Tian,Jie Zhang
出处
期刊:Computers & Geosciences [Elsevier]
卷期号:183: 105515-105515
标识
DOI:10.1016/j.cageo.2023.105515
摘要

Digital watermarking plays a crucial role in the copyright protecting of vector maps. Due to its solid theoretical foundation, Discrete Fourier transform (DFT) is frequently used in the construction of watermarking scheme for diverse electronic data. However, when applied to vector maps, DFT is particularly vulnerable to local changes in coordinate points, posing challenges in surviving coordinate point attacks and limiting its practicality. Furthermore, its resistance against geometric attacks is quite weak. To address these issues, we propose an algorithmic complementary strategy that enhances the performance of DFT-based vector map watermarking scheme. The proposed scheme is founded upon a hybrid transform domain consisting of DFT and singular value decomposition (SVD). The first step is to extract feature points using the Douglas Peucker algorithm, with the distance threshold set to a relative value to ensure synchronization of feature points throughout scaling. The feature points are then subjected to DFT to obtain magnitude coefficients, which are then further transformed using SVD. By combining the geometric invariance of magnitude coefficients with the singular vectors of SVD, an invariant with rotation, scaling, and translation invariance can be generated. For watermark embedding, the invariant serves as an embedding domain and are multiplied to minimize the impact on the host vector maps. The experimental results reveal that the proposed vector map watermarking has very low disturbance, substantially lower than the comparing algorithms, deriving in excellent invisibility. The scheme can extract watermark images with a normalized correlation value of 1 under a variety of attacks, including rotation, scaling, translation, vertex addition, simplification, and map cropping, and it can even extract identifiable copyright information under a 10% vertex deletion, demonstrating very comprehensive robustness.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
自觉的小凝完成签到,获得积分20
刚刚
单薄的英姑完成签到 ,获得积分10
1秒前
牦牛发布了新的文献求助10
1秒前
homer完成签到,获得积分10
1秒前
1秒前
qwa发布了新的文献求助10
2秒前
栢晖完成签到 ,获得积分10
2秒前
qiao发布了新的文献求助10
6秒前
丘比特应助曾无忧采纳,获得10
7秒前
8秒前
神凰完成签到,获得积分10
9秒前
9秒前
leeOOO完成签到,获得积分10
10秒前
Jasper应助qwa采纳,获得10
11秒前
Antonio完成签到 ,获得积分10
11秒前
12秒前
zhencheng发布了新的文献求助10
14秒前
行稳致远完成签到,获得积分10
14秒前
冻冻妖完成签到,获得积分10
15秒前
超甜大西瓜完成签到,获得积分10
15秒前
完美世界应助lvben采纳,获得10
16秒前
rocky15应助水论文行者采纳,获得10
16秒前
rocky15应助水论文行者采纳,获得10
16秒前
rocky15应助水论文行者采纳,获得10
17秒前
勿庸完成签到,获得积分10
17秒前
Emma发布了新的文献求助10
19秒前
岑岑岑完成签到,获得积分10
20秒前
昵称无法显示完成签到,获得积分10
20秒前
liu123479完成签到,获得积分10
21秒前
CYL完成签到 ,获得积分10
23秒前
zz完成签到,获得积分20
23秒前
莫华龙发布了新的文献求助10
23秒前
23秒前
flj7038完成签到,获得积分10
24秒前
yulian完成签到,获得积分10
24秒前
24秒前
Echo725完成签到,获得积分10
25秒前
中午饭完成签到,获得积分10
26秒前
wangyu完成签到,获得积分10
28秒前
王大锤完成签到,获得积分10
28秒前
高分求助中
Sustainable Land Management: Strategies to Cope with the Marginalisation of Agriculture 1000
Corrosion and Oxygen Control 600
Yaws' Handbook of Antoine coefficients for vapor pressure 500
Python Programming for Linguistics and Digital Humanities: Applications for Text-Focused Fields 500
Heterocyclic Stilbene and Bibenzyl Derivatives in Liverworts: Distribution, Structures, Total Synthesis and Biological Activity 500
重庆市新能源汽车产业大数据招商指南(两链两图两池两库两平台两清单两报告) 400
Division and square root. Digit-recurrence algorithms and implementations 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2551473
求助须知:如何正确求助?哪些是违规求助? 2177614
关于积分的说明 5609808
捐赠科研通 1898547
什么是DOI,文献DOI怎么找? 947863
版权声明 565519
科研通“疑难数据库(出版商)”最低求助积分说明 504201