1 November 2014 in Signal Processing
1 February 2018 in Signal Processing
1 January 2013 in Journal of Visual Communication and Image Representation
26 July 2013 in IEEE Transactions on Information Forensics and Security
Random grid (RG) is a method to implement visual cryptography (VC) without pixel expansion. However, a reconstructed secret with lower visual quality reveals in RG-based VC due to the fact that average light transmission of a share is fixed at 1/2. In this work, we introduce the concept of generalized RG, where the light transmission of a share becomes adjustable, and adopt generalized RG to implement different VC schemes. First, a basic algorithm, a (2,2) generalized RG-based VC, is devised. Based on the (2,2) scheme, two VC schemes including a (2,n) generalized RG-based VC and a (n,n) xor-based meaningful VC are constructed. The two derived algorithms are designed to solve different problems in VC. In the (2,n) scheme, recovered image quality is further improved. In the (n,n) method, meaningful shares are constructed so that the management of shadows becomes more efficient, and the chance of suspicion on secret image encryption is reduced. Moreover, superior visual quality of both the shares and recovered secret image is achieved. Theoretical analysis and experimental results are provided as well, demonstrating the effectiveness and advantages of the proposed algorithms.
1 February 2013 in Applied Soft Computing
7 August 2014 in IEEE Transactions on Information Forensics and Security
The XOR-based visual cryptography (VC) is a possible methodology to solve the poor visual quality problem without darkening the background in VC. However, investigations on XOR-based VC are not sufficient. In this paper, we exploit some extended capabilities for XOR-based VC. Actually, two XOR-based VC algorithms are proposed, namely XOR-based VC for general access structure (GAS) and adaptive region incrementing XOR-based VC. The first algorithm aims to implement complicated sharing strategy using GAS, while maintaining merits such as perfect reconstruction of secret, no pixel expansion, and no code book requirement. In the second algorithm, the concept of adaptive security level is first introduced, where the security levels are recovered in accordance with the qualified sets instead of the quantity of stacked shares. Adaptive region incrementing XOR-based VC further enriches the application scenarios. Theoretical analysis on the proposed algorithms are provided, as well as extensive experimental results and evaluations for demonstrating the effectiveness and advantages of the two methods.