{"title":"基于块级预测误差直方图移位的高容量可逆水印算法","authors":"Xin Tang, Dan Liu, Linna Zhou, Yi Zhang","doi":"10.1145/3430199.3430234","DOIUrl":null,"url":null,"abstract":"The paper proposes a high capacity reversible watermarking algorithm based on block-level prediction error histogram shifting. This algorithm, in contrast to the known prediction error histogram shifting based ones, provides a higher embedding capacity, which is achieved by employing similarity among adjacent blocks rather than simply pixels inside of a block. The imperceptibility is ensured by the premise that once the block selected is small enough, the center pixels of adjacent blocks have high probability of similarity or equality. At last, the effectiveness and performance are evaluated by experiments and the result shows that our proposed algorithm has higher capacity under the same imperceptibility compared with the classic prediction error histogram shifting based reversible watermarking algorithm as well as the state-of-the-art.","PeriodicalId":371055,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Artificial Intelligence and Pattern Recognition","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A High Capacity Reversible Watermarking Algorithm Based on Block-Level Prediction Error Histogram Shifting\",\"authors\":\"Xin Tang, Dan Liu, Linna Zhou, Yi Zhang\",\"doi\":\"10.1145/3430199.3430234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a high capacity reversible watermarking algorithm based on block-level prediction error histogram shifting. This algorithm, in contrast to the known prediction error histogram shifting based ones, provides a higher embedding capacity, which is achieved by employing similarity among adjacent blocks rather than simply pixels inside of a block. The imperceptibility is ensured by the premise that once the block selected is small enough, the center pixels of adjacent blocks have high probability of similarity or equality. At last, the effectiveness and performance are evaluated by experiments and the result shows that our proposed algorithm has higher capacity under the same imperceptibility compared with the classic prediction error histogram shifting based reversible watermarking algorithm as well as the state-of-the-art.\",\"PeriodicalId\":371055,\"journal\":{\"name\":\"Proceedings of the 2020 3rd International Conference on Artificial Intelligence and Pattern Recognition\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 3rd International Conference on Artificial Intelligence and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3430199.3430234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Artificial Intelligence and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3430199.3430234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A High Capacity Reversible Watermarking Algorithm Based on Block-Level Prediction Error Histogram Shifting
The paper proposes a high capacity reversible watermarking algorithm based on block-level prediction error histogram shifting. This algorithm, in contrast to the known prediction error histogram shifting based ones, provides a higher embedding capacity, which is achieved by employing similarity among adjacent blocks rather than simply pixels inside of a block. The imperceptibility is ensured by the premise that once the block selected is small enough, the center pixels of adjacent blocks have high probability of similarity or equality. At last, the effectiveness and performance are evaluated by experiments and the result shows that our proposed algorithm has higher capacity under the same imperceptibility compared with the classic prediction error histogram shifting based reversible watermarking algorithm as well as the state-of-the-art.