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, Liming Zhang, Yan Jin, Ruigang Nan, Tao Tan, 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.
期刊介绍:
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.