CN110009548B - Multi-image watermarking method based on secret sharing and histogram shifting - Google Patents

Multi-image watermarking method based on secret sharing and histogram shifting Download PDF

Info

Publication number
CN110009548B
CN110009548B CN201910271146.2A CN201910271146A CN110009548B CN 110009548 B CN110009548 B CN 110009548B CN 201910271146 A CN201910271146 A CN 201910271146A CN 110009548 B CN110009548 B CN 110009548B
Authority
CN
China
Prior art keywords
image
shadow
images
watermark
steps
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910271146.2A
Other languages
Chinese (zh)
Other versions
CN110009548A (en
Inventor
张晓强
赵卓影
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China University of Mining and Technology CUMT
Original Assignee
China University of Mining and Technology CUMT
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China University of Mining and Technology CUMT filed Critical China University of Mining and Technology CUMT
Priority to CN201910271146.2A priority Critical patent/CN110009548B/en
Publication of CN110009548A publication Critical patent/CN110009548A/en
Application granted granted Critical
Publication of CN110009548B publication Critical patent/CN110009548B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G06T1/0092—Payload characteristic determination in a watermarking scheme, e.g. number of bits to be embedded
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2201/00—General purpose image data processing
    • G06T2201/005—Image watermarking
    • G06T2201/0065—Extraction of an embedded watermark; Reliable detection
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2201/00—General purpose image data processing
    • G06T2201/005—Image watermarking
    • G06T2201/0203—Image watermarking whereby the image with embedded watermark is reverted to the original condition before embedding, e.g. lossless, distortion-free or invertible watermarking

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Image Processing (AREA)

Abstract

The invention discloses a multi-image watermarking method based on secret sharing and histogram translation, and relates to the technical field of image processing. Aiming at the problems of small embedding capacity and weak safety of the conventional image watermarking method, a secret sharing method is utilized to decompose one watermark image into a plurality of shadow images, and then the shadow images are respectively embedded into a plurality of carrier images by a histogram translation method, so that a multi-image watermarking method based on secret sharing and histogram translation is provided. In the method, if only one shadow image is provided, the watermark image cannot be extracted, and other shadow images are needed, so that the safety of the image watermarking method is improved. Meanwhile, the embedding capacity of the image watermarking method can be enlarged by increasing the number of carrier images.

Description

Multi-image watermarking method based on secret sharing and histogram shifting
Technical Field
The invention relates to the technical field of image processing, in particular to a multi-image watermark embedding and extracting method.
Background
The image is an important carrier of network information. About 70% of the information from human beings is from vision, as counted by psychologists. The increase of shooting equipment and the convenience of shooting lead to the wide application of images in the fields of military, medical treatment, weather, electronic government affairs, personal affairs and the like. The image copyright protection consciousness of people is gradually enhanced, and the image watermark is a technology for protecting the image copyright. However, the increase in hacking capability and the ease of image replication and propagation present new challenges to image watermarking technology.
Aiming at the problems of small embedding capacity and weak safety of the conventional image watermarking algorithm, a secret sharing method is utilized to decompose one watermark image into a plurality of shadow images, and then the shadow images are respectively embedded into a plurality of carrier images by a histogram translation method, so that a multi-image watermarking method based on secret sharing and histogram translation is provided. In the method, if only one shadow image is provided, the watermark image cannot be extracted, and other shadow images are needed, so that the safety of the image watermarking method is improved. Meanwhile, the embedding capacity of the image watermarking method can be enlarged by increasing the number of carrier images.
Disclosure of Invention
The purpose of the invention is that: aiming at the problems of small embedding capacity and weak safety of the existing image watermarking method, the multi-image watermarking method based on secret sharing and histogram translation is provided.
The technical scheme of the invention is as follows: in order to achieve the above purpose, the technical scheme adopted is a multi-image watermarking method based on secret sharing and histogram translation, and the steps of watermark image embedding and extracting are detailed as follows:
step 1: setting watermark image asWWill beWImage decomposition intonThe shadow image isW 1 , W 2 , …, W p ；
Step 2: is provided withp(p<n) The image of the carrier beingI 1 , I 2 , …, I p From the slavenOptionally in shadow imagespThe web isW 1 , W 2 , …, W p As watermark information, it willpEmbedding shadow images intopIn the image of the carrier, can be obtainedpWeb of watermark imageI 1 W , I 2 W , …, I p W ；
Step 3: for water-bearing printed imagesI 1 W , I 2 W , …, I p W Respectively extract outpShadow imagesW 1 , W 2 , …, W p And recovering the watermark image by using the shadow imagesW；
Step 4: by shifting the histogrampWeb of watermark imageI 1 W , I 2 W , …, I p W Restoring the original carrier imageI 1 , I 2 , …, I p 。
Further, in the step 1, the image decomposition means: according to Lagrange interpolation polynomial shown in formula (1), letw ij ∈WAndm 0 =w ij ，
f(x)= m 0 +m 1 x+m 2 x 2 +…+m k-1 x k-1 ； （1）
Optionalk-1 value assignment tom 1 , m 2 , …, m k-1 The method comprises the steps of carrying out a first treatment on the surface of the Input devicenDifferent valuesx 1 , x 2 , …, x n Respectively calculatew ij 1 =f(x 1 ), w ij 2 =f(x 2 ), …, w ij n =f(x n ) The method comprises the steps of carrying out a first treatment on the surface of the Similarly, toWAll pixels in the array are subjected to the operation to obtainnShadow imageW 1 ={ w ij 1 }, W 2 ={ w ij 2 }, …, W n ={ w ij n }。
Further, in the step 2, the embedding process is as follows: is provided withp（p<n) The image of the carrier beingI 1 , I 2 , …, I p From the slavenOptionally in shadow imagespThe web is not jeopardizedW 1 , W 2 , …, W p As watermark information; drawingI 1 Finding the maximum point of the histogramaAnd find the minimum point to the right of the maximum pointbThe method comprises the steps of carrying out a first treatment on the surface of the The images are scanned sequentially first when the scanned pixel value is [ [a+1, b]When the value in the pixel is the same, adding 1 to the value of the pixel, and keeping other pixel values unchanged; scanning the carrier image when the scanned pixel value isaEmbedding 1-bit shadow information in the pixel pointw ij 1 ∈W 1 And is also provided withw ij 1 E {0,1}; the embedding rule is as follows: if the embedded watermark shadow information is 0, the pixel value of the point is unchanged; if the embedded shadow information is 1, adding 1 to the pixel value of the point; similarly, the shadow image is formedW 2 , W 3 , …, W p Respectively embedded intoI 2 , I 3 , …, I p The final water-containing print image isI 1 W , I 2 W , …, I p W 。
Further, in the step 3, the extraction process is as follows: for water-bearing printed imagesI 1 W Sequentially scanning the pixel values of (1), if the scanned pixel values areaThe restored shadow information is '0'; if the scanned pixel value isa+1, the restored shadow information is '1', thereby restoring the shadow imageW 1 The method comprises the steps of carrying out a first treatment on the surface of the Similarly, a watermarked image may be extractedI 2 W , I 3 W , …, I p W In (a) and (b)p-1 shadow imageW 2 , W 3 , …, W p 。
Further, in the step 3, the recovery process is as follows: will bepDifferent%x 1 , w ij 1 ), (x 2 , w ij 2 ), …, (x p , w ij p ) Substituting formula (1) separately yields the following equation set:
w ij 1 (x 1 )= m 0 + m 1 x 1 + m 2 x 1 2 + … + m k-1 x 1 k-1
w ij 2 (x 2 )= m 0 + m 1 x 2 + m 2 x 2 2 + … + m k-1 x 2 k-1
…； （2）
w ij p (x p )= m 0 + m 1 x p + m 2 x p 2 + … + m k-1 x p k-1
by solving equation set (2), it is possible to obtainm 0 , m 1 , m 2 , …, m k-1 Of (2), whereinm 0 I.e. the pixel values of the watermark image to be restoredw ij The method comprises the steps of carrying out a first treatment on the surface of the Similarly, all pixels in the shadow image are processed, and finally the watermark image can be restored.
Further, in the step 4, the process of translating the histogram is: sequential scanning of watermark-containing imagesI 1 W When scanning to [a+1, b]When the pixel value in the image is reduced by 1, the pixel value in other cases is kept unchanged, and the original carrier image can be recoveredI 1 The method comprises the steps of carrying out a first treatment on the surface of the Similarly, one can recover in turnI 2 , I 3 , …, I p 。
The beneficial effects are that: aiming at the problems of small embedding capacity and weak safety of the existing image watermark embedding and extracting method, the invention provides a multi-image watermark method based on secret sharing and histogram translation. The main contributions are: (1) Decomposing a watermark image into parts by using a secret sharing methodnThe shadow image must be extracted frompThe watermark images can be recovered by combining the shadow images, and if only one shadow image is obtained, the watermark images cannot be obtained, so that the safety of the image watermarking method is effectively improved; (2) The proposed new method willpThe shadow images are respectively embedded intopThe embedding capacity of the watermark algorithm is enlarged in the image of the carrier; meanwhile, the user can control the size of the embedded capacity by adjusting the number of the carrier images according to the actual application requirement. Therefore, the novel multi-image watermarking method has the characteristics of high safety and large embedding capacity.
Drawings
Fig. 1: watermarking the image;
fig. 2: a shadow image;
fig. 3: a carrier image;
fig. 4: a histogram of the Pepper image;
fig. 5: a watermark-containing image;
fig. 6: the extracted watermark image.
Detailed Description
The practice of the invention is described in further detail below with reference to the attached drawings and examples.
The programming software used was Matlab R2016a and a Lena gray scale image of size 50 x 50 was selected as the watermark image, as shown in fig. 1. 8 carrier images of Pepper, baboon, pens and the like with the size of 512 multiplied by 512 are selectedI 1 , I 2 , …, I 8 As shown in fig. 3. In one experiment, the number of shadow images is generatednTaking the sample out of the container 8,ktaking 7. By adopting the method, the detailed process of embedding and extracting the watermark is described as follows.
Step 1: setting watermark image asWWill beWThe image is decomposed into 8 shadow imagesW 1 , W 2 , …, W 8 ；
Step 2: let 8 carrier images beI 1 , I 2 , …, I 8 8 shadow images are respectively embedded into 8 carrier images, 8 watermark images can be obtainedI 1 W , I 2 W , …, I 8 W ；
Step 3: for water-bearing printed imagesI 1 W , I 2 W , …, I 8 W Respectively extracting 8 shadow imagesW 1 , W 2 , …, W 8 And recovering the watermark image by using the shadow imagesW；
Step 4: from 8 watermark images by shifting the histogramI 1 W , I 2 W , …, I 8 W Restoring the original carrier imageI 1 , I 2 , …, I 8 。
Further, in the step 1, the image decomposition means: according to Lagrange interpolation polynomial shown in formula (3), letw ij ∈WAndm 0 =w ij ，
f(x)= m 0 +m 1 x+m 2 x 2 +…+m 6 x 6 ； （3）
optionally 6 values are assigned tom 1 , m 2 , …, m 6 The method comprises the steps of carrying out a first treatment on the surface of the 8 different values are inputx 1 , x 2 , …, x 8 Respectively calculatew ij 1 =f(x 1 ), w ij 2 =f(x 2 ), …, w ij 8 =f(x 8 ) The method comprises the steps of carrying out a first treatment on the surface of the Similarly, toWAll pixels in the image are subjected to the operation, so that 8 shadow images can be obtainedW 1 ={ w ij 1 }, W 2 ={ w ij 2 }, …, W 8 ={ w ij 8 }。
Further, in the step 2, the embedding process is as follows: let 8 carrier images beI 1 , I 2 , …, I 8 Drawing and paintingI 1 Finding the maximum point of the histogram to be 96, and finding the minimum point to be 226 on the right side of the maximum point; the images are scanned sequentially first, when the scanned pixel value is [97, 226]When the value in the pixel is the same, adding 1 to the value of the pixel, and keeping other pixel values unchanged; scanning the carrier image, embedding 1-bit shadow information into the pixel point when the scanned pixel value is 96w ij 1 ∈W 1 And is also provided withw ij 1 E {0,1}; the embedding rule is as follows: if the embedded watermark shadow information is 0, the pixel value of the point is unchanged; if the embedded shadow information is 1, adding 1 to the pixel value of the point; similarly, the shadow image is formedW 2 , W 3 , …, W 8 Respectively embedded intoI 2 , I 3 , …, I 8 The final water-containing print image isI 1 W , I 2 W , …, I 8 W 。
Further, in the step 3, the extraction process is as follows: for water-bearing printed imagesI 1 W Sequentially scanning the pixel values of (2), and if the scanned pixel value is 96, restoring the shadow information to be 0'; if the scanned pixel value is 97, the restored shadow information is '1', thereby restoring the shadow imageW 1 The method comprises the steps of carrying out a first treatment on the surface of the Similarly, a watermarked image may be extractedI 2 W , I 3 W , …, I 8 W 7 shadow images in (a)W 2 , W 3 , …, W 8 。
Further, in the step 3, the recovery process is as follows: 8 different kinds ofx 1 , w ij 1 ), (x 2 , w ij 2 ), …, (x 8 , w ij 8 ) Substituting formula (1) separately yields the following equation set:
w ij 1 (x 1 )= m 0 + m 1 x 1 + m 2 x 1 2 + … + m 6 x 1 6
w ij 2 (x 2 )= m 0 + m 1 x 2 + m 2 x 2 2 + … + m 6 x 2 6
…； （2）
w ij 8 (x 8 )= m 0 + m 1 x 8 + m 2 x 8 2 + … + m 6 x 8 6
by solving equation set (2), it is possible to obtainm 0 , m 1 , m 2 , …, m 6 Of (2), whereinm 0 I.e. the pixel values of the watermark image to be restoredw ij The method comprises the steps of carrying out a first treatment on the surface of the In a similar manner to that described above,and processing all pixels in the shadow image, and finally recovering the watermark image.
Further, in the step 4, the process of translating the histogram is: sequential scanning of watermark-containing imagesI 1 W When scanning to [96, 226]When the pixel value in the image is reduced by 1, the pixel value in other cases is kept unchanged, and the original carrier image can be recoveredI 1 The method comprises the steps of carrying out a first treatment on the surface of the Similarly, one can recover in turnI 2 , I 3 , …, I 8 。

Claims (1)

1. The multi-image watermarking method based on secret sharing and histogram shifting is characterized by comprising the following steps of:
step 1: let the watermark image be W, decompose the W image into n shadow images, namely W 1 ,W 2 ,…,W n The method comprises the steps of carrying out a first treatment on the surface of the The image decomposition specific operation is as follows: let w be according to Lagrange's interpolation polynomial shown in equation (1) ij E W and m 0 ＝w ij ，
f(x)＝ m 0 +m 1 x+m 2 x 2 +…+m k-1 x k-1 ； (1)
Optionally k-1 values are assigned to m 1 ,m 2 ,…,m k-1 The method comprises the steps of carrying out a first treatment on the surface of the Inputting n different values x 1 ,x 2 ,…,x n Respectively calculate w ij 1 ＝f(x 1 ),w ij 2 ＝f(x 2 ),…,w ij n ＝f(x n ) The method comprises the steps of carrying out a first treatment on the surface of the Similarly, performing the above operation on all pixels in W to obtain n shadow images W 1 ＝{w ij 1 },W 2 ＝{w ij 2 },…,W n ＝{w ij n }；
Step 2: let p (p)<n) carrier images are I 1 ,I 2 ,…,I p Optionally p or W from n shadow images 1 ,W 2 ,…,W p As watermark information, p shadow images are embedded into p carrier images, so that p watermark images I can be obtained 1 W ,I 2 W ,…,I p W The method comprises the steps of carrying out a first treatment on the surface of the The embedding process is as follows: let p (p)<n) carrier images are I 1 ,I 2 ,…,I p Optionally, p shadow images from n shadow images may be used to define W 1 ,W 2 ,…,W p As watermark information; drawing I 1 Finding out the maximum value point a of the histogram, and finding out the minimum value point b on the right side of the maximum value point; sequentially scanning the images, when the scanned pixel value is [ a+1, b]When the value in the pixel is the same, adding 1 to the value of the pixel, and keeping other pixel values unchanged; scanning the carrier image, and embedding 1-bit shadow information w into the pixel point when the scanned pixel value is a ij 1 ∈W 1 And w is ij 1 E {0,1}; the embedding rule is as follows: if the embedded watermark shadow information is 0, the pixel value of the point is unchanged; if the embedded shadow information is 1, adding 1 to the pixel value of the point; similarly, the shadow image W 2 ,W 3 ,…,W p Respectively embedded into I 2 ,I 3 ,…,I p The final water-contained printing image is I 1 W ,I 2 W ,…,I p W ；
Step 3: for water-bearing print image I 1 W ,I 2 W ,…,I p W P shadow images W are extracted respectively 1 ,W 2 ,…,W p And recovering the watermark image W by using the shadow images; the extraction process comprises the following steps: for water-bearing print image I 1 W Sequentially scanning the pixel values of (a), and if the scanned pixel value is a, restoring shadow information to be 0'; if the scanned pixel value is a+1, the restored shadow information is '1', and the shadow image W is restored 1 The method comprises the steps of carrying out a first treatment on the surface of the Similarly, the watermark-containing image I can be extracted 2 W ,I 3 W ,…,I p W P-1 shadow images W in 2 ,W 3 ,…,W p The method comprises the steps of carrying out a first treatment on the surface of the The recovery process is as follows: p different (x 1 ,w ij 1 ),(x 2 ,w ij 2 ),…,(x p ,w ij p ) Substituting formula (1) separately yields the following equation set:
by solving equation set (2), m can be obtained 0 ,m 1 ,m 2 ,…,m k-1 Wherein m is 0 I.e. the pixel value w of the watermark image to be restored ij The method comprises the steps of carrying out a first treatment on the surface of the Similarly, all pixels in the shadow image are processed, and finally, the watermark image can be restored;
step 4: from p watermark images I by shifting the histogram 1 W ,I 2 W ,…,I p W Restoring the original carrier image I 1 ,I 2 ,…,I p The method comprises the steps of carrying out a first treatment on the surface of the The translation histogram process is: sequential scanning of watermark-containing images I 1 W When scanning to [ a+1, b ]]When the pixel value in the image is reduced by 1, the pixel value in other cases is kept unchanged, and the original carrier image I can be recovered 1 The method comprises the steps of carrying out a first treatment on the surface of the Similarly, I can be recovered in turn 2 ,I 3 ,…,I p 。
CN201910271146.2A 2019-04-04 2019-04-04 Multi-image watermarking method based on secret sharing and histogram shifting Active CN110009548B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910271146.2A CN110009548B (en) 2019-04-04 2019-04-04 Multi-image watermarking method based on secret sharing and histogram shifting

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910271146.2A CN110009548B (en) 2019-04-04 2019-04-04 Multi-image watermarking method based on secret sharing and histogram shifting

Publications (2)

Publication Number Publication Date
CN110009548A CN110009548A (en) 2019-07-12
CN110009548B true CN110009548B (en) 2023-10-27

Family

ID=67169936

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910271146.2A Active CN110009548B (en) 2019-04-04 2019-04-04 Multi-image watermarking method based on secret sharing and histogram shifting

Country Status (1)

Country Link
CN (1) CN110009548B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102567942A (en) * 2012-01-09 2012-07-11 中山大学 Reversible watermark method utilizing histogram shifting

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102567942A (en) * 2012-01-09 2012-07-11 中山大学 Reversible watermark method utilizing histogram shifting

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
一种基于直方图平移的高性能可逆水印算法;王俊祥等;《自动化学报》;20120131;第38卷(第1期);第88-96页 *
基于二维直方图平移的可逆图像水印算法;李丁盛等;《计算机工程与设计》;20180930;第39卷(第9期);第2867-2872页 *
基于秘密分享的DCT 域数字图像水印算法;田红磊;《电子设计工程》;20130228;第21卷(第4期);第152-155页 *

Also Published As

Publication number Publication date
CN110009548A (en) 2019-07-12

Similar Documents

Publication Publication Date Title
Ali et al. Differential evolution algorithm for the selection of optimal scaling factors in image watermarking
Hosam Attacking image watermarking and steganography-a survey
Dogan et al. A robust color image watermarking with Singular Value Decomposition method
Aberna et al. Digital image and video watermarking: methodologies, attacks, applications, and future directions
Pal et al. Weighted matrix based reversible watermarking scheme using color image
Yang et al. A geometric correction based robust color image watermarking scheme using quaternion exponent moments
Yuan et al. Adversarial dual network learning with randomized image transform for restoring attacked images
Deng et al. Color image watermarking using regularized extreme learning machine
Singh et al. Efficient watermarking method based on maximum entropy blocks selection in frequency domain for color images
Ahn et al. Local-source enhanced residual network for steganalysis of digital images
Singh et al. Transform domain techniques for image steganography
CN110009548B (en) Multi-image watermarking method based on secret sharing and histogram shifting
CN109255748B (en) Digital watermark processing method and system based on double-tree complex wavelet
Shih et al. Intelligent watermarking for high-capacity low-distortion data embedding
Wajid et al. Robust and imperceptible image watermarking using full counter propagation neural networks
Sharma et al. Dual domain robust watermarking scheme using random DFRFT and least significant bit technique
Bansal et al. Watermarking using neural network and hiding the trained network within the cover image
Khorrami et al. A svd-chaos digital image watermarking scheme based on multiple chaotic system
CN112529760A (en) Image privacy protection filter generation method based on anti-noise and cloud separation
Du et al. BSS: A new approach for watermark attack
Abdallah et al. SVD-based watermarking scheme in complex wavelet domain for color video
Rashid et al. Covert exchange of face biometric data using steganography
Sun et al. A secure multimodal biometric verification scheme
Khosravi et al. A secure joint wavelet based steganography and secret sharing method
Padeppagol et al. Design and implementation of lifting based wavelet and adaptive LSB steganography to secret data sharing through image on FPGA

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant