By Topic

Efficient Construction for Region Incrementing Visual Cryptography

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shyong Jian Shyu ; Dept. of Comput. Sci. & Inf. Eng., Ming Chuan Univ., Taoyuan, Taiwan ; Hung-Wei Jiang

A region incrementing visual cryptography scheme (RIVCS) deals with the sharing of an image consisting of multiple regions with different secrecy levels, which can be incrementally revealed as the number of shares increases. The encoding basis matrices of RIVCS for an image containing three to five regions have been reported in the literature, but no construction method has ever been studied. We develop a novel and efficient construction for RIVCS using linear programming in this paper. The proposed integer linear program aims at the minimization of the pixel expansion under the constraints for being a RIVCS. Experimental results demonstrate the feasibility, applicability, and flexibility of our construction. The pixel expansions and contrasts derived from our scheme are also better than the previous results.

Published in:

Circuits and Systems for Video Technology, IEEE Transactions on  (Volume:22 ,  Issue: 5 )