A Robust Zero‐Watermarking Algorithm for Spatiotemporal Trajectory Data Protection

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.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-09-03
DOI
https://doi.org/10.1002/cpe.70280
Primary Topic
Advanced Steganography and Watermarking Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Robust Zero‐Watermarking Algorithm for Spatiotemporal Trajectory Data Protection

Yan Jin, Nan Ren, Tao Tan, Haoran Wang et al.
Concurrency and Computation Practice and Experience
Advanced Steganography and Watermarking Techniques
article

A Robust Zero‐Watermarking Algorithm for Spatiotemporal Trajectory Data Protection

Yan Jin, Nan Ren, Tao Tan, Haoran Wang, Liming Zhang, Jianing Xie
article en

Abstract

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 ExperienceVol. 37(23-24)
Lanzhou Jiaotong University (CN), Nanjing Surveying and Mapping Research Institute (China) (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 77%
Advanced Steganography and Watermarking Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.