Reversible Visible Watermarking and Lossless Recovery of Original Images
IEEE Transactions on Circuits and Systems for Video Technology, 2006In this paper, we propose a reversible visible watermarking algorithm to satisfy a new application scenario where the visible watermark serves as a tag or ownership identifier, but can be completely removed to resume the original image data. It includes two procedures: data hiding and visible watermark embedding. In order to losslessly recover both the
Yongjian Hu, Byeungwoo Jeon
openaire +1 more source
Robust Image Steganography Against General Downsampling Operations With Lossless Secret Recovery
IEEE Transactions on Dependable and Secure ComputingXinpeng Zhang, Sheng Li, Zichi Wang
exaly +2 more sources
Spectrum-estimation based lossless information recovery for sparse array patterns
Telecommunication Systems, 2010One of the open problems in lossless information hiding research is how to get adaptively better difference image architectures for given applications. In this paper we propose a simple and efficient approach to predict high-similar interpolation image from its sparse pattern and spectral expansion. After difference operator, peak value of the spike is
Guorui Feng +2 more
openaire +1 more source
Polynomial-Based Secret Image Sharing Scheme with Fully Lossless Recovery
International Journal of Digital Crime and Forensics, 2018Lossless recovery is important for the transmission and storage of image data. In polynomial-based secret image sharing, despite many previous researchers attempted to achieve lossless recovery, none of the proposed work can simultaneously satisfy an efficiency execution and at no cost of some storage capacity.
Wanmeng Ding +3 more
openaire +1 more source
Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery
Multimedia Tools and Applications, 2013In this paper, a visual secret image sharing threshold scheme based on random grids and Boolean operations with the abilities of AND and XOR decryptions is proposed. When no light-weight computation device the secret could be revealed by human visual system with no cryptographic computation based on Boolean AND operation (stacking).
Xuehu Yan +3 more
openaire +1 more source
Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability
Image and Vision Computing, 2010Visual cryptography scheme (VCS) is a research area in image secret sharing, where one can easily stack shadow images and decode a black-and-white secret image through the human visual system without computation. Although VCS does not provide a competitive reconstruction quality, its stacking-to-see property clearly has the intended applications.
Ching-Nung Yang, Chuei-Bang Ciou
openaire +1 more source
Cropping Resilient Secret Image Sharing Scheme with Lossless Recovery
2023 IEEE 22nd International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2023Shengyang Luo +3 more
openaire +1 more source
Network revenue recovery in a pool-based lossless network
2001Galiana, Francisco D. (Supervisor)
openaire +1 more source
JPEG2000 ROI coding method with perfect fine-grain accuracy and lossless recovery
2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, 2009Medical images have high spatial and high bit-depth resolution (12 bits per sample or more). These high resolutions allow computer-aided diagnosis, which are exploited by radiologists to identify relevant medical areas, known as Regions of Interest (ROI). In image compression, ROI coding allows to recover the ROI earlier than the rest of the image.
Joan Bartrina-Rapesta +3 more
openaire +1 more source
Secret image sharing using (t,n) threshold scheme with lossless recovery
2012 5th International Congress on Image and Signal Processing, 2012Secret image sharing is a means of hiding an image within another image to generate similar images. In 1979, Shamir proposed a method of secret image sharing known as the (t, n) threshold scheme. (t, n) threshold schemes can generate n shadow images and any t of n shadow images can be used to reconstruct the secret image and cover image.
Ming-Chun Chien, Jen-Ing G. Hwang
openaire +1 more source

