Abstract
Block-based progressive visual cryptography scheme (BPVCS) divides a secret image into non-overlapping blocks and encodes each block as sub-shadows. The final shadows for BPVCS are created by combining the associated sub-shadows. When enough shadows are superimposed, some of the secret blocks will be exposed. More information will be revealed as more shadows are used. This is referred to as progressive recovery. Hou et al. introduced a (2,n)-BPVCS. Yang et al. further extended the (2,n) scheme to a general (k,n) scheme. However, Yang et al. (k,n)-BPVCS suffers from the non-uniform progressive recovery and inconsistent background of recovered secret blocks. In this paper, we introduce a (k,n)-BPVCS to address the mentioned two defects. Theoretical analysis and experimental results are provided to illustrate the benefits of the proposed approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Visual Communication and Image Representation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
