Reversible data hiding(RDH)is a method to embed messages into an image that human eyes are difficult to recognize the differences between the original image and the embedded image.The method needs to make sure that th...Reversible data hiding(RDH)is a method to embed messages into an image that human eyes are difficult to recognize the differences between the original image and the embedded image.The method needs to make sure that the original image and the embedded information can be exactly recovered.The prediction-error expansion(PEE)is a successful way to realize RDH.However,it is fixed when pairing the conventional twodimensional prediction-error histogram(2D-PEH).So,the embedding capacity(EC)and embedding distortion(ED)are not satisfactory.In this study,we propose a method called greedy pairing prediction-error expansion(GPPEE)based on pairwise RDH and demonstrate GPPEE can achieve a more efficient embedding goal and reduce ED.展开更多
Reversible watermarking schemes for relational database are usually classified into two groups: robust schemes and fragile schemes. The main limitation of existing reversible fragile methods is that they cannot differ...Reversible watermarking schemes for relational database are usually classified into two groups: robust schemes and fragile schemes. The main limitation of existing reversible fragile methods is that they cannot differentiate between legal and malicious modifications. In this paper, we introduce a novel lossless semi-fragile scheme based on prediction-error expansion for content protection of relational database. In the proposed method, all attributes in a database relation are first classified according to their sensitivity to legitimate updates. Then, the watermark is embedded by expanding the prediction error of the two least significant digits of securely selected attributes. At watermark extraction, the proposed method has the ability to fully restore the original data while detecting and localizing tampering. The applicability of our method is demonstrated theoretically and experimentally.展开更多
基金supported by MOST under Grants No.107-2221-E-845-002-MY3 and No.110-2221-E-845-002-。
文摘Reversible data hiding(RDH)is a method to embed messages into an image that human eyes are difficult to recognize the differences between the original image and the embedded image.The method needs to make sure that the original image and the embedded information can be exactly recovered.The prediction-error expansion(PEE)is a successful way to realize RDH.However,it is fixed when pairing the conventional twodimensional prediction-error histogram(2D-PEH).So,the embedding capacity(EC)and embedding distortion(ED)are not satisfactory.In this study,we propose a method called greedy pairing prediction-error expansion(GPPEE)based on pairwise RDH and demonstrate GPPEE can achieve a more efficient embedding goal and reduce ED.
文摘Reversible watermarking schemes for relational database are usually classified into two groups: robust schemes and fragile schemes. The main limitation of existing reversible fragile methods is that they cannot differentiate between legal and malicious modifications. In this paper, we introduce a novel lossless semi-fragile scheme based on prediction-error expansion for content protection of relational database. In the proposed method, all attributes in a database relation are first classified according to their sensitivity to legitimate updates. Then, the watermark is embedded by expanding the prediction error of the two least significant digits of securely selected attributes. At watermark extraction, the proposed method has the ability to fully restore the original data while detecting and localizing tampering. The applicability of our method is demonstrated theoretically and experimentally.
