2D vector map data hiding with directional relations preservation between points

Wang, Nana; Zhao, Xiangjun

doi:10.1016/j.aeue.2016.10.010

Cited by 7 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The application prospects of digital watermarking technology in securing vector geographic data are highly significant. Numerous scholars have extensively investigated digital watermarking technology for vector geographic data, yielding a plethora of valuable research findings [1][2][3][4][5][6][7][8][9][10][11]. The current research on digital watermarking technology for vector geographic data primarily focuses on robust and fragile watermarking techniques, which are predominantly employed to address issues related to data copyright protection, single-user usage tracking, and content authentication.…”

Section: Introductionmentioning

confidence: 99%

Multiple Watermarking Algorithms for Vector Geographic Data Based on Multiple Quantization Index Modulation

Wang,

Yang,

Ding

2023

Applied Sciences

View full text Add to dashboard Cite

Multiple digital watermarking is an important and challenging task in geographic information science and data security. Vector geographic data are a basic data format for digital geographic data storage, and the security protection of these data involves copyright protection and tracking. As part of the solution, existing digital watermarking algorithms have made contributions to vector geographic data protection. However, when vector geographic data flow through multiple units, they need to be marked to ensure that the original data are not destroyed during data processing. Existing single or multiple data watermarking algorithms often fail in the presence of data processing because the new watermarks overlay the old ones. Consequently, a multiple digital watermarking algorithm based on multiple QIM (quantization index modulation) is proposed. First, based on traditional quantization index modulation (QIM), a multiple QIM is proposed. Unlike traditional QIM, in multiple QIM, the process of quantization is executed multiple times depending on the number of watermarks. Then, the vertices are quantized into different quantization intervals according to the multiple QIM. Finally, multiple watermarks are embedded into different quantization intervals to reduce the interference among multiple watermarks, and the original watermarks are not needed in the process of watermark detection. We then conducted experiments to test the multiple watermark method’s robustness and capacity, with an emphasis on datasets with a lower data volume. The experimental results show that the proposed algorithm achieves good performance in terms of its robustness against common issues, such as vertices addition, data simplification, data cropping, and feature deletion; this holds true for both normal and small amounts of data. Additionally, it has a high multiple watermark capacity.

show abstract

Section: Introductionmentioning

confidence: 99%

Multiple Watermarking Algorithms for Vector Geographic Data Based on Multiple Quantization Index Modulation

Wang,

Yang,

Ding

2023

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…To maintain the directional relationships between the coordinate points, Ref. [29] sorted the horizontal and vertical coordinates separately, and they divided the coordinate axes into several sub-segments, and boundary coordinates were added for each sub-segment, which are removed after the watermark embedding. Peng et al [30] proposed using reversible watermarks with contrast mapping to distinguish the sets that correspond to the coordinate points to which they belong by adopting different embedding methods, but the least-significant bits of the coordinate points of some of the individual sets must be saved.…”

Section: Introductionmentioning

confidence: 99%

A Reversible Watermarking Scheme for Vector Maps Based on Multilevel Histogram Modification

2018

View full text Add to dashboard Cite

To protect the security of vector maps, we propose a novel reversible watermarking scheme for vector maps based on a multilevel histogram modification. First, a difference histogram is constructed using the correlations of adjacent coordinates, and the histogram is divided into continuous regions and discontinuous regions by combining the characteristics of vector map data. Second, the histogram bins that require modification are determined in the continuous regions through the optimal peak value, and the peak values are chosen from the flanking discontinuous regions in both directions; the watermarks are embedded by adopting the multilevel histogram modification strategy. The watermark extraction process is the reverse of the embedding process, and after completing the watermark extraction, the carrier data can be recovered losslessly. The experimental results show that the proposed algorithm has good invisibility and is completely reversible. Compared with similar algorithms reported previously, it achieves higher watermark embedding capacity under the same embedding distortion with lower complexity, thereby having a higher application value.

show abstract

“…Moreover, the proposed detection algorithm is compatible with single watermarking detection algorithms, and it has good performance in terms of detection efficiency. Therefore, multiple watermarking technology can effectively solve the above information security problems of vector geographic data.Currently, many scholars have been devoted to developing digital watermark technology, and they have proposed many algorithms [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. However, these algorithms focus on embedding only one watermark in the cover data, which then lacks multi-copyright protection.…”

mentioning

confidence: 99%

An Efficient Robust Multiple Watermarking Algorithm for Vector Geographic Data

et al. 2018

View full text Add to dashboard Cite

Vector geographic data play an important role in location information services. Digital watermarking has been widely used in protecting vector geographic data from being easily duplicated by digital forensics. Because the production and application of vector geographic data refer to many units and departments, the demand for multiple watermarking technology is increasing. However, multiple watermarking algorithm for vector geographic data draw less attention, and there are many urgent problems to be solved. Therefore, an efficient robust multiple watermark algorithm for vector geographic data is proposed in this paper. The coordinates in vector geographic data are first randomly divided into non-repetitive sets. The multiple watermarks are then embedded into the different sets. In watermark detection correlation, the Lindeberg theory is used to build a detection model and to confirm the detection threshold. Finally, experiments are made in order to demonstrate the detection algorithm, and to test its robustness against common attacks, especially against cropping attacks. The experimental results show that the proposed algorithm is robust against the deletion of vertices, addition of vertices, compression, and cropping attacks. Moreover, the proposed detection algorithm is compatible with single watermarking detection algorithms, and it has good performance in terms of detection efficiency. Therefore, multiple watermarking technology can effectively solve the above information security problems of vector geographic data.Currently, many scholars have been devoted to developing digital watermark technology, and they have proposed many algorithms [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. However, these algorithms focus on embedding only one watermark in the cover data, which then lacks multi-copyright protection. Multiple watermarking draws less attention than single watermarking, and it does not simply involve the embedding of different watermarks by using the single watermarking algorithm. The multiple watermarking algorithm commonly focuses on images and videos. There are three main methods for addressing the impact of multiple watermarks, as described in References [17][18][19][20][21][22][23][24][25][26][27][28][29][30]. The first is dividing the images into multiple blocks for multiple watermarks [17,18,27,29]. The second is embedding multiple watermarks into different frequency domains or channels [19][20][21][22][23]26,30]. The last is merging multiple watermarks into one [24,25,27]. Usually multiple methods are combined in one algorithm. In the above references, only a few previous works have been proposed for vector geographic data; for instance, References [24-29]. Sun et al. combined a child copyright watermark with another child watermark consisting of features selected by fuzzy clustering from the vector map. The new watermark was then embedded into the vector map [24]. Li et al. proposed a multiple watermark embedding solution through the generation of additional information with waterma...

show abstract

2D vector map data hiding with directional relations preservation between points

Cited by 7 publications

References 25 publications

Multiple Watermarking Algorithms for Vector Geographic Data Based on Multiple Quantization Index Modulation

Multiple Watermarking Algorithms for Vector Geographic Data Based on Multiple Quantization Index Modulation

A Reversible Watermarking Scheme for Vector Maps Based on Multilevel Histogram Modification

An Efficient Robust Multiple Watermarking Algorithm for Vector Geographic Data

Contact Info

Product

Resources

About