A Robust Zero-Watermarking Algorithm for Spatiotemporal Trajectory Data Protection

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Jianing Xie, Liming Zhang, Yan Jin, Ruigang Nan, Tao Tan, Haoran Wang
{"title":"A Robust Zero-Watermarking Algorithm for Spatiotemporal Trajectory Data Protection","authors":"Jianing Xie,&nbsp;Liming Zhang,&nbsp;Yan Jin,&nbsp;Ruigang Nan,&nbsp;Tao Tan,&nbsp;Haoran Wang","doi":"10.1002/cpe.70280","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>As an important type of spatiotemporal big data, trajectory data faces severe challenges such as illegal copying and dissemination, which infringes upon the legitimate rights of copyright owners. Existing copyright protection methods for trajectory data often regard it as a collection of points for watermark embedding, ignoring its inherent spatiotemporal characteristics. These methods exhibit limitations in both robustness and specificity. To address this, this paper introduces a zero-watermarking algorithm for trajectory data that effectively integrates spatiotemporal features. The proposed algorithm begins by segmenting the trajectory into sub-trajectories using stay areas as key nodes, extracting feature points accordingly. Then, a watermark index is constructed based on the movement speed of each sub-trajectory in the X-direction, with the watermark information generated through a voting mechanism. Finally, an exclusive-ORing (XOR) operation is performed between the watermark information and the scrambled copyright image to produce the zero-watermark image. Experimental results demonstrate that the proposed method exhibits strong robustness, effectively resisting various attacks such as time shifting, cropping, and coordinate point deletion. Specifically, the normalized correlation (NC) value remains above 0.95 even when 50% of the coordinate points are removed, and achieves an NC value of 1.00 under geometric attacks including translation and scaling. Compared to existing watermarking schemes for trajectory data, the proposed approach exhibits significantly enhanced robustness.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 23-24","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70280","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

As an important type of spatiotemporal big data, trajectory data faces severe challenges such as illegal copying and dissemination, which infringes upon the legitimate rights of copyright owners. Existing copyright protection methods for trajectory data often regard it as a collection of points for watermark embedding, ignoring its inherent spatiotemporal characteristics. These methods exhibit limitations in both robustness and specificity. To address this, this paper introduces a zero-watermarking algorithm for trajectory data that effectively integrates spatiotemporal features. The proposed algorithm begins by segmenting the trajectory into sub-trajectories using stay areas as key nodes, extracting feature points accordingly. Then, a watermark index is constructed based on the movement speed of each sub-trajectory in the X-direction, with the watermark information generated through a voting mechanism. Finally, an exclusive-ORing (XOR) operation is performed between the watermark information and the scrambled copyright image to produce the zero-watermark image. Experimental results demonstrate that the proposed method exhibits strong robustness, effectively resisting various attacks such as time shifting, cropping, and coordinate point deletion. Specifically, the normalized correlation (NC) value remains above 0.95 even when 50% of the coordinate points are removed, and achieves an NC value of 1.00 under geometric attacks including translation and scaling. Compared to existing watermarking schemes for trajectory data, the proposed approach exhibits significantly enhanced robustness.

一种时空轨迹数据保护的鲁棒零水印算法
轨迹数据作为一种重要的时空大数据类型,面临着非法复制、传播、侵犯著作权人合法权益等严峻挑战。现有的轨迹数据版权保护方法往往将轨迹数据作为点的集合进行水印嵌入,忽略了轨迹数据固有的时空特征。这些方法在稳健性和特异性上都有局限性。为了解决这一问题,本文引入了一种有效整合时空特征的轨迹数据零水印算法。该算法首先以停留区域为关键节点,将轨迹分割成子轨迹,提取特征点。然后,根据每个子轨迹在x方向上的运动速度构建水印索引,并通过投票机制生成水印信息;最后,在水印信息与打乱后的版权图像之间进行异或运算,生成零水印图像。实验结果表明,该方法具有较强的鲁棒性,能够有效抵御时移、裁剪、坐标点删除等攻击。具体来说,在去除50%的坐标点后,归一化相关(NC)值仍保持在0.95以上,在平移和缩放等几何攻击下,NC值达到1.00。与现有的轨迹数据水印方案相比,该方法的鲁棒性显著增强。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信