We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

A steganalytic algorithm for 3D polygonal meshes.

Yang, Ying and Pintus, Ruggero and Rushmeier, Holly and Ivrissimtzis, Ioannis (2014) 'A steganalytic algorithm for 3D polygonal meshes.', in ICIP 2014 : 2014 IEEE International Conference on Image Processing (ICIP). Piscataway: IEEE, pp. 4782-4786.


We propose a steganalytic algorithm for watermarks embedded by Cho et al.'s mean-based algorithm [1]. The main observation is that while in a clean model the means of Cho et al.'s normalized histogram bins are expected to follow a Gaussian distribution, in a marked model their distribution will be bimodal. The proposed algorithm estimates the number of bins through an exhaustive search and then the presence of a watermark is decided by a tailor made normality test. We also propose a modification of Cho et al.'s algorithm which is more resistant to the steganalytic attack and offers an improved robustness/capacity trade-off.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Date accepted:30 May 2014
Date deposited:19 April 2016
Date of first online publication:October 2014
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar