{"title":"(2,n)视觉阈值方案的像素扩展研究","authors":"Liguo Fang, Bin Yu","doi":"10.1109/SPCA.2006.297546","DOIUrl":null,"url":null,"abstract":"Two parameters, pixel expansion and contrast, are very important in visual cryptography. It's very difficult to optimize both of them in theory. Based on combination, A (2, n) scheme, which existence has been proved theoretically, has been proposed in this paper. Meantime, the method of construct has been carried out. Simulation results demonstrate that this scheme can balance performance between pixel expansion and contrast, i.e. the contrast is close to optimality, meanwhile the pixel expansion is the minimal","PeriodicalId":232800,"journal":{"name":"2006 First International Symposium on Pervasive Computing and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"Research on Pixel Expansion of (2,n) Visual Threshold Scheme\",\"authors\":\"Liguo Fang, Bin Yu\",\"doi\":\"10.1109/SPCA.2006.297546\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two parameters, pixel expansion and contrast, are very important in visual cryptography. It's very difficult to optimize both of them in theory. Based on combination, A (2, n) scheme, which existence has been proved theoretically, has been proposed in this paper. Meantime, the method of construct has been carried out. Simulation results demonstrate that this scheme can balance performance between pixel expansion and contrast, i.e. the contrast is close to optimality, meanwhile the pixel expansion is the minimal\",\"PeriodicalId\":232800,\"journal\":{\"name\":\"2006 First International Symposium on Pervasive Computing and Applications\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 First International Symposium on Pervasive Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPCA.2006.297546\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 First International Symposium on Pervasive Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCA.2006.297546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on Pixel Expansion of (2,n) Visual Threshold Scheme
Two parameters, pixel expansion and contrast, are very important in visual cryptography. It's very difficult to optimize both of them in theory. Based on combination, A (2, n) scheme, which existence has been proved theoretically, has been proposed in this paper. Meantime, the method of construct has been carried out. Simulation results demonstrate that this scheme can balance performance between pixel expansion and contrast, i.e. the contrast is close to optimality, meanwhile the pixel expansion is the minimal
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
