Robust Watermarking Scheme for Vector Geographic Data Based on the Ratio Invariance of DWT–CSVD Coefficients
Bibliographic Data
| ID | 22031337 |
|---|---|
| Authors | Chengyi Qu (Suzhou University of Science and Technology), Cheng-yi Qu (0000-0002-4669-7048, Suzhou University of Science and Technology), Xu Xi (0000-0002-9306-2942, Suzhou University of Science and Technology), Xi Xu (0000-0002-4410-486X, Suzhou University of Science and Technology, corresponding author), Jinglong Du (0000-0002-8151-4171, Suzhou University of Science and Technology), Tong Wu (0000-0001-9666-3324, China National Environmental Monitoring Center) |
| Year | 2022 |
| Volume | 11 |
| Issue | 12 |
| Pages | 583 |
| Publication date | 2022-11-22 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | ISPRS International Journal of Geo-Information (JOURNAL) |
| Journal identifiers | ISSN: 2220-9964 • E-ISSN: 2220-9964 |
| Publisher | MDPI AG (PUBLISHER • IT) |
| DOI | 10.3390/ijgi11120583 |
| OpenAlex | W4309728455 |
| Language | EN |
| References cited | 26 |
Traditional frequency-domain watermarking algorithms for vector geographic data suffer from disadvantages such as the random watermark embedding position, unpredictable embedding strength, and difficulty in resisting multiple attacks at the same time. To address these problems, we propose a novel watermarking algorithm based on the geometric invariance of the ratios of discrete wavelet transform (DWT) and complex singular value decomposition (CSVD) coefficients, which embeds the watermark information in a new embedding domain. The proposed scheme first extracts feature points from the original vector geographic data using the Douglas–Peucker algorithm, and then constructs a complex sequence based on the feature points set. The two-level DWT is then performed on the complex sequence to obtain the low frequency coefficients (L2) and high frequency coefficients (H2). On this premise, the CSVD algorithm is utilized to calculate the singular values of L2 and H2, and the ratio of the singular values of L2 and H2 is acquired as the watermark embedding domain. During the watermark embedding process, a new watermark sequence is created by the fusion of the original watermark index value and bits value to improve the recognition of the watermark information, and the decimal part at different positions of the ratio is altered by the new watermark sequence to control the watermark embedding strength. The experimental results show that the proposed watermarking algorithm is not only robust to common attacks such as geometric, cropping, simplification, and coordinate point editing, but also can extract watermark images with a high probability under random multiple attacks
Algorithm · Digital watermarking · Discrete wavelet transform · Embedding · Watermark · Wavelet · Wavelet transform · Advanced Steganography and Watermarking Techniques · Biometric Identification and Security · Computer Science · Digital Media Forensic Detection · Mathematics · Artificial Intelligence
A Novel Invariant Based Commutative Encryption and Watermarking Algorithm for Vector Maps
Copyright Protection Based on Zero Watermarking and Blockchain for Vector Maps
Vector Map Encryption Algorithm Based on Double Random Position Permutation Strategy
Blind Digital Watermarking Algorithm against Projection Transformation for Vector Geographic Data
Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature
| Highly cited | No |
|---|