{"title":"Watermarking for 3D NURBS graphic data","authors":"Jae Jun Lee, N. Cho, Jongweon Kim","doi":"10.1109/MMSP.2002.1203306","DOIUrl":null,"url":null,"abstract":"In this paper, two watermarking algorithms for nonuniform rational b-spline (NURBS) are proposed. One is suitable for steganography, and the other for watermarking. Both algorithms do not directly embed data into the parameters of NURBS, but into the 2D virtual images extracted from the sampled points of 3D model. As a result, the proposed algorithm for steganography preserves the data size of the model and can embed more information than the conventional algorithm. Also, the watermarking algorithm can use any of existing 2D watermarking techniques when embedding data into the virtual 2D images. From the experiment, it is found that the algorithm is robust against the operations to knots and control points. It is also robust against the remodeling of NURBS model through approximation.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE Workshop on Multimedia Signal Processing.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2002.1203306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 41
Abstract
In this paper, two watermarking algorithms for nonuniform rational b-spline (NURBS) are proposed. One is suitable for steganography, and the other for watermarking. Both algorithms do not directly embed data into the parameters of NURBS, but into the 2D virtual images extracted from the sampled points of 3D model. As a result, the proposed algorithm for steganography preserves the data size of the model and can embed more information than the conventional algorithm. Also, the watermarking algorithm can use any of existing 2D watermarking techniques when embedding data into the virtual 2D images. From the experiment, it is found that the algorithm is robust against the operations to knots and control points. It is also robust against the remodeling of NURBS model through approximation.