{"title":"乘法扩频水印的性能研究","authors":"M. Barni, F. Bartolini, A. D. Rosa","doi":"10.1109/MMSP.2002.1203311","DOIUrl":null,"url":null,"abstract":"The performance of multiplicative spread spectrum watermarking algorithms are investigated under the simplifying assumption that host features are normally distributed, and attacks take the form of normally distributed additive noise. By relying on the obtained results, multiplicative spread spectrum watermarking is compared to its additive counterpart and to quantization based schemes.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On the performance of multiplicative spread spectrum watermarking\",\"authors\":\"M. Barni, F. Bartolini, A. D. Rosa\",\"doi\":\"10.1109/MMSP.2002.1203311\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of multiplicative spread spectrum watermarking algorithms are investigated under the simplifying assumption that host features are normally distributed, and attacks take the form of normally distributed additive noise. By relying on the obtained results, multiplicative spread spectrum watermarking is compared to its additive counterpart and to quantization based schemes.\",\"PeriodicalId\":398813,\"journal\":{\"name\":\"2002 IEEE Workshop on Multimedia Signal Processing.\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 IEEE Workshop on Multimedia Signal Processing.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMSP.2002.1203311\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE Workshop on Multimedia Signal Processing.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2002.1203311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the performance of multiplicative spread spectrum watermarking
The performance of multiplicative spread spectrum watermarking algorithms are investigated under the simplifying assumption that host features are normally distributed, and attacks take the form of normally distributed additive noise. By relying on the obtained results, multiplicative spread spectrum watermarking is compared to its additive counterpart and to quantization based schemes.