A Zero-Watermark Algorithm with Real-Mean for 2D Engineering Graphic

A zero-watermark algorithm for 2D engineering graphic with real-mean is proposed. The graphicpsilas vertexes are used as characteristic parameters, and confusion and compare operations are done to them to obtain the characteristic sequence of the graphic, after that, the characteristic sequence is encrypted by logistic chaotic system. The mapping relationship between the two sequences is constructed to obtain the meaningful zero-watermark. Experiment results show that the algorithm is robust against attacks such as scaling, even scaling, translation, rotation and deletion, even the combination of them. At the same time, without knowing the initial value of the chaotic system, the possibility of extracting the watermark is very low.