CN117978929A - Reversible information hiding method and device for color image - Google Patents
Reversible information hiding method and device for color image Download PDFInfo
- Publication number
- CN117978929A CN117978929A CN202311535038.4A CN202311535038A CN117978929A CN 117978929 A CN117978929 A CN 117978929A CN 202311535038 A CN202311535038 A CN 202311535038A CN 117978929 A CN117978929 A CN 117978929A
- Authority
- CN
- China
- Prior art keywords
- image
- plane
- embedding
- pixel
- color image
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000002441 reversible effect Effects 0.000 title claims abstract description 25
- 238000010586 diagram Methods 0.000 claims abstract description 13
- 238000000605 extraction Methods 0.000 claims abstract description 11
- 238000013075 data extraction Methods 0.000 claims abstract description 4
- 230000001174 ascending effect Effects 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000013507 mapping Methods 0.000 claims description 6
- 238000011084 recovery Methods 0.000 claims description 3
- 239000000203 mixture Substances 0.000 claims description 2
- 238000000638 solvent extraction Methods 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 3
- 230000000007 visual effect Effects 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 6
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 230000011218 segmentation Effects 0.000 description 4
- 230000006835 compression Effects 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Landscapes
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
The invention provides a reversible information hiding method and device for a color image, wherein the method comprises an embedding flow and an extracting flow, and the embedding flow comprises the following steps: converting an original carrier image into a gray image, dividing the gray image into a plurality of super pixel blocks, and dividing three color channels of a color image according to the dividing result of the gray image; secret information is embedded in a mixed mode for an R plane and a B plane; embedding auxiliary information and a position diagram; adjusting the G plane to ensure that the gray value of the carrier image is consistent with that of the original carrier image; the extraction process comprises the following steps: extracting auxiliary information and a position diagram; carrying out data extraction and image restoration on the B plane and the R plane; and adjusting the G plane according to the gray value of the carrier image, and finally completely recovering the original carrier image. The method has good visual quality and safety, and can be used in the fields of hidden communication, information safety and the like.
Description
Technical Field
The invention relates to the technical field of image processing, in particular to a reversible information hiding method and device for a color image.
Background
With the development of network and information technology, the secure transmission of information through a public channel is vital, and reversible information hiding (Reversible DATA HIDING, abbreviated as RDH) is an efficient information security technology, and the technology can accurately extract secret information and recover the original carrier without loss at a receiving end by embedding the secret information into the carrier, so that the technology is widely applied to the aspects of hidden communication, copyright protection, content evidence collection and the like.
Existing RDH algorithms mainly include methods based on lossless compression (lossless compression, LC), difference expansion (DIFFERENCE EXPANSION, DE), histogram shifting (histogram shifting, HS), prediction error expansion (prediction error expansion, PEE), and interpolation techniques (interpolation technology, IT). The RDH algorithm based on pixel value ordering (pixel value ordering, PVO) is an RDH technique developed from PEE, the main idea of which is to divide the carrier image into rectangular blocks of equal size that do not overlap each other first, order the pixel values in each block in ascending order, then predict the maximum and minimum values with the next largest and next smallest values, respectively, and data embedding is achieved by prediction error expansion. After the data embedding is completed, the pixel value sequence in each partition is kept unchanged, so that the reversibility of the algorithm is ensured. However, all the conventional RDH algorithms are proposed for gray images, and color images are widely applied in real life, so that the color images gradually become hot spots for research.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a color image reversible information hiding method and device combining super-pixel segmentation and pixel value sequencing.
In order to solve the problems, the technical scheme of the invention is as follows:
a reversible information hiding method of color image includes embedding process and extracting process;
The embedding process comprises the following steps:
Converting an original carrier image into a gray image, dividing the gray image into a plurality of super pixel blocks, and dividing three color channels of a color image according to the dividing result of the gray image;
secret information is embedded in a mixed mode for an R plane and a B plane;
Embedding auxiliary information and a position diagram;
Adjusting the G plane to ensure that the gray value of the carrier image is consistent with that of the original carrier image;
the extraction process comprises the following steps:
Extracting auxiliary information and a position diagram;
carrying out data extraction and image restoration on the B plane and the R plane;
And adjusting the G plane according to the gray value of the carrier image, and finally completely recovering the original carrier image.
Preferably, the step of embedding secret information in the mixture of the R plane and the B plane specifically includes: and adopting a IPVO and PPVO mixed embedding method for the super pixel blocks of the R plane and the G plane.
Preferably, the IPVO embedding process is as follows: dividing the carrier image into non-overlapping blocks of n=n 1×n2, ordering pixels (x 1,x2,…,xn) in each block in ascending order (x σ(1),xσ(2),…,xσ(n)), wherein σ: {1, …, n } → {1, …, n } is a unique one-to-one mapping such that x σ(1)≤xσ(2)≤…≤xσ(n), if x σ(i)＝xσ(j) and i < j, σ (i) < σ (j), the prediction error is: d max＝xu-xv, where u=min { σ (n), σ (n-1) }, v=max { σ (n), σ (n-1) },
Where b is the embedded secret information, b e 0,1,Obtaining a marked pixel block (y 1,y2,…,yn) for the modified maximum pixel value; the complexity calculation formula of the pixel block is as follows: NL i(x)＝xσ(n-1)-xσ(2).
Preferably, the PPVO embedding process is: for the pixel x to be modified, the prediction context thereof is composed of adjacent pixels in the lower right region, assuming that the number of context pixels is N (1.ltoreq.N.ltoreq.15), then a sequence C= (C 1,c2,…,cn) is formed, the prediction valueThe method comprises the following steps:
When min (C) noteqmax (C),
When min (C) =max (C) =vc,
Wherein, VC is the pixel value of all the same pixels; otherwise, x skips and does not predict;
the embedding process comprises the following steps:
When min (C) noteqmax (C),
When min (C) =max (C) =vc,
Wherein,For the modified image value, b is secret information, b is {0,1}, and the complexity calculation formula of the pixel block is: NL p (x) =max (C) -min (C).
Preferably, the step of adjusting the G plane to ensure that the gray value of the secret image is consistent with that of the original carrier image specifically includes: and adjusting the G plane according to the plane R, B after embedding, wherein the adjustment formula is as follows: And/> The gray value of the color image after adjustment remains unchanged.
Preferably, the steps of extracting data and recovering images of the B plane and the R plane specifically include: partitioning the loaded image from super pixel blocksIn the extraction sequence S LSB, determining mixed embedding type according to TLM, calculating corresponding block complexity NL i or NL p for B-ultrasonic pixel block and R-ultrasonic pixel block according to the embedding type, replacing the lowest bit of the first 16+5[ log 2 k]+lBCLM+lRCLM+lTCLM pixels of the B plane with the sequence S LSB, and determining the block/>, of the B plane and the R planeHidden data is extracted from the image, and the image is restored.
Preferably, the steps of extracting data and recovering images of the B plane and the R plane specifically include: the pixels (y 1,y2,…,yn) in each block are ordered in ascending order (y σ(1),yσ(2),…,yσ(n)), where σ: {1, …, n } → {1, …, n } is a unique one-to-one mapping such that y σ(1)≤yσ(2)≤…≤yσ(n), if y σ(i)＝yσ(j) and i < j, σ (i) < σ (j), the prediction error is:
where p=min { σ (n), σ (n-1) }, q=max { σ (n), σ (n-1) }
Where x σ(n) is the maximum of the original pixel block.
Preferably, the steps of extracting data and recovering images of the B plane and the R plane specifically include: for the pixel x to be modified, the prediction context sequence d= (D 1,d2,…,dn), when min (D) noteqmax (D),
When min (D) =max (D) =vd,
Where VD is the pixel value of all the same pixels,For modified image values,/>For the predicted value, x is the original pixel after recovery, and b is the secret information.
Further, the present invention also provides a color image reversible information hiding apparatus comprising a processor and a memory for storing executable instructions of the processor, the processor being configured to perform the color image reversible information hiding method as described above via execution of the executable instructions.
Compared with the prior art, the method combines the super-pixel segmentation technology and the pixel value ordering algorithm to form the image steganography method, adopts a IPVO and PPVO mixed embedding method for the super-pixel blocks of the R plane and the G plane, maximally ensures the consistency of the embedding positions of the B plane and the R plane, reduces the modification of the G plane when the gray value is adjusted, thereby improving the steganography image quality, having good visual quality and safety under low embedding capacity, and being applicable to the fields of hidden communication, data encryption, information safety and the like.
Drawings
Other features, objects and advantages of the present invention will become more apparent upon reading of the detailed description of non-limiting embodiments, given with reference to the accompanying drawings in which:
FIG. 1 is a flow chart of a reversible information hiding method for color images according to an embodiment of the present invention;
FIG. 2a is a diagram of an example of pixel modification for each plane using IPVO embedding algorithms;
FIG. 2b is a diagram illustrating pixel modification of each plane using a hybrid embedding algorithm according to an embodiment of the present invention;
FIG. 3 is a prediction context diagram of pixel x according to an embodiment of the present invention;
FIG. 4 is a block diagram of a color image reversible information hiding method according to an embodiment of the present invention;
fig. 5 is a block diagram of an extraction flow of a reversible information hiding method for color images according to an embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the present invention, but are not intended to limit the invention in any way. It should be noted that variations and modifications could be made by those skilled in the art without departing from the inventive concept. These are all within the scope of the present invention.
Specifically, as shown in fig. 1, the present invention provides a method for forming reversible information hiding of a color image by combining a super pixel segmentation technique (SIMPLE LINEAR ITERATIVE Clustering, SLIC) and a pixel value ordering algorithm (pixel value ordering, PVO), which comprises an embedding flow and an extracting flow.
As shown in fig. 4, the embedding process includes the following steps:
s1: converting an original carrier image into a gray image, dividing the gray image into a plurality of super pixel blocks, and dividing three color channels of a color image according to the dividing result of the gray image;
Specifically, the original carrier image is converted into a gray image, a correlation coefficient m is set, the gray image is divided into k super pixel blocks { X 1,...,Xk }, and three color channels of the original color image are divided according to the division result of the gray image.
S2: secret information is embedded in a mixed mode for an R plane and a B plane;
To prevent the overflow problem, a position map (LM) of size k is created for the B-channel and the R-channel, respectively, when the pixel value to be embedded is 0 or 255, LM (i) =1, otherwise LM (i) =0. The position map is then losslessly compressed using arithmetic coding to obtain CLM B、CLMR, thereby reducing its length. The length of CLM B、CLMR, is denoted as l BCLM、lRCLM.
Specifically, the embedding type of the hybrid embedding mode is determined, corresponding block complexity NL i or NL p is calculated for the B-ultrasonic pixel block and the R-ultrasonic pixel block according to the embedding type, when the complexity is simultaneously smaller than the threshold T and LM (i) =0, the secret information is embedded, otherwise, the pixel block at the position is skipped. When the secret information is completely embedded, this step is stopped, and the position P end at this time is recorded.
The specific process of the step S2 is as follows:
a IPVO and PPVO mixed embedding method is adopted for the super pixel blocks of the R plane and the G plane;
The super-pixels of the channels with different colors at the same position can have three mixed embedding types F 1、F2、F3 shown in the following table 1, when the types are selected, firstly, the bit number of embeddable secret information of each type is calculated, and the type with the largest embedded secret information bit number is selected as the embedding type of the current super-pixel block. If the number of embeddable secret information bits is equal, F 2、F3 is preferably selected for secret information embedding. As shown in fig. 2a, when the B-super pixel block and the R-super pixel block in fig. 2a adopt the embedding mode of IPVO at the same time, since the positions of the maximum value and the minimum value are different, the G-super pixel block needs to be modified by 4 pixels at most, and in fig. 2B, the B-super pixel block and the R-super pixel block adopt IPVO to be mixed and embedded with PPVO, the positions of modified pixels of PPVO and the positions of the maximum value and the minimum value of IPVO are kept consistent, and the prediction context of PPVO is composed of non-to-be-embedded pixel values of the pixel block, so that the G-super pixel block needs to be modified by 2 pixels at most. The mixed embedding method of IPVO and PPVO can further improve the quality of the steganographic image under the same embedding amount.
In order to ensure reversible extraction of secret information, an embedded type position map TLM is established, and when the embedded type is F 2, TLM (i) =0; when the embedding type is F 3, TLM (i) =1; the TLM is not required when the embedding type is F 1, and then the position map is losslessly compressed using arithmetic coding to obtain CLM T, thereby reducing its length. The length of CLM T is denoted as l TCLM.
TABLE 1
IPVO
Dividing the carrier image into non-overlapping blocks of n=n 1×n2, ordering pixels (x 1,x2,…,xn) in each block in ascending order (x σ(1),xσ(2),…,xσ(n)), wherein σ: {1, …, n } → {1, …, n } is a unique one-to-one mapping such that x σ(1)≤xσ(2)≤…≤xσ(n), if x σ(i)＝xσ(j) and i < j, σ (i) < σ (j), the prediction error is:
dmax＝xu-xv (1)
Where u=min { σ (n), σ (n-1) }, v=max { σ (n), σ (n-1) }.
Where b is the embedded secret information, b e 0,1,For the modified maximum pixel value, a block of marked pixels (y 1,y2,…,yn) is finally obtained. The minimum-based embedding formula is similar to that described above. The complexity calculation formula of the pixel block is as follows:
NLi(x)＝xσ(n-1)-xσ(2) (3)
PPVO
For the pixel x to be modified, the prediction context thereof is composed of adjacent pixels in the lower right region, as shown in fig. 3, assuming that the number of context pixels is N (1N 15), then a sequence c= (C 1,c2,…,cn) is formed, the prediction value The method comprises the following steps:
When min (C) noteqmax (C),
When min (C) =max (C) =vc,
Wherein VC is the pixel value of all the same pixels.
Otherwise, x skips and does not predict.
The embedding process may be expressed as follows:
When min (C) noteqmax (C),
When min (C) =max (C) =vc,
Wherein,For the modified image value, b is secret information, b is {0,1}, and the complexity calculation formula of the pixel block is:
NLp(x)＝max(C)-min(C) (8)
s3: embedding auxiliary information and a position diagram;
Before recording the B plane The least significant bits of the individual pixels result in a sequence S LSB that is replaced with the following side information and compressed bitmap:
Number k of super pixel blocks
Correlation coefficient m (8 bits)
Block complexity T (8 bits);
embedding stop position
Compressed bitmap CLM B(lBCLMbits)、CLMR(lRCLMbits)、CLMT(lTCLM bits);
Compressed bitmap length
Finally, the sequence S LSB is embedded into the blockIs a kind of medium.
S4: and adjusting the G plane to ensure that the gray value of the carrier image is consistent with that of the original carrier image.
Specifically, the G plane is adjusted according to the plane R, B after embedding, the adjustment formulas are shown in the following formulas (9) and (10), and the gray value of the color image after adjustment is kept unchanged. After steganography, the carrier image is adjusted to ensure that the gray level images before and after embedding are unchanged, and the unchanged gray level images are used as the input images preprocessed during embedding and extraction, so that the segmentation effect almost same as that of the color images can be obtained, and the accuracy of extracting the secret information can be ensured.
Further, as shown in fig. 5, the extraction process includes the following steps:
s5: extracting auxiliary information and a position diagram;
in particular, before the B plane of the dense image is extracted The lowest bit of each pixel obtains auxiliary information m, T and P end、lBCLM、lRCLM、lTCLM, then the lowest bit of the next l BCLM、lRCLM、lTCLM pixels of the B plane is sequentially extracted to obtain a compressed bitmap CLM B、CLMR、CLMT, and finally the compressed bitmap is decompressed to obtain a corresponding bitmap.
S6: carrying out data extraction and image restoration on the B plane and the R plane;
specifically, similarly to the embedding process, the loaded image is segmented from super-pixel blocks Firstly, determining a mixed embedding type according to TLM, then, calculating corresponding block complexity NL i or NL p of the B ultrasonic pixel block and the R ultrasonic pixel block according to the embedding type, when the complexity is simultaneously smaller than a threshold T and LM (i) =0, extracting the sequence S LSB and recovering the image, otherwise, skipping the pixel block at the position; until position X P, the step stops, finally replacing the B-plane front/>, with sequence S LSB The lowest order of the pixels. Blocks from B-plane and R-planeHidden data is extracted from the image, and the image is restored.
The extraction formula of the corresponding algorithm is as follows:
IPVO
the pixels (y 1,y2,…,yn) in each block are ordered in ascending order (y σ(1),yσ(2),…,yσ(n)), where σ: {1, …, n } → {1, …, n } is a unique one-to-one mapping such that y σ(1)≤yσ(2)≤…≤yσ(n), if y σ(i)＝yσ(j) and i < j, σ (i) < σ (j), the prediction error is:
where p=min { σ (n), σ (n-1) }, q=max { σ (n), σ (n-1) }
Where x σ(n) is the maximum of the original pixel block. The minimum-based extraction formula is similar to that described above.
PPVO
For pixel x to be modified, the prediction context sequence d= (D 1,d2,…,dn),
When min (D) noteqmax (D),
When min (D) =max (D) =vd,
Where VD is the pixel value of all the same pixels,For modified image values,/>For the predicted value, x is the original pixel after recovery, and b is the secret information.
S7: and adjusting the G plane according to the gray value of the carrier image, and finally completely recovering the original carrier image.
The foregoing describes specific embodiments of the present application. It is to be understood that the application is not limited to the particular embodiments described above, and that various changes or modifications may be made by those skilled in the art within the scope of the appended claims without affecting the spirit of the application. The embodiments of the application and the features of the embodiments may be combined with each other arbitrarily without conflict.
Claims (9)
1. A reversible information hiding method of a color image, which is characterized by comprising an embedding flow and an extracting flow;
The embedding process comprises the following steps:
Converting an original carrier image into a gray image, dividing the gray image into a plurality of super pixel blocks, and dividing three color channels of a color image according to the dividing result of the gray image;
secret information is embedded in a mixed mode for an R plane and a B plane;
Embedding auxiliary information and a position diagram;
Adjusting the G plane to ensure that the gray value of the carrier image is consistent with that of the original carrier image;
the extraction process comprises the following steps:
Extracting auxiliary information and a position diagram;
carrying out data extraction and image restoration on the B plane and the R plane;
And adjusting the G plane according to the gray value of the carrier image, and finally completely recovering the original carrier image.
2. The color image reversible information hiding method according to claim 1, wherein said step of embedding secret information for R-plane and B-plane mixture specifically comprises: and adopting a IPVO and PPVO mixed embedding method for the super pixel blocks of the R plane and the G plane.
3. The color image reversible information hiding method according to claim 2, wherein said IPVO embedding process is: dividing the carrier image into non-overlapping blocks of n=n 1×n2, ordering pixels (x 1,x2,…,xn) in each block in ascending order (x σ(1),xσ(2),…,xσ(n)), wherein σ: {1, …, n } → {1, …, n } is a unique one-to-one mapping such that x σ(1)≤xσ(2)≤…≤xσ(n), if x σ(i)＝xσ(j) and i < j, σ (i) < σ (j), the prediction error is: d max＝xu-xv, where u=min { σ (n), σ (n-1) }, v=max { σ (n), σ (n-1) },
Where b is the embedded secret information, b e 0,1,Obtaining a marked pixel block (y 1,y2,…,yn) for the modified maximum pixel value; the complexity calculation formula of the pixel block is as follows: NL i(x)＝xσ(n-1)-xσ(2).
4. The color image reversible information hiding method according to claim 2, wherein the PPVO embedding process is: for the pixel x to be modified, the prediction context thereof is composed of adjacent pixels in the lower right region, assuming that the number of context pixels is N (1.ltoreq.N.ltoreq.15), then a sequence C= (C 1,c2,…,cn) is formed, the prediction valueThe method comprises the following steps:
When min (C) noteqmax (C),
When min (C) =max (C) =vc,
Wherein, VC is the pixel value of all the same pixels; otherwise, x skips and does not predict;
the embedding process comprises the following steps:
When min (C) noteqmax (C),
When min (C) =max (C) =vc,
Wherein,For the modified image value, b is secret information, b is {0,1}, and the complexity calculation formula of the pixel block is: NL p (x) =max (C) -min (C).
5. The method for hiding reversible information of color image according to claim 1, wherein said step of adjusting G plane to ensure that gray values of the secret image and the original carrier image are identical comprises: and adjusting the G plane according to the plane R, B after embedding, wherein the adjustment formula is as follows: And The gray value of the color image after adjustment remains unchanged.
6. The method for hiding color image reversible information according to claim 1, wherein said steps of extracting data and recovering image for B-plane and R-plane specifically include: partitioning the loaded image from super pixel blocksIn the extraction sequence S LSB, determining a mixed embedding type according to TLM, calculating corresponding block complexity NL i or NL p for the B ultrasonic pixel block and the R ultrasonic pixel block according to the embedding type, and replacing the front of the B plane by the sequence S LSB The least significant bit of the individual pixels, block/>, from the B-plane and the R-planeHidden data is extracted from the image, and the image is restored.
7. The method for hiding color image reversible information according to claim 6, wherein said steps of extracting data and recovering image for B-plane and R-plane specifically include: ascending order of pixels (y 1,y2,…,yn) in each block to y σ(1),yσ(2),…,yσ(n)), where σ: {1, …, n } → {1, …, n } is a unique one-to-one mapping such that y σ(1)≤yσ(2)≤…≤yσ(n), if y σ(i)＝yσ(j) and i < j, σ (i) < σ (j), the prediction error is:
Wherein p=min { σ (n), σ (n-1) }, q=max { σ (n), σ (n-1)
Where x σ(n) is the maximum of the original pixel block.
8. The method for hiding color image reversible information according to claim 6, wherein said steps of extracting data and recovering image for B-plane and R-plane specifically include: for the pixel x to be modified, the prediction context sequence d= (D 1,d2,…,dn), when min (D) noteqmax (D),
When min (D) =max (D) =vd,
Where VD is the pixel value of all the same pixels,For modified image values,/>For the predicted value, x is the original pixel after recovery, and b is the secret information.
9. A color image reversible information hiding apparatus, characterized in that the apparatus comprises a processor configured to perform the color image reversible information hiding method according to any one of claims 1 to 8 via execution of executable instructions of the processor, and a memory for storing the executable instructions of the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311535038.4A CN117978929A (en) | 2023-11-16 | 2023-11-16 | Reversible information hiding method and device for color image |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311535038.4A CN117978929A (en) | 2023-11-16 | 2023-11-16 | Reversible information hiding method and device for color image |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117978929A true CN117978929A (en) | 2024-05-03 |
Family
ID=90862029
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311535038.4A Pending CN117978929A (en) | 2023-11-16 | 2023-11-16 | Reversible information hiding method and device for color image |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117978929A (en) |
-
2023
- 2023-11-16 CN CN202311535038.4A patent/CN117978929A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105741224B (en) | The reversible water mark algorithm divided based on PVO and adaptive block | |
| US20020061140A1 (en) | Image processing apparatus and method, program and storage medium | |
| Kelash et al. | Hiding data in video sequences using steganography algorithms | |
| US20050265443A1 (en) | Coding apparatus and method, decoding apparatus and method, data processing system, storage medium, and signal | |
| CN110232651B (en) | Reversible information hiding method based on block prediction and differential value histogram translation | |
| CN110232650B (en) | Color image watermark embedding method, detection method and system | |
| CN101105857A (en) | High capacity reversible water mark method based on predication and companding technology | |
| Hong et al. | An improved human visual system based reversible data hiding method using adaptive histogram modification | |
| US20070064275A1 (en) | Apparatus and method for compressing images | |
| CN111464717B (en) | Reversible information hiding method with contrast ratio pull-up by utilizing histogram translation | |
| US8699746B2 (en) | Watermarking scheme for digital video | |
| CN110047029B (en) | Reversible information hiding method and device with contrast enhancement by combining multi-layer difference expansion | |
| CN113032813B (en) | Reversible information hiding method based on improved pixel local complexity calculation and multi-peak embedding | |
| CN109391819B (en) | Reversible information hiding method based on pixel value dynamic prediction | |
| KR101026081B1 (en) | Reversible watermark inserting and original image restoring methods | |
| Weng et al. | Reversible data hiding based on the local smoothness estimator and optional embedding strategy in four prediction modes | |
| CN110533569B (en) | Watermark processing method based on quadratic difference expansion | |
| CN117978929A (en) | Reversible information hiding method and device for color image | |
| JP4165752B2 (en) | Secret data insertion method and secret data detection method for image data | |
| US6647127B1 (en) | Method of manipulating image data and a recording medium for recording a processing program thereof | |
| RU2288544C2 (en) | Method for embedding additional information into digital images | |
| CN111816195B (en) | Audio reversible steganography method, secret information extraction and carrier audio recovery method | |
| CN109389546B (en) | Multi-block reversible watermark embedding method and device and watermark extracting method and device | |
| CN108009974B (en) | Robust reversible watermarking method resisting JPEG compression and digital television broadcasting system | |
| Ma et al. | An improved reversible watermarking scheme |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination |