File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1117/12.813153
- Scopus: eid_2-s2.0-62649101875
- WOS: WOS:000285716400060
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Towards a 2D vector map with a feature nodes based watermarking method
Title | Towards a 2D vector map with a feature nodes based watermarking method |
---|---|
Authors | |
Keywords | Digital watermark Similarity Vector map Robustness Feature nodes |
Issue Date | 2008 |
Citation | Proceedings of SPIE - The International Society for Optical Engineering, 2008, v. 7146 How to Cite? |
Abstract | With a wide use of vector maps, the copyright issue is educing an increasing importance and attracting focus on the transmission and the exchange of the vector maps through a network environment. This paper discusses a feature nodes based watermarking method (FNBW) towards keeping robustness and high accuracy of digital map based on SVG and GML format. The digital map treats as a set of curves in the embedding algorithm, and each curve was divided up into several shorter curves under two given thresholds. And then a watermark bit combined with user certificate was embedded into each segment around the feature nodes with the maximum curvature in the segment series nodes. To extract the watermark, all watermark nodes were calculated and searched for in the watermarked map with the Watermark node Searching Algorithm by using the original map. Finally the method calculates the similarity between the original watermark bits and the extracted ones, and determines whether the watermark exists or not. As the experiment result shown, the method not only guarantees the accuracy of vector map but also possesses the good robustness, such as it gives 1.00 similarity under no attack or only geometric transformation with the map; And the anticopping ability is also good enough to give a more than 0.87 similarity for the map cropped 80%. In addition, the method has the full ability of anti-compression lossless methods and good ability to the loss approaches. And an experiment curve of the similarity threshold was given in the paper, which helped to control the anti-attack ability of the watermark and set parameters for an automatic procedure of watermark detection. © 2008 SPIE. |
Persistent Identifier | http://hdl.handle.net/10722/277610 |
ISSN | 2023 SCImago Journal Rankings: 0.152 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Yan | - |
dc.contributor.author | Zhang, Hongsheng | - |
dc.date.accessioned | 2019-09-27T08:29:28Z | - |
dc.date.available | 2019-09-27T08:29:28Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | Proceedings of SPIE - The International Society for Optical Engineering, 2008, v. 7146 | - |
dc.identifier.issn | 0277-786X | - |
dc.identifier.uri | http://hdl.handle.net/10722/277610 | - |
dc.description.abstract | With a wide use of vector maps, the copyright issue is educing an increasing importance and attracting focus on the transmission and the exchange of the vector maps through a network environment. This paper discusses a feature nodes based watermarking method (FNBW) towards keeping robustness and high accuracy of digital map based on SVG and GML format. The digital map treats as a set of curves in the embedding algorithm, and each curve was divided up into several shorter curves under two given thresholds. And then a watermark bit combined with user certificate was embedded into each segment around the feature nodes with the maximum curvature in the segment series nodes. To extract the watermark, all watermark nodes were calculated and searched for in the watermarked map with the Watermark node Searching Algorithm by using the original map. Finally the method calculates the similarity between the original watermark bits and the extracted ones, and determines whether the watermark exists or not. As the experiment result shown, the method not only guarantees the accuracy of vector map but also possesses the good robustness, such as it gives 1.00 similarity under no attack or only geometric transformation with the map; And the anticopping ability is also good enough to give a more than 0.87 similarity for the map cropped 80%. In addition, the method has the full ability of anti-compression lossless methods and good ability to the loss approaches. And an experiment curve of the similarity threshold was given in the paper, which helped to control the anti-attack ability of the watermark and set parameters for an automatic procedure of watermark detection. © 2008 SPIE. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of SPIE - The International Society for Optical Engineering | - |
dc.subject | Digital watermark | - |
dc.subject | Similarity | - |
dc.subject | Vector map | - |
dc.subject | Robustness | - |
dc.subject | Feature nodes | - |
dc.title | Towards a 2D vector map with a feature nodes based watermarking method | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1117/12.813153 | - |
dc.identifier.scopus | eid_2-s2.0-62649101875 | - |
dc.identifier.volume | 7146 | - |
dc.identifier.spage | null | - |
dc.identifier.epage | null | - |
dc.identifier.isi | WOS:000285716400060 | - |
dc.identifier.issnl | 0277-786X | - |