Robust Watermarking of Polygonal Meshes Based on Vertex Norms Variance Distortion

Robust Watermarking of Polygonal Meshes Based on Vertex Norms Variance Distortion

Yesmine Ben Amar (SETIT, Sfax, Tunisia), Imen Trabelsi (SETIT, Sfax, Tunisia), Nilanjan Dey (Department of Information Technology, Techno India College of Technology, Kolkata, India), Fuqian Shi (Wenzhou Medical University, Wezhou, China), Suresh Chandra Satapathy (Department of Computer Science & Engineering, PVP Siddhartha Institute of Technology, Vijayawada, Andhra Pradesh, India) and Med Salim Bouhlel (SETIT, Sfax, Tunisia, & Sfax University, Sfax, Tunisia)
Copyright: © 2017 |Pages: 15
DOI: 10.4018/JGIM.2017100104
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

The three-dimensional (3D) mesh is moderately novel media type that realizes a rising success in various applications through data transfer via the Internet, which requires security approaches. Technological copyright protection of digital contents has become a challenging task in the current digital epoch. In this work, a robust watermarking algorithm of polygonal meshes for copyright protection purposes is proposed. The watermark insertion was achieved by quantization of the vertex norms variance in order to insert the watermark bits. In addition, this method is based on a blind detection scheme, so the watermark can be extracted without referring to the original mesh. The experimental results established the quality of the watermarked object as well as the inserted watermark robustness against various types of attacks, which were evaluated to prove the validity of the proposed algorithm. The results proved the proposed method efficiency in terms of robustness and imperceptibility against several signal processing distortions. A comparison with other reported method with similar purposes is also provided. The comparison depicted the outstanding robustness of the proposed method compared to the other reported method.
Article Preview

1. Introduction

Digital information revolution has numerous advantages with new challenges and opportunities for innovation. The three-dimensional (3D) meshes are relatively new kind of media that achieves a growing success, where their applications are widely transferred through the Internet. It has extensive applications in various domains, such as in entertainment industry (e.g. film, video games, virtual reality), and in technical/scientific applications (e.g. medical images that aid in the diagnosis, computer-assisted surgery, remote industrial objects design, physical simulations, cartography, geology, astronomy). A 3D mesh is a polygonal facets collection that consists of three main elements, namely the vertices, edges and facets. It provides a real 3D object appropriate approximation (Wang et al., 2008). The 3D mesh can be described using: 1) geometry information that represent the coordinates of all its vertices, and 2) the connectivity information that offers the adjacency relations between the elements. Additionally, it is fairly easy to convert the different representations to low-level effective 3D mesh model.

The increased use of multimedia applications poses growing problems concerning the protection of copyright and illegal use of controlled 3D meshes. Moreover, wireless networks and internet offer pervasive channels for information exchanging, which necessitates security and privacy issues. In the digital domain, ease editing and impeccable reproduction allow the ownership protection and the unauthorized tampering prevention of the transmitted data using developed data hiding techniques. Consequently, digital watermarking and data hiding schemes achieve extensive evolution in recent years and attract the researches attention. Such schemes have been involved for various applications, such as access control, ownership protection, copyright protection and authentication purposes (Dey et al., 2012a; 2012b; Dey et al., 2013a; Biswas et al., 2013). Robustness against compression, imperceptibility, and hiding many bits are the elementary requirements for multimedia data hiding applications.

In order to identify the content owner, watermarking is considered to be one of the effective solutions that involve watermark inserting/hiding some secret information in the cover content. This guarantees reliable authenticity protection of the multimedia data by inserting information in the data itself. The 3D models creation requires intensive resources in terms of time and cost. These models have a scientific and commercial value; however, their illegal use may lead to loss of time, money and effort. In order to avoid these factors, the robust watermark can be carried out. Previously, watermarking technologies were applied to traditional media data, such as image, digital audio, and video. Recently, 3D polygonal meshes have been widely used in many fields that need realistic visualization of the object (Ali, 2012). Since, watermarking schemes that has been emerged for audio, image, and video is challenging to adapt for 3D geometric models. Thus, only few watermarking methods have been proposed for 3D geometric models in relation to other media.

Robust watermark embedding to a specified 3D models guarantees security and protection of these precious objects. The information inserted can be used to enforce copyright, comments, detect tampering, or identify legitimate data buyers.

Recently, due to the rapid growth of computer graphics and acquisition technology, employing 3D information for modeling and representing real world scenes has become common in many applications (El-Bendary, 2012). Typically, mesh watermarking refers to the insertion of information into 3D models in a persistent and imperceptible way (Ben Amar et al., 2012; Abderrahim et al., 2013; Wang et al., 2008; Cho et al., 2007; Salehpoor & Behrad, 2012). These techniques are more difficult compared to image watermarking due to the increased complexity associated with meshes in arbitrary shapes and the existence of many insoluble attacks (Dey et al., 2012c, Dey et al., 2013b; Dey et al., 2013c)

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 26: 4 Issues (2018): 1 Released, 3 Forthcoming
Volume 25: 4 Issues (2017)
Volume 24: 4 Issues (2016)
Volume 23: 4 Issues (2015)
Volume 22: 4 Issues (2014)
Volume 21: 4 Issues (2013)
Volume 20: 4 Issues (2012)
Volume 19: 4 Issues (2011)
Volume 18: 4 Issues (2010)
Volume 17: 4 Issues (2009)
Volume 16: 4 Issues (2008)
Volume 15: 4 Issues (2007)
Volume 14: 4 Issues (2006)
Volume 13: 4 Issues (2005)
Volume 12: 4 Issues (2004)
Volume 11: 4 Issues (2003)
Volume 10: 4 Issues (2002)
Volume 9: 4 Issues (2001)
Volume 8: 4 Issues (2000)
Volume 7: 4 Issues (1999)
Volume 6: 4 Issues (1998)
Volume 5: 4 Issues (1997)
Volume 4: 4 Issues (1996)
Volume 3: 4 Issues (1995)
Volume 2: 4 Issues (1994)
Volume 1: 4 Issues (1993)
View Complete Journal Contents Listing