Results 241 to 250 of about 52,493 (283)

Threshold construction from specific cases in visual cryptography without the pixel expansion

Signal Processing, 2014
Abstract Unexpanded shares can decrease the bandwidth and save storage in a visual cryptography scheme (VCS). To avoid the pixel expansion, some previous VCSs without the pixel expansion were given. However, most of them are only for specific cases other than general threshold (case).
Xuehu Yan, Shen Wang, Xiamu Niu
exaly   +2 more sources

A novel visual secret sharing scheme for multiple secrets without pixel expansion☆

Expert Systems With Applications, 2010
The main concept of the original visual secret sharing (VSS) scheme is to encrypt a secret image into n meaningless share images. It cannot leak any information of the shared secret by any combination of the n share images except for all of images. The shared secret image can be revealed by printing the share images on transparencies and stacking the ...
Shi-Jinn Horng, Pei-Ling Chiu, Tzong-Wann Kao   +2 more
exaly   +3 more sources

Reversible data hiding using invariant pixel-value-ordering and prediction-error expansion

Signal Processing: Image Communication, 2014
Recently, Li et al. proposed a reversible data hiding (RDH) method based on pixel-value-ordering (PVO) and prediction-error expansion. In their method, the maximum and the minimum of a pixel block are predicted and modified to embed data, and the ...
Bo Ou, Rongrong Ni
exaly   +2 more sources

High-fidelity reversible data hiding scheme based on pixel-value-ordering and prediction-error expansion

Signal Processing, 2013
This paper presents a high-fidelity reversible data hiding scheme for digital images based on a new prediction strategy called pixel-value-ordering (PVO) and the well-known prediction-error expansion (PEE) technique.
Xiaolong Li
exaly   +2 more sources

Sub-pixel displacement measurement based on Taylor expansion theory

Journal of Computational Methods in Sciences and Engineering, 2021
Traditional vision measurement algorithms have many shortcomings, such as complex process, multi-parameter adjustment and the integer pixel accuracy. To solve these problems, a sub-pixel displacement measurement algorithm based on Taylor expansion is proposed.
Chunli Zhu, Xiujun Lei, Jie Guo 0003, Yuan Shen   +3 more
openaire   +1 more source

Visual Secret Sharing Without Pixel Expansion

International Journal of Digital Crime and Forensics, 2015
Visual Secret Sharing (VSS) is a powerful approach for protecting image sharing through unsecured computer network such as the Internet. Pixel expansion and bad image quality are the most common problems of this approach. Visual secret sharing technique is proposed for grayscale images to eliminate pixel expansion problem using image compression.
Ali Makki Sagheer, Laith Hamid Abed
openaire   +1 more source

An image expansion method by using sub-pixel information

2013 International Symposium on Intelligent Signal Processing and Communication Systems, 2013
A novel scheme for digital image expansion without artifact is introduced, which utilizes sub-pixel information. The proposed method achieves accurate sub-pixel interpolation, and enlarges the original image by using convolution of Lanczos function. Thus, the resolution of the digital image is increased by the proposed interpolation. Simulation results
Keita Kobayashi, Hiroyuki Tsuji, Tomoaki Kimura   +2 more
openaire   +1 more source

Predictive pixel differencing expansion in data reversibility scheme

Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, 2012
The differencing expansion (DE) scheme can lead to a lossless pixel after secret data exacting. However, despite achieving pixel reversibility based on concept of expanded differencing, DE scheme can cause enormous image distortion since the differencing is large.
Chi-Yao Weng, Chun-I Fan, Chin-Feng Lee, Shiuh-Jeng Wang   +3 more
openaire   +1 more source

Optimum Pixel Expansions for Threshold Visual Secret Sharing Schemes

IEEE Transactions on Information Forensics and Security, 2011
The optimal pixel expansion of an (n, n) visual cryptographic scheme (VCS) was proven as 2n-1 in 1995; and that of a (2, n)-VCS was proposed in 2002. Yet, most existing best pixel expansions of (k, n)-VCSs for k ≥ 3 have not been improved since 1996. Whether they are already optimal, and if not how to find the optimums have never been explored. In this
Shyong Jian Shyu, Ming Chiang Chen
openaire   +1 more source

Reversible data hiding method based on pixel expansion and homomorphic encryption

Journal of Intelligent & Fuzzy Systems, 2020
Digital image steganography algorithms usually suffer from a lossy restoration of the cover content after extraction of a secret message. When a cover object and confidential information are both utilised, the reversible property of the cover is inevitable.
R. Anushiadevi, Padmapriya Praveenkumar, John Bosco Balaguru Rayappan, Rengarajan Amirtharajan   +3 more
openaire   +1 more source