CN107241597B - A kind of reversible information hidden method of combination quaternary tree adaptive coding - Google Patents
A kind of reversible information hidden method of combination quaternary tree adaptive coding Download PDFInfo
- Publication number
- CN107241597B CN107241597B CN201710313537.7A CN201710313537A CN107241597B CN 107241597 B CN107241597 B CN 107241597B CN 201710313537 A CN201710313537 A CN 201710313537A CN 107241597 B CN107241597 B CN 107241597B
- Authority
- CN
- China
- Prior art keywords
- block
- information
- image block
- image
- embedded
- 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.)
- Expired - Fee Related
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
- H04N19/122—Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/46—Embedding additional information in the video signal during the compression process
- H04N19/467—Embedding additional information in the video signal during the compression process characterised by the embedded information being invisible, e.g. watermarking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/96—Tree coding, e.g. quad-tree coding
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Discrete Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
The invention discloses a kind of reversible information hidden methods of combination quaternary tree adaptive coding, main includes two step of information extraction of coding client information insertion and decoding end, take the adaptive strategy of picture material, therefore the hiding embedding capacity of reversible information makes moderate progress compared with non-self-consistent method, especially for a large amount of smooth regions and texture complex region and two kinds of apparent particular images of area distribution are possessed, as the promotion of medical image image property becomes apparent.
Description
Technical field
The invention belongs to image coding and Information Hiding Techniques fields, and in particular to a kind of combination quaternary tree adaptive coding
Reversible information hidden method.
Background technique
Reversible information is hidden refer to and can be embedded in additional information in hosted information after, legal receiving can be extracted correctly additionally
Information, and a kind of undistorted technology for recovering original hosted information, in multimedia authentication, digital product intellectual property protection etc.
Many multi-media safety fields are widely used.Current image reversible data hiding technique mainly includes lossless compression, histogram
Figure translation, integer transform three classes.Technical indicator be mainly the embedding capacity bit number of insertion (unit bpp, i.e. unit pixel) and
Y-PSNR after insertion (abbreviation PSNR, unit dB measure distortion level of the image after insertion).Improve embedding capacity
It is that current reversible information hides one of research main target.
There are the pretreatment stages of image block for existing major part algorithm, but are all made of the fixed blocks such as 2*2,3*3
Mode does not fully consider that picture material (exists in the particular images such as medical image although avoiding biggish computation complexity
A large amount of smooth region, and there are a large amount of texture complex regions for texture image etc.), therefore existing algorithm is being directed to smooth area
Embedding capacity in the particular images such as domain, the significantly some images of texture complex region is to be improved.
Such as, on the one hand, to image definition requirements height, U.S. government has enacted a law regulation medical treatment medical image
In do not allow using lossy compression because doctor's mistaken diagnosis bring social concern as caused by fogging image is serious, and cure
Treatment imaging device is expensive, image acquisition is of a high price, therefore reversible information is suitble to hide.On the other hand, medicine sequence chart
Redundancy and inter-frame redundancy are very big in the frame of picture, can be used to be embedded in there are a large amount of smooth regions.Still not to this kind of particular image
It carries out content-adaptive piecemeal and merges the technologies such as compression of images, adaptive coding, hiding reversible data adaptive
Algorithm
Summary of the invention
In view of the above-mentioned deficiencies in the prior art, the technical problem to be solved by the present invention is that providing a kind of fork of combination four
Compression of images, adaptive coding, reversible data hiding technique are fused to certainly by the reversible information hidden method for setting adaptive coding
In adaptive algorithm, more apparent particular image is distributed to the smooth regions such as medical image and texture complex region and carries out content certainly
Adapt to piecemeal processing.
The invention adopts the following technical scheme:
A kind of reversible information hidden method of combination quaternary tree adaptive coding, main includes the insertion of coding client information and solution
The information extraction at code end, the coding client information Embedded step are as follows:
S1, using original image as initial pictures block, current image block is judged according to the pixel situation of image block, really
Determine image block classification；
If S2, current image block belong to embeddable piece, carry out information insertion, if current image block belong to it is not embeddable
Block then judges present image block size, not subdivided not to be embedded in if tile size is 2*2, otherwise according to quaternary tree point
Current image block is then divided into the identical image block of nonoverlapping four sizes by slip gauge, and executes step S1 one by one；
S3, the quadtree coding information that step S2 is generated individually is transmitted to decoding end, decoding end carries out figure according to the information
As decoding and subsequent information extraction process；
S4, decoding end carry out quaternary tree decoding according to decoded information, and the classification according to belonging to each image block carries out
Information extraction and image recovery operation.
Further, in step S1, described image block include embeddable piece and can not embedded block, described embeddable piece includes
Extreme smooth block, general smooth block and generally embeddable piece.
Further, the extreme smooth block is the identical image block of image block pixel value；The general smooth block
To use CBP predicted method to carry out the image block that 0,1, -1 accounting in the prediction error value that image prediction obtains is greater than 40%；It is described
General embeddable piece for using CBP predicted method carry out 0,1, -1 accounting in the prediction error value that image prediction obtains be greater than 20% and
Image block less than 40%；Remaining as can not embedded block.
Further, the embedded mode of the extreme smooth block is the pixel value of most lower right in reserved block, remaining position
All bits of progressive scan pixel-by-pixel are successively substituted by additional information.
Further, the embedded mode of the general smooth block is that DPCM lossless compression method is taken to carry out the image block
Lossless compression, compressed bit being stored in original image block pixel-by-pixel line by line, saves additional information bits in order.
Further, general embeddable piece of the embedded mode is the prediction histogram of error for being taken based on CBP prediction
Shifting method is embedded in, and a part that the relevant parameter of telescopiny saves as additional information save for information extraction.
Further, in step S3, the quadtree coding information specifically: described image block is divided into A, B, C, D
Four do not overlap and the identical image block of size, divide the node layer for representing quaternary tree each time, wherein A=1 is indicated not
Need it is subdivided, A=0 expression need to divide.
Further, corresponding after the encoded information of each described image block to store two bits as additional information.
Further, the additional information of the extreme smooth block is indicated with 00, and the additional information of the general smooth block is used
01 indicates, general embeddable piece of the additional information is indicated with 10, it is described can not the additional information of embedded block indicated with 11.
Compared with prior art, the present invention at least has the advantages that
Take the adaptive strategy of picture material, therefore the embedding capacity and non-self-consistent method phase that reversible information is hiding
Than making moderate progress, especially for possessing a large amount of smooth regions and texture complex region and two kinds of area distributions are significantly special
Image (such as medical image image) performance boost becomes apparent.
Further, classification method can be in conjunction with the characteristics of the smooth situation of image block pixel and different embedded modes, certainly
Adapt to selection embedded mode: the pixel value of I class image block all pixels is identical, can only retain the pixel value of a pixel,
Other location of pixels carry out data substitution all to be embedded in；II class image block smoothness is general, can achieve preferable lossless
Compression of images effect (compression is relatively high), carries out data insertion after being suitble to lossless compression；III class image block smoothness is not so good as II
Class, but still can use other embedded modes and carry out data insertion；IV class smoothness is worst, is not suitable for data insertion, therefore
Be divided into can not embedded block, do nothing.
Below by drawings and examples, technical scheme of the present invention will be described in further detail.
Detailed description of the invention
Fig. 1 is that quadtree coding of the present invention decodes schematic diagram；
Fig. 2 is that image block of the present invention divides schematic diagram.
Specific embodiment
The invention discloses a kind of reversible information hidden methods of combination quaternary tree adaptive coding, including coding client information
Two processes of information extraction of insertion and decoding end, detailed process is as follows for the coding client information insertion:
S1, using original image as initial pictures block, current image block is judged according to the pixel situation of image block, really
Determine image block classification；
Determine image block type:
Described image block type includes: extreme smooth block (I class), general smooth block (II class), generally embeddable piece (III
Class) and can not (IV) four seed type of embedded block, wherein I class, II class, III class are referred to as embeddable piece.
When image block pixel value is identical, determine that image block classification is I class (extreme smooth block)；
When image block is not belonging to I class, and Checkerboard Based Prediction (CBP) is taken to predict the theory of error
When 0,1, -1 accounting is greater than 40% less than 100% in obtained prediction error value, determine that image block classification is that II class is (general smooth
Block)；
When image block is not belonging to I, II class and 0,1, -1 accounting in the prediction error value of the CBP prediction theory of error is taken to be greater than
20% and when less than 40%, determine that image block classification is III class (embeddable piece general)；
When conditions above is not met, determine that image block classification is IV class (can not embedded block).
When experiment shows to predict natural image using CBP prediction error method, the prediction error value obtained is obeyed
The laplacian distribution that mean value is 0.Therefore, 0,1, -1 ratio size can represent the complexity of the image block in image block
(planarization), ratio is bigger, and representative image block is more flat, and ratio is smaller, and representative image block is more complicated, selects 20%, 40%
The two numerical value belong to empirical value from experiment gained, select 0,1, -1 these three data, because subsequent histogram is flat
The embedded performance for moving embedded mobile GIS is related in image block 0,1, -1 number.
Referring to Fig. 2, the information Embedded step is as follows:
If current image block belongs to I class, the pixel value of most lower right in reserved block, remaining position is progressively scanned pixel-by-pixel
All bits successively substituted by additional information be embedded in；
If current image block belongs to II class, take DPCM (non-destructive prediction coding) lossless compression method to the image block into
(relevant parameter of compression process saves save as a part of additional information is used for the lossless extensive of future to row lossless compression
It is multiple), compressed bit being stored in original image block pixel-by-pixel line by line saves additionally in order due to compressing the position vacateed
The lossless compression algorithms such as Huffman coding, arithmetic coding also can be used to realize insertion in information bit.
If current image block belongs to III class, it is taken based on the Prediction-error expansion of CBP prediction
Histogram Shifting method (prediction histogram of error shifting method) is embedded in, and the relevant parameter of telescopiny saves as volume
A part of external information carries out saving the information extraction for being used for future.Reversible data hiding algorithm can also use for example based on
Other prediction histogram of error translation algorithms of MED prediction.
If S2, current image block belong to can not embedded block when (IV class), present image block size is judged, if image block is big
Small is 2*2, not subdivided not do any insertion, and otherwise carrying out quad-tree partition is four image blocks, and executes step one by one
S1。
S3, the quadtree coding information that above step generates is sequentially embedded image as a part of additional information
In, decoding end extracts the information first, to carry out image decoding and subsequent information extraction process.
S4, information extraction and image restore
Decoding end carries out quaternary tree decoding according to decoded information first, and the classification according to belonging to each image block carries out
Information extraction and image recovery operation, detailed process are shown in that histogram of error is predicted in DPCM (non-destructive prediction coding) decompression and CBP
The information extraction and image recovery process of shifting method.
Referring to Fig. 1, quadtree coding and decoding are specific as follows:
If certain image block does not need further to split, indicated and used 1 to indicate with a leaf node on quaternary tree；It is no
It is then divided into the identical image block of size that four do not overlap, and uses A1B1C1D1It indicates.
Wherein, A1、B1、C1、D1The first image block, the second image block, third image block, the 4th image block are respectively indicated, if
First image block needs not continue to divide, then A1=1, otherwise A1=0, and so on A2B2C2D2, divide represent four forks each time
A node layer for tree.Due to the minimum 2*2 of tile size, therefore when tile size is 4*4, it is only necessary to use 1 bit:
1 represent do not need it is subdivided, 0 represent need to be divided into 4 2*2 blocks.Decoding process is opposite process.
In addition, the image block classification is stored in corresponding coding below with two information bits, i.e., each image block coding
Two bits of extra storage again after information: " 00 " represents the image block and belongs to I class of A；" 01 " represents the image block and belongs to II class；
" 10 " represent the image block and belong to III class；" 11 " represent the image block and belong to IV class.
The coding and decoding mode is simple and easy, and computation complexity is low and occupied bandwidth is few, and sender can achieve mark figure
As adaptive piecemeal situation and the purpose of each image block generic, recipient can also determine image according to decoding result
Piecemeal situation simultaneously identifies type belonging to each image block.
The above content is merely illustrative of the invention's technical idea, and this does not limit the scope of protection of the present invention, all to press
According to technical idea proposed by the present invention, any changes made on the basis of the technical scheme each falls within claims of the present invention
Protection scope within.
Claims (5)
1. a kind of reversible information hidden method of combination quaternary tree adaptive coding, main includes the insertion of coding client information and decoding
The information extraction at end, which is characterized in that the coding client information Embedded step are as follows:
S1, using original image as initial pictures block, current image block is judged according to the pixel situation of image block, determine figure
As block classification, image block include embeddable piece and can not embedded block, embeddable piece includes extreme smooth block, general smooth block and one
As embeddable piece；
Extreme smooth block is the identical image block of image block pixel value；General smooth block is to carry out figure using CBP predicted method
0,1, -1 accounting is greater than 40% image block less than 100% in the prediction error value obtained as prediction；General embeddable piece is to make
0,1, -1 accounting in the prediction error value that image prediction obtains, which is carried out, with CBP predicted method is greater than 20% and the image less than 40%
Block；Remaining as can not embedded block；
If S2, current image block belong to embeddable piece, carry out information insertion, if current image block belong to can not embedded block,
Judge present image block size, it is not subdivided not to be embedded in if tile size is 2*2, otherwise advised according to quaternary tree piecemeal
Current image block is then divided into the identical image block of nonoverlapping four sizes, and executes step S1 one by one；
S3, the quadtree coding information that step S2 is generated individually is transmitted to decoding end, decoding end carries out image solution according to the information
Code and subsequent information extraction process, quadtree coding information specifically: image block is divided into A, B, C, D tetra- and is not overlapped
And the identical image block of size, the node layer for representing quaternary tree is divided each time, wherein A=1 expression does not need subdivided, A
=0 indicates to need to divide, and two bits of corresponding storage are as additional information after the encoded information of each described image block；
S4, decoding end carry out quaternary tree decoding according to decoded information, and the classification according to belonging to each image block carries out information
It extracts and image recovery operation.
2. a kind of reversible information hidden method of combination quaternary tree adaptive coding according to claim 1, feature exist
In in step S1, the embedded mode of the extreme smooth block is the pixel value of most lower right in reserved block, remaining position is swept line by line
All bits retouched pixel-by-pixel are successively substituted by additional information.
3. a kind of reversible information hidden method of combination quaternary tree adaptive coding according to claim 1, feature exist
In in step S1, the embedded mode of the general smooth block is to take DPCM lossless compression method lossless to image block progress
Compression, compressed bit being stored in original image block pixel-by-pixel line by line, saves additional information bits in order.
4. a kind of reversible information hidden method of combination quaternary tree adaptive coding according to claim 1, feature exist
In: in step S1, general embeddable piece of the embedded mode is the prediction histogram of error shifting method for being taken based on CBP prediction
It is embedded in, a part that the relevant parameter of telescopiny saves as additional information save for information extraction.
5. a kind of reversible information hidden method of combination quaternary tree adaptive coding according to claim 1, feature exist
In the additional information of the extreme smooth block is indicated with 00, and the additional information of the general smooth block is indicated with 01, described general
Embeddable piece of additional information indicates with 10, it is described can not the additional information of embedded block indicated with 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710313537.7A CN107241597B (en) | 2017-05-05 | 2017-05-05 | A kind of reversible information hidden method of combination quaternary tree adaptive coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710313537.7A CN107241597B (en) | 2017-05-05 | 2017-05-05 | A kind of reversible information hidden method of combination quaternary tree adaptive coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107241597A CN107241597A (en) | 2017-10-10 |
| CN107241597B true CN107241597B (en) | 2019-10-15 |
Family
ID=59984621
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710313537.7A Expired - Fee Related CN107241597B (en) | 2017-05-05 | 2017-05-05 | A kind of reversible information hidden method of combination quaternary tree adaptive coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107241597B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108447492B (en) * | 2018-03-13 | 2021-08-20 | 中山大学 | Self-adaptive histogram translation reversible information hiding method based on segmentation |
| CN108961193B (en) * | 2018-08-10 | 2021-04-02 | 厦门市美亚柏科信息股份有限公司 | Image restoration method, device and storage medium |
| CN109348228B (en) * | 2018-09-14 | 2021-05-04 | 东南大学 | Reversible information hiding system and method for image encryption domain |
| CN109391819B (en) * | 2018-10-24 | 2020-11-27 | 广西师范大学 | Reversible information hiding method based on pixel value dynamic prediction |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000175161A (en) * | 1998-12-01 | 2000-06-23 | Kdd Corp | Watermark data imbedding device to moving picture and detector therefor |
| CN103118250A (en) * | 2011-11-16 | 2013-05-22 | 中兴通讯股份有限公司 | Coding and decoding method and device of intra-frame division mark |
| CN104933668A (en) * | 2015-06-11 | 2015-09-23 | 广东工业大学 | Processing method of reversible watermark on the basis of local positioning and ALattar integer transform |
| CN105741224A (en) * | 2016-01-28 | 2016-07-06 | 广东工业大学 | Reversible watermarking algorithm based on PVO (Pixel Value Ordering) and self-adaptive block segmentation |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100898329B1 (en) * | 2007-10-05 | 2009-05-20 | 한국과학기술원 | Method for embedding watermark based on integer-to-integer wavelet transform |
-
2017
- 2017-05-05 CN CN201710313537.7A patent/CN107241597B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000175161A (en) * | 1998-12-01 | 2000-06-23 | Kdd Corp | Watermark data imbedding device to moving picture and detector therefor |
| CN103118250A (en) * | 2011-11-16 | 2013-05-22 | 中兴通讯股份有限公司 | Coding and decoding method and device of intra-frame division mark |
| CN104933668A (en) * | 2015-06-11 | 2015-09-23 | 广东工业大学 | Processing method of reversible watermark on the basis of local positioning and ALattar integer transform |
| CN105741224A (en) * | 2016-01-28 | 2016-07-06 | 广东工业大学 | Reversible watermarking algorithm based on PVO (Pixel Value Ordering) and self-adaptive block segmentation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107241597A (en) | 2017-10-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107241597B (en) | A kind of reversible information hidden method of combination quaternary tree adaptive coding | |
| CN111971967B (en) | Method and device for encoding/decoding point cloud representing 3D object | |
| CN103210648B (en) | The video pruned using block-based mixed-resolution data is decoded | |
| Li et al. | A steganographic method based upon JPEG and particle swarm optimization algorithm | |
| JP5399416B2 (en) | Video coding system with reference frame compression | |
| CN107273301A (en) | Data handling system | |
| US20130236097A1 (en) | Embedded graphics coding for images with sparse histograms | |
| CN107251557A (en) | The coding/decoding of chrominance resolution details | |
| CN103856829B (en) | A kind of insertion of video digital watermark, extracting method and device | |
| CN109417621A (en) | Image processing apparatus and method | |
| CN110933438B (en) | JPEG image reversible information hiding method | |
| Wang et al. | Hybrid image coding based on partial fractal mapping | |
| US11711535B2 (en) | Video-based point cloud compression model to world signaling information | |
| Qian et al. | Inpainting assisted self recovery with decreased embedding data | |
| CN101527850B (en) | Video self-recovery watermark method based on motion estimation | |
| CN103716634B (en) | Method and apparatus for data compression using error plane coding | |
| US11915336B2 (en) | Method and device for watermark-based image integrity verification | |
| US8355057B2 (en) | Joint scalar embedded graphics coding for color images | |
| Wang et al. | Compressed screen content image super resolution | |
| CN111065000B (en) | Video watermark processing method, device and storage medium | |
| Naaz et al. | Implementation of hybrid algorithm for image compression and decompression | |
| JP4739443B2 (en) | Method and apparatus for processing digital images | |
| CN103517068A (en) | Image compression method and device | |
| WO2024007144A1 (en) | Encoding method, decoding method, code stream, encoders, decoders and storage medium | |
| Banterle et al. | BoostHDR: A novel backward-compatible method for HDR images |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20191015 Termination date: 20200505 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |