计算机应用 ›› 2010, Vol. 30 ›› Issue (11): 3040-3043.

• 信息安全 • 上一篇    下一篇

基于预测与排序的大容量可逆水印算法

蒋华1,邓雄1,刘燕丽2,刘同来2   

  1. 1. 桂林电子科技大学
    2. 桂林电子科技大学 计算机与控制学院
  • 收稿日期:2010-04-28 修回日期:2010-07-09 发布日期:2010-11-05 出版日期:2010-11-01
  • 通讯作者: 蒋华

High capacity reversible watermarking algorithm based on prediction and sorting

  • Received:2010-04-28 Revised:2010-07-09 Online:2010-11-05 Published:2010-11-01

摘要: 针对大多数情况下可逆水印算法需要位图的情况,提出了一个不需要位图的可逆水印算法。该算法使用一种新的基于高效排序的全邻预测算法,经过排序以后形成预测误差集合,可以在很低失真度的情况下嵌入数据。实验的结果表明,该算法优于现有的可逆水印算法,并可以在具有较小失真度的情况下嵌入大量的数据。

关键词: 大容量, 可逆水印, 排序, 菱形预测, 直方图平移

Abstract: Concerning most of the existing reversible watermarking algorithms need a location map, this paper presented a reversible watermarking algorithm for images without using a location map. This algorithm employed full-enclosing prediction based on a new high efficient sorting technique and results in a forecast error set after sorting, which could embed data with a low distortion. The experimental results clearly indicate that this scheme is superior to most of the existing reversible watermarking algorithms and can embed large data with low distortion.

Key words: high capcity, reversible watermarking, sorting, rhombus prediction, histogram shifting