{"date_published":"2014-03-16T00:00:00Z","year":"2014","publisher":"World Scientific Publishing","day":"16","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2020-07-14T12:45:17Z","creator":"system","file_id":"4704","checksum":"be45c133ab4d43351260e21beaa8f4b1","date_created":"2018-12-12T10:08:43Z","relation":"main_file","file_name":"IST-2016-443-v1+1_S0218195914500034.pdf","access_level":"open_access","file_size":991734,"content_type":"application/pdf"}],"intvolume":"        24","pubrep_id":"443","language":[{"iso":"eng"}],"publist_id":"5290","issue":"1","oa_version":"Published Version","scopus_import":1,"quality_controlled":"1","title":"Topology-preserving watermarking of vector graphics","citation":{"ieee":"S. Huber, M. Held, P. Meerwald, and R. Kwitt, “Topology-preserving watermarking of vector graphics,” <i>International Journal of Computational Geometry and Applications</i>, vol. 24, no. 1. World Scientific Publishing, pp. 61–86, 2014.","short":"S. Huber, M. Held, P. Meerwald, R. Kwitt, International Journal of Computational Geometry and Applications 24 (2014) 61–86.","ama":"Huber S, Held M, Meerwald P, Kwitt R. Topology-preserving watermarking of vector graphics. <i>International Journal of Computational Geometry and Applications</i>. 2014;24(1):61-86. doi:<a href=\"https://doi.org/10.1142/S0218195914500034\">10.1142/S0218195914500034</a>","mla":"Huber, Stefan, et al. “Topology-Preserving Watermarking of Vector Graphics.” <i>International Journal of Computational Geometry and Applications</i>, vol. 24, no. 1, World Scientific Publishing, 2014, pp. 61–86, doi:<a href=\"https://doi.org/10.1142/S0218195914500034\">10.1142/S0218195914500034</a>.","apa":"Huber, S., Held, M., Meerwald, P., &#38; Kwitt, R. (2014). Topology-preserving watermarking of vector graphics. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195914500034\">https://doi.org/10.1142/S0218195914500034</a>","ista":"Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.","chicago":"Huber, Stefan, Martin Held, Peter Meerwald, and Roland Kwitt. “Topology-Preserving Watermarking of Vector Graphics.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2014. <a href=\"https://doi.org/10.1142/S0218195914500034\">https://doi.org/10.1142/S0218195914500034</a>."},"month":"03","date_created":"2018-12-11T11:54:10Z","acknowledgement":"Work by Martin Held and Stefan Huber was supported by Austrian Science Fund (FWF): L367-N15 and P25816-N15.","department":[{"_id":"HeEd"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"oa":1,"file_date_updated":"2020-07-14T12:45:17Z","status":"public","page":"61 - 86","date_updated":"2021-01-12T06:53:23Z","volume":24,"has_accepted_license":"1","type":"journal_article","publication_status":"published","publication":"International Journal of Computational Geometry and Applications","abstract":[{"text":"Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.","lang":"eng"}],"_id":"1816","author":[{"last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814"},{"last_name":"Held","first_name":"Martin","full_name":"Held, Martin"},{"last_name":"Meerwald","full_name":"Meerwald, Peter","first_name":"Peter"},{"full_name":"Kwitt, Roland","first_name":"Roland","last_name":"Kwitt"}],"doi":"10.1142/S0218195914500034"}