CN110232651B - Reversible information hiding method based on block prediction and differential value histogram translation - Google Patents
Reversible information hiding method based on block prediction and differential value histogram translation Download PDFInfo
- Publication number
- CN110232651B CN110232651B CN201910503610.6A CN201910503610A CN110232651B CN 110232651 B CN110232651 B CN 110232651B CN 201910503610 A CN201910503610 A CN 201910503610A CN 110232651 B CN110232651 B CN 110232651B
- Authority
- CN
- China
- Prior art keywords
- watermark
- image
- difference
- value
- pixel
- 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
Links
Images
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/0085—Time domain based watermarking, e.g. watermarks spread over several images
-
- 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/0051—Embedding of the watermark in the spatial domain
-
- 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/0061—Embedding of the watermark in each block of the image, e.g. segmented watermarking
-
- 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
Abstract
The invention discloses a reversible information hiding method based on block prediction and difference histogram translation, which belongs to the field of digital watermarking and information hiding, and comprises the steps of firstly dividing an image into 4 × 4 image blocks, then carrying out three-neighborhood block division, selecting one pixel and three pixels around the pixel, generating a predicted value by using three pixels around the pixel, comparing the predicted value with the selected pixel to generate a difference value, rounding the difference value downwards, generating four difference values in one image block, and then generating a difference histogram. The invention improves the embedding capacity of the watermark, simplifies the algorithm steps on the premise of keeping the visual effect of the image, and only needs to divide the block before embedding and extracting the watermark; the method can realize reversible watermarking, has good watermark invisibility, simple and easy experiment, high PSNR of the image after the watermark is embedded, good image visual effect and practical value.
Description
Technical Field
The invention belongs to the field of digital watermarking and information hiding, and particularly relates to a reversible information hiding method based on block prediction and differential value histogram translation.
Background
Along with the improvement of the safety awareness and intellectual property awareness of people, the safety degree of self information of people is more and more emphasized, and the use of a digital watermarking technology is more and more increased. Image digital watermarking techniques are classified into reversible and irreversible watermarking techniques according to whether an embedded watermark image can be restored. Reversible watermarks are increasingly used in order to protect the integrity of images. The reversible watermark is also called lossless watermark, belongs to fragile digital watermark, can obviously reflect whether the signal is tampered, can recover the original image without loss after the watermark is extracted, and is suitable for the authentication of the integrity of the image. Therefore, the reversible image watermarking technology is mainly used in the special fields of medicine, military, law and the like, and is used for reserving and storing pictures to ensure that important image information is not lost.
The watermark embedding method disclosed in the document "NIZ, SHI Y Q, ANSARI N, et al.reversible data embedding" (IEEE Trans on Circuits and Systems for Video Tech-homology, 2006,16 (3): 354-362.) has the advantages that the algorithm is easy to realize, the embedding capacity mainly depends on the peak point, but the peak point is not prominent when the method is used for the image with balanced pixel values, and therefore the algorithm has no good effect. The document "thick D M, roduguez J. expansion embedding technique for reversible watermarking" (IEEE transactions on Image Processing,2007,16(3):721 and 730) proposes that a predicted value can be generated by calculation of adjacent pixels, and that a difference value can be made between the predicted value and an original value to embed a watermark, and that more peripheral pixels are relied on, occupying the embedding capacity.
Disclosure of Invention
Aiming at the technical problems in the prior art, the invention provides a reversible information hiding method based on block prediction and differential histogram translation, which is reasonable in design, overcomes the defects of the prior art and has a good effect.
In order to achieve the purpose, the invention adopts the following technical scheme:
a reversible information hiding method based on block prediction and difference value histogram translation comprises the following steps:
step 1: let the original image be a grayscale image of M × N, and divide the original image into 4 × 4 image blocks, denoted as BkWherein k is 1,2,3. [ M/4 ]]*[N/4];
Step 2: for each 4 x 4 image block BkBlock processing is performed, and every four pixels are taken as a group and denoted as bkm,m=1,2,3,4;bkmThe internal pixel is represented asn is 1,2,3, 4; record ask represents the number of big blocks, m represents a small block in a big block, and n represents a specific pixel; taking four pixels including no mark, a transverse line, a diagonal line and a vertical line as a group, wherein the pixel marked with black in the middle is used for making a difference value with the pixel of the pixel, and the pixel marked with black is an embedding point of the watermark;
And 4, step 4: will be provided withTrue and predicted values ofCalculating the differenceBy analogy, willTrue and predicted values ofCalculating the difference
step 6: performing translation processing on the difference histogram, and integrally translating a unit to the right for a part of the difference histogram with a pixel value larger than 0, and reserving a blank at a position of the difference histogram with the pixel value of 1;
and 7: judging the embedding capacity according to the difference histogram, selecting a watermark picture, and embedding the watermark; the method specifically comprises the following steps:
step 7.1: carrying out watermark embedding from the first block, and judging whether a first embedding point is a pixel point capable of embedding a watermark or not; if the difference is not the sameIf the pixel point is 0, the pixel point is an embeddable point and a watermark is embedded; if the difference is not the sameIf not, not embedding the watermark, continuing to judge a second embedding point in the block until four points in the 4 x 4 block are judged in sequence, then continuing to perform the process on the next block, and then sequentially performing the process;
step 7.2: processing the watermark image, making a binary watermark image into a watermark sequence for embedding, setting a watermark embedding termination value according to the size of the watermark image, wherein the termination value is the size of the watermark image, and the pixel value of the image after embedding the watermark is as follows:
wherein, I (I, j) (I (I, j) is more than or equal to 0 and less than or equal to 255) is the gray value of the original image, W is the watermark sequence, I isW(i, j) represents pixel values of the image after embedding the watermark;
and 8: watermark extraction and image recovery; the method specifically comprises the following steps:
step 8.1: extracting watermarks from the first block, and judging each embedded point; if it isThe difference value is 1, the embedded watermark value is 1, and 1 is extracted; if the difference is not the sameIf the value is 0, the embedded watermark value is 0, and 0 is extracted; then, continuously judging a second embedded point in the block until four points in the 4 x 4 block are sequentially judged, then continuously performing the process on the next block, and then sequentially performing the process;
step 8.2: after the watermark is extracted, restoring the image, and translating the pixel points with the difference value larger than 1 in the difference value histogram to the left by one bit to obtain an original image; the gray scale values of the original image are as follows:
the invention has the following beneficial technical effects:
the invention discloses a reversible information hiding method based on block prediction and differential histogram translation, aiming at the problems of complicated steps and troublesome realization of a reversible watermark algorithm, and simultaneously improving the embedding capacity of a watermark, on the premise of keeping the visual effect of an image, simplifying the steps of the algorithm, before embedding and extracting the watermark, only needing to carry out block division without carrying out complex pretreatment, and increasing the embedding capacity of the watermark in the differential histogram algorithm; compared with the traditional method of selecting 3 x 3 blocks, the method of predicting the central pixel by using the eight surrounding pixels can increase the number of embeddable pixel points, thereby increasing some embedding capacity; compared with a mode of directly adopting histogram translation, the method can improve the steepness of the watermark histogram, highlight the number of pixels at peak points, and avoid the problem of low capacity of the histogram translation embedded watermark caused by uniform distribution of pixel values; meanwhile, the PSNR value can be improved, so that the visual effect of the image containing the watermark is improved; the application provides a method for partitioning three neighborhoods, wherein partitioning prediction is carried out according to the smoothness of an image, 4 x 4 partitioning is carried out on a carrier image, then the partitioning is carried out to form a group of four pixels, finally, prediction difference histogram translation is carried out in the partitioning to realize watermark embedding, then, marking information of the carrier image is embedded through a reversible watermark technology, whether a ciphertext is damaged or not is judged through the completeness of the watermark, and finally, an original image can be recovered without distortion; the method of the invention not only can realize reversible watermarking, but also has good watermark invisibility, simple and easy experiment, and high PSNR of the image after embedding the watermark; the method of the invention can not only increase the embedding capacity, but also ensure the accuracy of the neighborhood prediction, and has good image visual effect and practical value.
Drawings
Fig. 1 is a schematic diagram of a 4 × 4 block image.
FIG. 2 is a block image diagram according to the present invention.
Fig. 3 is a watermark embedding flowchart.
Fig. 4 is a watermark extraction flow chart.
Detailed Description
The invention is described in further detail below with reference to the following figures and detailed description:
a reversible information hiding method based on block prediction and difference value histogram translation comprises the following steps:
step 1: let the original image be a grayscale image of M × N, and divide the original image into 4 × 4 image blocks, denoted as BkWherein k is 1,2,3. [ M/4 ]]*[N/4](ii) a As shown in fig. 1.
Step 2: for each 4 x 4 image block BkBlock processing is performed, and every four pixels are taken as a group and denoted as bkm,m=1,2,3,4;bkmThe internal pixel is represented asn is 1,2,3, 4; record asMake itAt the middle of four pixels, k represents the second largest blockM represents a small block in a large block, and n represents a specific pixel. Four pixels of each mark (no mark, horizontal line, oblique line, vertical line) are used as a group, the middle black marked pixel is used for making a difference value with the pixel of the middle mark, and the black marked pixel is the embedding point of the watermark, as shown in fig. 2.
And 4, step 4: will be provided withTrue and predicted values ofCalculating the differenceBy analogy, willTrue and predicted values ofCalculating the difference
step 6: partitioning and judging the original imageWhether the pixel point is the pixel point which can be embedded with the watermark or not is judged, if the difference value is 0, the pixel point is the embeddable point, and the 1-bit watermark is embedded; if the difference is not 0, the watermark is not embedded, the steps 1 and 2 are executed, and the next pixel point is continuously judged;
watermark embedding, the flow of which is shown in figure 3,
setting the image size as M × N and its grey value as I (I, j) (I (I, j) is greater than or equal to 0 and less than or equal to 255), converting the watermark image into watermark sequence W, selecting 64 × 64 binary watermark image, converting into 1 × 4096 watermark sequence, embedding watermark into pixel value of image, and using I to make pixel value of image be converted into pixel value of watermarkW(i, j) represents;
the watermark embedding process is as follows:
first, the original image is subjected to the blocking processing according to the modes of fig. 1 and fig. 2, and the embedding point of the original image can be known after the blocking.
And then calculating the blocked pixel blocks to obtain difference values, and generating a difference value histogram by using the obtained difference values. And (4) performing translation processing on the difference histogram, and integrally translating the part of the difference histogram, of which the pixel value is greater than 0, to the right by one unit, so that a blank is left at the position of the difference histogram, of which the pixel value is 1.
Watermark embedding is carried out from the first block, embedding points are judged, whether the difference value is zero or not is judged, and the watermark is embedded if the difference value is zero; and (4) continuing to judge a second embedded point in the block when the difference value is not zero, and continuing to perform the process on the next block after sequentially judging four points in the 4 x 4 block, and then sequentially performing the process. The formula is as follows:
processing the watermark image, making the binary watermark image into a watermark sequence for embedding, and setting a watermark embedding termination value according to the size of the watermark image, wherein the termination value is the size of the watermark image.
Watermark extraction and image restoration, the flow of which is shown in figure 4,
firstly, watermark extraction is carried out, the image embedded with the watermark is processed, and the blocking mode is still the blocking processing according to the modes of figure 1 and figure 2.
Still utilizeThree pixel predictionThe predicted value of the pixel is then usedThe true values of (a) are differenced.
Then, a difference value histogram is generated by utilizing the difference value, because the watermark is embedded when the difference value is 0, the difference value is 1, the embedded watermark value is proved to be 1, then the watermark is extracted from the first block in the same sequence as the embedded watermark, each embedded point is judged, if the difference value is 1, the embedded watermark value is 1, and 1 is extracted; if the difference is 0, the embedded watermark value is 0, and 0 is extracted. And then, continuously judging a second embedded point in the block, and after sequentially judging four points in the 4 x 4 block, continuously performing the process on the next block, and then sequentially performing the process.
Because a pixel with a difference value histogram larger than 0 is shifted by a unit to the right when the watermark is embedded, the number of pixel points with a pixel value of 1 is 0 before the watermark is embedded, so that the obtained difference value is judged when the watermark is extracted, if the obtained difference value point is 0, the embedded watermark value is 0, and if the obtained difference value point is 1, the embedded watermark value is 1. The formula is as follows:
and finally, after the watermark is extracted, restoring the image, and translating the pixel points with the difference value larger than 1 in the difference value histogram to the left by one bit to obtain the original image.
The reversible watermark algorithm is usually complex, so that the block prediction difference value histogram provided by the invention is simpler to realize for gray level images, and is higher in capacity than the standard watermark embedding method taking eight neighborhoods as prediction, but the embedding capacity of the watermark is less on the whole, the embedding and extraction of the watermark are simple and understandable, and the PSNR (Peak Signal to Noise Ratio) value is more than 56. The pixel value of the image is modified little, and after the watermark is proposed, the image can be restored without distortion, and the reversible watermark is realized.
PSNR, peak signal-to-noise ratio, is an objective measure of image distortion or noise level. The larger the PSNR value between 2 images, the smaller the image distortion. The general standard is 30dB, and the image degradation below 30dB is obvious. The formula is as follows:
MAX represents the maximum value of the image color, MSE, i.e., the mean square error between m × n monochrome images I and K, and the defined formula is as follows:
the quality of the extracted watermark and the quality of the restored carrier image are evaluated by using the PSNR, and as can be seen from table 1 and experimental results, 64 × 64 watermarks are embedded in the gray level image, and the PSNR shows that the PSNR of the image after embedding the watermarks is generally larger than 56, so that a good visual effect can be achieved, the invisibility of the watermarks and the effect of the image are ensured, and the original image and the watermark image can be restored without distortion after the watermarks are extracted.
TABLE 1 PSNR comparison of embedded Capacity and Embedded watermark
It is to be understood that the above description is not intended to limit the present invention, and the present invention is not limited to the above examples, and those skilled in the art may make modifications, alterations, additions or substitutions within the spirit and scope of the present invention.
Claims (1)
1. A reversible information hiding method based on block prediction and differential value histogram translation is characterized in that: the method comprises the following steps:
step 1: let the original image be a grayscale image of M × N, and divide the original image into 4 × 4 image blocks, denoted as BkWherein k is 1,2,3. [ M/4 ]]*[N/4];
Step 2: for each 4 x 4 image block BkBlock processing is performed, and every four pixels are taken as a group and denoted as bkm,m=1,2,3,4;bkmThe internal pixel is represented asRecord ask represents the number of big blocks, m represents a small block in a big block, and n represents a specific pixel; will include four without mark, horizontal line, oblique line and vertical lineThe pixels are used as a group, the pixels marked with black in the middle are used for making difference with the pixels of the pixels, and the pixels marked with black are the embedding points of the watermarks;
And 4, step 4: will be provided withTrue and predicted values ofCalculating the differenceBy analogy, willTrue and predicted values ofCalculating the difference
step 6: performing translation processing on the difference histogram, and integrally translating a unit to the right for a part of the difference histogram with a pixel value larger than 0, and reserving a blank at a position of the difference histogram with the pixel value of 1;
and 7: judging the embedding capacity according to the difference histogram, selecting a watermark picture, and embedding the watermark; the method specifically comprises the following steps:
step 7.1: carrying out watermark embedding from the first block, and judging whether a first embedding point is a pixel point capable of embedding a watermark or not; if the difference is not the sameIf the pixel point is 0, the pixel point is an embeddable point and a watermark is embedded; if the difference is not the sameIf not, not embedding the watermark, continuing to judge a second embedding point in the block until four points in the 4 x 4 block are judged in sequence, then continuing to perform the process on the next block, and then sequentially performing the process;
step 7.2: processing the watermark image, making a binary watermark image into a watermark sequence for embedding, setting a watermark embedding termination value according to the size of the watermark image, wherein the termination value is the size of the watermark image, and the pixel value of the image after embedding the watermark is as follows:
wherein, I (I, j) is the gray value of the original image, I (I, j) is more than or equal to 0 and less than or equal to 255, W is the watermark sequence, I (I, j) is the gray value of the original image, W is the watermark sequenceW(i, j) represents pixel values of the image after embedding the watermark;
and 8: watermark extraction and image recovery; the method specifically comprises the following steps:
step 8.1: extracting watermarks from the first block, and judging each embedded point; if it isThe difference value is 1, the embedded watermark value is 1, and 1 is extracted; if the difference is not the sameIf the value is 0, the embedded watermark value is 0, and 0 is extracted; then, continuously judging a second embedded point in the block until four points in the 4 x 4 block are sequentially judged, then continuously performing the process on the next block, and then sequentially performing the process;
step 8.2: after the watermark is extracted, restoring the image, and translating the pixel points with the difference value larger than 1 in the difference value histogram to the left by one bit to obtain an original image; the gray scale values of the original image are as follows:
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910503610.6A CN110232651B (en) | 2019-06-12 | 2019-06-12 | Reversible information hiding method based on block prediction and differential value histogram translation |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910503610.6A CN110232651B (en) | 2019-06-12 | 2019-06-12 | Reversible information hiding method based on block prediction and differential value histogram translation |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110232651A CN110232651A (en) | 2019-09-13 |
CN110232651B true CN110232651B (en) | 2021-06-01 |
Family
ID=67858971
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910503610.6A Active CN110232651B (en) | 2019-06-12 | 2019-06-12 | Reversible information hiding method based on block prediction and differential value histogram translation |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110232651B (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110992237A (en) * | 2019-12-03 | 2020-04-10 | 国网电子商务有限公司 | Watermark embedding method, watermark removing method and related device |
CN111127288B (en) * | 2019-12-16 | 2023-07-04 | 中移(杭州)信息技术有限公司 | Reversible image watermarking method, reversible image watermarking device and computer readable storage medium |
CN113112392B (en) * | 2020-01-13 | 2023-05-19 | 国际关系学院 | Watermark embedding and extracting method, watermark embedding and extracting device and processing system |
CN112907432A (en) * | 2021-03-08 | 2021-06-04 | 桂林理工大学 | Reversible watermark data hiding method based on bilinear interpolation |
CN113938574B (en) * | 2021-11-15 | 2023-06-16 | 西安邮电大学 | Reversible information hiding method based on center prediction |
CN114466113A (en) * | 2022-01-11 | 2022-05-10 | 山东师范大学 | Reversible information hiding method and system for perception encrypted image |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102722855A (en) * | 2011-03-31 | 2012-10-10 | 北京大学 | Reversible watermark embedding method, extracting method thereof, device and system |
CN103414840A (en) * | 2013-07-25 | 2013-11-27 | 西安空间无线电技术研究所 | Data hiding method based on image set |
CN106097241A (en) * | 2016-06-13 | 2016-11-09 | 西安交通大学 | Reversible information hidden method based on eight neighborhood pixel |
CN110047029A (en) * | 2019-04-22 | 2019-07-23 | 广东工业大学 | A kind of combination multilayer difference extension has the reversible information hidden method and device of contrast enhancing |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101651837B (en) * | 2009-09-10 | 2011-03-02 | 北京航空航天大学 | Reversible video frequency watermark method based on interframe forecast error histogram modification |
WO2017130334A1 (en) * | 2016-01-27 | 2017-08-03 | 楽天株式会社 | Image processing device, image processing method, and program |
CN108876691B (en) * | 2017-05-10 | 2022-03-08 | 北京大学 | Self-adaptive reversible watermarking method and system |
CN108596820B (en) * | 2018-04-11 | 2022-04-05 | 重庆第二师范学院 | Image processing system based on information security |
-
2019
- 2019-06-12 CN CN201910503610.6A patent/CN110232651B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102722855A (en) * | 2011-03-31 | 2012-10-10 | 北京大学 | Reversible watermark embedding method, extracting method thereof, device and system |
CN103414840A (en) * | 2013-07-25 | 2013-11-27 | 西安空间无线电技术研究所 | Data hiding method based on image set |
CN106097241A (en) * | 2016-06-13 | 2016-11-09 | 西安交通大学 | Reversible information hidden method based on eight neighborhood pixel |
CN110047029A (en) * | 2019-04-22 | 2019-07-23 | 广东工业大学 | A kind of combination multilayer difference extension has the reversible information hidden method and device of contrast enhancing |
Non-Patent Citations (2)
Title |
---|
"一种基于动态分块和差值直方图平移的可逆水印算法";何文广 等;《现代计算机(专业版)》;20160815;第57-63页 * |
"基于图像插值和直方图平移的可逆水印算法";李雪景;《计算机应用研究》;20160430;第33卷(第4期);第1159-1163页 * |
Also Published As
Publication number | Publication date |
---|---|
CN110232651A (en) | 2019-09-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110232651B (en) | Reversible information hiding method based on block prediction and differential value histogram translation | |
Weng et al. | Dynamic improved pixel value ordering reversible data hiding | |
Qin et al. | An inpainting-assisted reversible steganographic scheme using a histogram shifting mechanism | |
Ou et al. | High-fidelity reversible data hiding based on pixel-value-ordering and pairwise prediction-error expansion | |
Wu et al. | Reversible image watermarking on prediction errors by efficient histogram modification | |
Hong | An efficient prediction-and-shifting embedding technique for high quality reversible data hiding | |
Hong et al. | An improved human visual system based reversible data hiding method using adaptive histogram modification | |
Lu et al. | Secure halftone image steganography based on pixel density transition | |
CN105741224A (en) | Reversible watermarking algorithm based on PVO (Pixel Value Ordering) and self-adaptive block segmentation | |
CN110232650B (en) | Color image watermark embedding method, detection method and system | |
CN102903076A (en) | Method for embedding and extracting reversible watermark of digital image | |
Peng et al. | Reversible data hiding based on RSBEMD coding and adaptive multi-segment left and right histogram shifting | |
CN112070647B (en) | Reversible high dynamic range image information hiding method | |
Wu et al. | Reversible data hiding with brightness preserving contrast enhancement by two-dimensional histogram modification | |
Kumar et al. | High-fidelity reversible data hiding using block extension strategy | |
CN109391819B (en) | Reversible information hiding method based on pixel value dynamic prediction | |
Basu et al. | Implementation of a spatial domain salient region based digital image watermarking scheme | |
CN110533569B (en) | Watermark processing method based on quadratic difference expansion | |
CN110910299B (en) | Self-adaptive reversible information hiding method based on integer wavelet transform | |
CN108171643B (en) | Robust reversible image watermarking method based on histogram shift and application | |
CN108510425B (en) | Reversible watermarking method based on IPPVO and optimized MHM | |
CN107292803B (en) | Reversible robust digital image watermarking method according with human eye observation rule | |
Xiang et al. | A pixel-based reversible data hiding method based on obtuse angle prediction | |
CN110570343B (en) | Image watermark embedding method and device based on self-adaptive feature point extraction | |
Yang et al. | Improving visual quality of reversible data hiding in medical image with texture area contrast enhancement |
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 |