devbox
一键难忘520
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

论文复现代码Reversible Watermarking Algorithm Using Sorting and Prediction_复现论文代码英文

作者：一键难忘520 | 2024-06-25 22:57:34

赞

踩

复现论文代码英文

论文简述

见我文章

论文简述附复现代码Reversible Watermarking Algorithm Using Sorting and Prediction比较经典的PEE算法_zrc007007的博客-CSDN博客

复现代码

注：

代码不可商用！

代码不可商用！

代码不可商用！

  1. from skimage import io
  2. import matplotlib.pyplot as plt
  3. import numpy as np
  4.  
  5.  
  6. class Test:
  7.     def __init__(self):
  8.         self.data = np.array(
  9.             [[251, 252, 253, 253],
  10.              [252, 254, 252, 251],
  11.              [252, 252, 252, 252],
  12.              [252, 253, 252, 255]]
  13.         )
  14.  
  15.  
  16. def int2bin(x, length):
  17.     string = ''
  18.     while x != 0:
  19.         string = str(x % 2) + string
  20.         x = x // 2
  21.     if len(string) > length:
  22.         raise Exception("The length of x is longer actually!")
  23.     elif len(string) < length:
  24.         return '0' * (length - len(string)) + string
  25.     else:
  26.         return string
  27.  
  28.  
  29. def countMiu(x1, x2, x3, x4):
  30.     delta = []
  31.     miu = 0
  32.     x1 = float(x1)
  33.     x2 = float(x2)
  34.     x3 = float(x3)
  35.     x4 = float(x4)
  36.     if x4 != -1:
  37.         delta.append(abs(x1 - x2))
  38.         delta.append(abs(x2 - x3))
  39.         delta.append(abs(x3 - x4))
  40.         delta.append(abs(x4 - x1))
  41.         deltaAvg = (delta[0] + delta[1] + delta[2] + delta[3]) / 4
  42.         for i in range(4):
  43.             miu += (delta[i] - deltaAvg) ** 2
  44.         return miu / 4
  45.     elif x3 != -1:
  46.         delta.append(abs(x1 - x2))
  47.         delta.append(abs(x2 - x3))
  48.         delta.append(abs(x3 - x1))
  49.         deltaAvg = (delta[0] + delta[1] + delta[2]) / 3
  50.         for i in range(3):
  51.             miu += (delta[i] - deltaAvg) ** 2
  52.         return miu / 3
  53.     else:
  54.         return 10 ** 5
  55.  
  56.  
  57. def countPrdMiu(img, row, column):
  58.     if row == 0 and column == 0:
  59.         prd = (int(img[0][1]) + int(img[1][0])) // 2
  60.         miu = countMiu(int(img[0][1]), int(img[1][0]), -1, -1)
  61.     elif row == (img.shape[0] - 1) and column == (img.shape[1] - 1):
  62.         prd = (int(img[img.shape[0] - 2][img.shape[0] - 1]) + int(img[img.shape[0] - 1][img.shape[1] - 2])) // 2
  63.         miu = countMiu(int(img[img.shape[0] - 2][img.shape[0] - 1]), int(img[img.shape[0] - 1][img.shape[1] - 2]), -1,
  64.                        -1)
  65.     elif row == 0:
  66.         prd = (int(img[0][column - 1]) + int(img[0][column + 1]) + int(img[1][column])) // 3
  67.         miu = countMiu(int(img[0][column - 1]), int(img[0][column + 1]), int(img[1][column]), -1)
  68.     elif row == img.shape[0] - 1:
  69.         prd = (int(img[row][column - 1]) + int(img[row][column + 1]) + int(img[row - 1][column])) // 3
  70.         miu = countMiu(int(img[row][column - 1]), int(img[row][column + 1]), int(img[row - 1][column]), -1)
  71.     elif column == 0:
  72.         prd = (int(img[row - 1][0]) + int(img[row + 1][0]) + int(img[row][1])) // 3
  73.         miu = countMiu(int(img[row - 1][0]), int(img[row + 1][0]), int(img[row][1]), -1)
  74.     elif column == img.shape[1] - 1:
  75.         prd = (int(img[row - 1][column]) + int(img[row + 1][column]) + int(img[row][column - 1])) // 3
  76.         miu = countMiu(int(img[row - 1][column]), int(img[row + 1][column]), int(img[row][column - 1]), -1)
  77.     else:
  78.         prd = (int(img[row - 1][column]) + int(img[row + 1][column])
  79.                + int(img[row][column - 1]) + int(img[row][column + 1])) // 4
  80.         miu = countMiu(int(img[row - 1][column]), int(img[row + 1][column]),
  81.                        int(img[row][column - 1]), int(img[row][column + 1]))
  82.     return prd, miu
  83.  
  84.  
  85. def HistogramShift(origin, prd, Tn, Tp, b):
  86.     d = origin - prd
  87.     if Tn <= d <= Tp:
  88.         D = 2 * d + b
  89.     elif d > Tp:
  90.         D = d + Tp + 1
  91.     else:
  92.         D = d + Tn
  93.     return D
  94.  
  95.  
  96. def judgeTwiceFlow(origin, prd, Tn, Tp):
  97.     if origin < prd:
  98.         origin2 = prd + HistogramShift(origin, prd, Tn, Tp, 0)
  99.         if origin2 < 0:
  100.             return 1
  101.         else:
  102.             if prd + HistogramShift(origin2, prd, Tn, Tp, 0) < 0:
  103.                 return 0
  104.             else:
  105.                 return -1
  106.     else:
  107.         origin2 = prd + HistogramShift(origin, prd, Tn, Tp, 1)
  108.         if origin2 > 255:
  109.             return 1
  110.         else:
  111.             if prd + HistogramShift(origin2, prd, Tn, Tp, 1) > 255:
  112.                 return 0
  113.             else:
  114.                 return -1
  115.  
  116.  
  117. def embed(img, row, column, origin, prd, Tn, Tp, b):
  118.     img[row][column] = prd + HistogramShift(origin, prd, Tn, Tp, b)
  119.  
  120.  
  121. def countPosition(img, place):
  122.     row = place // img.shape[1]
  123.     if img.shape[1] % 2 == 1:
  124.         column = place % img.shape[1]
  125.     elif row % 2 == 0:
  126.         column = place % img.shape[1]
  127.     else:
  128.         column = place % img.shape[1] + 1
  129.     return row, column
  130.  
  131.  
  132. def embedOnePattern(place, Tn, Tp, P, processed):
  133.     encrypted = processed
  134.     Slsb = ''
  135.     head = int2bin(-Tn, 7) + int2bin(Tp, 7) + int2bin(len(P), 20)
  136.     row_dic = []
  137.     row_dic_list = []
  138.     row_dic_list_sorted = []
  139.     for z in range(encrypted.shape[0]):
  140.         row_dic.append({})
  141.         row_dic_list.append(z)
  142.         row_dic_list_sorted.append(z)
  143.     start = 1
  144.     locationMap = ''
  145.     needDot = True
  146.     while place < img.shape[0] * img.shape[1]:
  147.         row, column = countPosition(img, place)
  148.         if (place + 2) // img.shape[1] == row:
  149.             prd, miu = countPrdMiu(img, row, column)
  150.             origin = img[row][column]
  151.             row_dic[row][row, column, origin, prd] = miu
  152.         else:
  153.             prd, miu = countPrdMiu(img, row, column)
  154.             origin = img[row][column]
  155.             row_dic[row][row, column, origin, prd] = miu
  156.             row_dic_list[row] = list(zip(row_dic[row].values(), row_dic[row].keys()))
  157.             row_dic_list_sorted[row] = sorted(row_dic_list[row])
  158.             # 没有放在外面是因为接着判断为换行，在处理这个行尾的时候，用这个固定的row，直接sorting完这一行
  159.             for i in range(len(row_dic_list_sorted[row])):
  160.                 # 标记出位图
  161.                 if start == 1 and judgeTwiceFlow(row_dic_list_sorted[row][i][1][2],
  162.                                                  row_dic_list_sorted[row][i][1][3], Tn, Tp) >= 0:
  163.                     continue
  164.                 else:
  165.                     start = 0
  166.                     if judgeTwiceFlow(row_dic_list_sorted[row][i][1][2],
  167.                                       row_dic_list_sorted[row][i][1][3], Tn, Tp) != -1:
  168.                         locationMap += str(judgeTwiceFlow(row_dic_list_sorted[row][i][1][2],
  169.                                                           row_dic_list_sorted[row][i][1][3], Tn, Tp))
  170.         place += 2
  171.     start = 1
  172.     embedded_message = locationMap
  173.     # 利用之前算出来的sorting顺序，直接进行嵌入embed
  174.     for x in range(img.shape[0]):
  175.         for y in range(len(row_dic_list_sorted[x])):
  176.             if x * img.shape[1] + y < 34:
  177.                 encrypted[row_dic_list_sorted[x][y][1][0]][row_dic_list_sorted[x][y][1][1]] = \
  178.                     img[row_dic_list_sorted[x][y][1][0]][row_dic_list_sorted[x][y][1][1]] // 2 * 2 + int(head[0])
  179.                 Slsb += str(img[row_dic_list_sorted[x][y][1][0]][row_dic_list_sorted[x][y][1][1]] % 2)
  180.                 head = head[1:]
  181.             else:
  182.                 if start == 1:
  183.                     embedded_message = locationMap + Slsb + P
  184.                     start = 0
  185.                 d = row_dic_list_sorted[x][y][1][2] - row_dic_list_sorted[x][y][1][3]
  186.                 if Tn <= d <= Tp and len(embedded_message) > 0:
  187.                     embed(encrypted, row_dic_list_sorted[x][y][1][0], row_dic_list_sorted[x][y][1][1],
  188.                           row_dic_list_sorted[x][y][1][2], row_dic_list_sorted[x][y][1][3], Tn, Tp,
  189.                           int(embedded_message[0]))
  190.                     embedded_message = embedded_message[1:]
  191.                 else:
  192.                     embed(encrypted, row_dic_list_sorted[x][y][1][0], row_dic_list_sorted[x][y][1][1],
  193.                           row_dic_list_sorted[x][y][1][2], row_dic_list_sorted[x][y][1][3], Tn, Tp,
  194.                           0)  # 超过界限就嵌入0
  195.     if len(embedded_message) > len(P):
  196.         raise Exception("Didn't finish embedding lacation map and Slsb!")
  197.     if len(embedded_message) == 0:
  198.         print("No need to embed Dot set!")
  199.         needDot = False
  200.     return encrypted, embedded_message, needDot
  201.  
  202.  
  203. def encode(img, Tn, Tp, P):
  204.     '''
  205.     Encode the original imagine.
  206.     :param img: original imagine
  207.     :param Tn: start threshold
  208.     :param Tp: end threshold
  209.     :param P: payload
  210.     :return: The encrypted imagine and the bool value sign whether need Dot pattern encoding.
  211.     '''
  212.     if img.shape[0] * img.shape[1] < 34 * 4:
  213.         raise Exception("The imagine is too small!")
  214.     if Tn >= 0:
  215.         raise Exception("Tn need to be negative!")
  216.     if Tp < 0:
  217.         raise Exception("Tp need to be positive!")
  218.     encrypted = np.array(img)
  219.     encrypted, embedded_message, needDot = embedOnePattern(0, Tn, Tp, P, encrypted)
  220.     if needDot is True:
  221.         encrypted, embedded_message, needDot = embedOnePattern(1, Tn, Tp, P, encrypted)
  222.         if len(embedded_message) > 0:
  223.             raise Exception("Length of P,", len(P), ", is much more than this picture can be embedded!")
  224.         else:
  225.             return encrypted, True
  226.     else:
  227.         return encrypted, False
  228.  
  229.  
  230. def Slsb2int(string):
  231.     if len(string) != 34:
  232.         raise Exception("Given string's length isn't 34!")
  233.     T = [0, 0]
  234.     P = 0
  235.     cut = [string[0:7], string[7:14], string[14: 34]]
  236.     for i in range(2):
  237.         for j in range(7):
  238.             T[i] += int(cut[i][-1]) * 2 ** j
  239.             cut[i] = cut[i][0:-1]
  240.     for j in range(20):
  241.         P += int(cut[2][-1]) * 2 ** j
  242.         cut[2] = cut[2][0:-1]
  243.     return T[0], T[1], P
  244.  
  245.  
  246. def countPattenNum(isOdd, place, img):
  247.     if isOdd is False:
  248.         return img.shape[0] * img.shape[1] // 2
  249.     if isOdd is True:
  250.         if place == 0:
  251.             return img.shape[0] * img.shape[1] // 2 + 1
  252.         else:
  253.             return img.shape[0] * img.shape[1] // 2
  254.  
  255.  
  256. def judgeOnceFlow(origin, prd, Tn, Tp):
  257.     if origin < prd:
  258.         if prd + HistogramShift(origin, prd, Tn, Tp, 0) < 0:
  259.             return True
  260.         else:
  261.             return False
  262.     else:
  263.         if prd + HistogramShift(origin, prd, Tn, Tp, 1) > 255:
  264.             return True
  265.         else:
  266.             return False
  267.  
  268.  
  269. def extractPixel(origin, prd):
  270.     result = (origin - prd) % 2
  271.     return result
  272.  
  273.  
  274. def decodeShift(origin, prd, Tn, Tp):
  275.     D = origin - prd
  276.     if 2 * Tn <= D <= 2 * Tp + 1:
  277.         d = D // 2
  278.     elif D > 2 * Tp + 1:
  279.         d = D - Tp - 1
  280.     else:
  281.         d = D - Tn
  282.     return d
  283.  
  284.  
  285. def restoreImg(needResumed, message, bitNum, row_dic_list_sorted, Tn, Tp):
  286.     processed = needResumed
  287.     start = 1
  288.     bitPosition = 0
  289.     Slsb = message[bitNum:bitNum + 34]
  290.     for i in range(processed.shape[0]):
  291.         for j in range(len(row_dic_list_sorted[i])):
  292.             if i * processed.shape[0] + j < 34:
  293.                 processed[row_dic_list_sorted[i][j][1][0]][row_dic_list_sorted[i][j][1][1]] = \
  294.                     processed[row_dic_list_sorted[i][j][1][0]][row_dic_list_sorted[i][j][1][1]] - \
  295.                     processed[row_dic_list_sorted[i][j][1][0]][row_dic_list_sorted[i][j][1][1]] % 2 + int(Slsb[0])
  296.                 Slsb = Slsb[1:]
  297.             else:
  298.                 if start == 1 and judgeOnceFlow(row_dic_list_sorted[i][j][1][2],
  299.                                                 row_dic_list_sorted[i][j][1][3], Tn, Tp) is True:
  300.                     continue
  301.                 else:
  302.                     start = 0
  303.                     if judgeOnceFlow(row_dic_list_sorted[i][j][1][2],
  304.                                      row_dic_list_sorted[i][j][1][3], Tn, Tp) is False:
  305.                         processed[row_dic_list_sorted[i][j][1][0]][row_dic_list_sorted[i][j][1][1]] \
  306.                             = row_dic_list_sorted[i][j][1][3] \
  307.                               + decodeShift(row_dic_list_sorted[i][j][1][2], row_dic_list_sorted[i][j][1][3], Tn, Tp)
  308.                     else:
  309.                         if message[bitPosition] == 0:
  310.                             processed[row_dic_list_sorted[i][j][1][0]][row_dic_list_sorted[i][j][1][1]] \
  311.                                 = row_dic_list_sorted[i][j][1][3] \
  312.                                   + decodeShift(row_dic_list_sorted[i][j][1][2], row_dic_list_sorted[i][j][1][3], Tn, Tp)
  313.                         else:
  314.                             pass
  315.                         bitPosition += 1
  316.     return processed
  317.  
  318.  
  319. def decodeOnePattern(place, encrypted):
  320.     resumed = encrypted
  321.     odd = False
  322.     if encrypted.shape[0] % 2 != 0 and encrypted.shape[1] % 2 != 0:
  323.         odd = True
  324.     head = ''
  325.     start = 1
  326.     startRow = 0
  327.     message = ''
  328.     bitPosition = 0
  329.     row_dic = []
  330.     row_dic_list = []
  331.     row_dic_list_sorted = []
  332.     for z in range(encrypted.shape[0]):
  333.         row_dic.append({})
  334.         row_dic_list.append(z)
  335.         row_dic_list_sorted.append(z)
  336.     for i in range(countPattenNum(odd, place, encrypted)):
  337.         row, column = countPosition(encrypted, place)
  338.         if (place + 2) // encrypted.shape[1] == row:
  339.             prd, miu = countPrdMiu(encrypted, row, column)
  340.             modified = encrypted[row][column]
  341.             row_dic[row][row, column, modified, prd] = miu
  342.         else:
  343.             prd, miu = countPrdMiu(encrypted, row, column)
  344.             modified = encrypted[row][column]
  345.             row_dic[row][row, column, modified, prd] = miu
  346.             row_dic_list[row] = list(zip(row_dic[row].values(), row_dic[row].keys()))
  347.             row_dic_list_sorted[row] = sorted(row_dic_list[row])
  348.         place += 2
  349.     place = 0
  350.  
  351.     needBreak = False
  352.     for i in range(encrypted.shape[0]):
  353.         for j in range(len(row_dic_list_sorted[i])):
  354.             if i * encrypted.shape[1] + j >= 34:
  355.                 needBreak = True
  356.             if needBreak is True:
  357.                 break
  358.             head += str(encrypted[row_dic_list_sorted[i][j][1][0]][row_dic_list_sorted[i][j][1][1]] % 2)
  359.         if needBreak is True:
  360.             break
  361.     Tn, Tp, P = Slsb2int(head)
  362.     Tn = -Tn
  363.     if Tn >= 0:
  364.         raise Exception("The extracted Tn isn't negative!")
  365.     if Tp < 0:
  366.         raise Exception("The extracted Tp isn't positive!")
  367.  
  368.     for i in range(encrypted.shape[0]):
  369.         for j in range(len(row_dic_list_sorted[i])):
  370.             if i * encrypted.shape[1] + j < 34:
  371.                 pass
  372.             else:
  373.                 if start == 1 and judgeOnceFlow(row_dic_list_sorted[i][j][1][2],
  374.                                                 row_dic_list_sorted[i][j][1][3], Tn, Tp) is True:
  375.                     continue
  376.                 else:
  377.                     start = 0
  378.                     if judgeOnceFlow(row_dic_list_sorted[i][j][1][2],
  379.                                      row_dic_list_sorted[i][j][1][3], Tn, Tp) is False:
  380.                         D = row_dic_list_sorted[i][j][1][2] - row_dic_list_sorted[i][j][1][3]
  381.                         if 2 * Tn <= D <= 2 * Tp + 1:
  382.                             message += str(extractPixel(row_dic_list_sorted[i][j][1][2],
  383.                                                         row_dic_list_sorted[i][j][1][3]))
  384.  
  385.                     else:
  386.                         if message[bitPosition] == 0:
  387.                             D = row_dic_list_sorted[i][j][1][2] - row_dic_list_sorted[i][j][1][3]
  388.                             if 2 * Tn <= D <= 2 * Tp + 1:
  389.                                 message += str(extractPixel(row_dic_list_sorted[i][j][1][2],
  390.                                                             row_dic_list_sorted[i][j][1][3]))
  391.                             bitPosition += 1
  392.                         elif message[bitPosition] == 1:
  393.                             bitPosition += 1
  394.     resumed = restoreImg(resumed, message, bitPosition, row_dic_list_sorted, Tn, Tp)
  395.     info = message[bitPosition + 34:bitPosition + 34 + P]
  396.     return resumed, info
  397.     # 还有第二次嵌入要处理一下，到时候写
  398.  
  399.  
  400. def decode(encrypted, needDot):
  401.     '''
  402.     Decode the encrypted imagine.
  403.     :param encrypted: the encrypted imagine
  404.     :param needDot: whether you need decoding Dot set or not
  405.     :return: The original imagine and the secret information.
  406.     '''
  407.     if img.shape[0] * img.shape[1] < 34 * 4:
  408.         raise Exception("The imagine is too small!")
  409.     if needDot is False:
  410.         imagine, info = decodeOnePattern(0, encrypted)
  411.     else:
  412.         encrypted1, info1 = decodeOnePattern(1, encrypted)
  413.         imagine, info2 = decodeOnePattern(0, encrypted1)
  414.         info = info1 + info2
  415.     return imagine, info
  416.  
  417.  
  418. if __name__ == "__main__":
  419.     img = io.imread("../img/lena_gray_512.tif")  # 在这里放你要处理的图像 place your imagine here
  420.     # img = Test().data
  421.     # print(img)
  422.     encrypted, needDot = encode(img, -1, 0, '100000')
  423.     print("need Dot:", needDot)
  424.     resumedImg, info = decode(encrypted, needDot)
  425.  
  426.     print("The secret info is:", info)
  427.     print("img == resumedImg:")
  428.     print(img == resumedImg)
  429.  
  430.     plt.set_cmap(cmap="gray")
  431.     plt.subplot(131)
  432.     plt.imshow(img)
  433.     plt.title("Original imagery")
  434.     plt.subplot(132)
  435.     plt.imshow(encrypted)
  436.     plt.title("Encrypted imagery")
  437.     plt.subplot(133)
  438.     plt.imshow(resumedImg)
  439.     plt.title("Resumed imagery")
  440.     plt.show()

结果如下：

代码只写了处理嵌入Cross集的，如果嵌入信息超过Cross集容量上限而要用到Dot集嵌入的我还没写完，看以后有机会补充没有。 

声明：本文内容由网友自发贡献，转载请注明出处：【wpsshop博客】
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号