Threshold Schemes with Minimum Pixel Expansion. Furht, B., editor In Encyclopedia of Multimedia, pages 873–874. Springer US, 2008. 00000![Threshold Schemes with Minimum Pixel Expansion [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex DefinitionIn visual secrete sharing schemes, attempts have been made to restrict the pixel expansion while images with high contrast are produced.Although results obtained via a (k,n)-visual secret sharing (VSS) scheme can be easily revealed by a human observer without any computations, the size of shares is usually much larger compared to the size of the original input image. By encrypting the secret pixel into m1m2 blocks of share pixels, the expansion is determined by the so-called expansion factor m1m2 which denotes the number of columns of the n × m1m2 basis matrices. In the recent past, attempts have been made to restrict the pixel expansion while images with high contrast are produced. The designer most often has to trade pixel expansion constraints to the recovered image quality and/or the order of (k,n)-threshold schemes [1–3].A probabilistic VSS scheme which offers no pixel expansion (m1m2 = 1) which can be regarded as a VSS scheme with the minimum pixel expansion i ...
@incollection{furht_threshold_2008,
title = {Threshold {Schemes} with {Minimum} {Pixel} {Expansion}},
copyright = {©2008 Springer-Verlag},
isbn = {978-0-387-74724-8 978-0-387-78414-4},
url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_230},
abstract = {DefinitionIn visual secrete sharing schemes, attempts have been made to restrict the pixel expansion while images with high contrast are produced.Although results obtained via a (k,n)-visual secret sharing (VSS) scheme can be easily revealed by a human observer without any computations, the size of shares is usually much larger compared to the size of the original input image. By encrypting the secret pixel into m1m2 blocks of share pixels, the expansion is determined by the so-called expansion factor m1m2 which denotes the number of columns of the n × m1m2 basis matrices. In the recent past, attempts have been made to restrict the pixel expansion while images with high contrast are produced. The designer most often has to trade pixel expansion constraints to the recovered image quality and/or the order of (k,n)-threshold schemes [1–3].A probabilistic VSS scheme which offers no pixel expansion (m1m2 = 1) which can be regarded as a VSS scheme with the minimum pixel expansion i ...},
language = {en},
urldate = {2016-05-03},
booktitle = {Encyclopedia of {Multimedia}},
publisher = {Springer US},
editor = {Furht, Borko},
year = {2008},
note = {00000},
pages = {873--874}
}
Downloads: 0
{"_id":"mzGEe6qfHdQpqxfCW","bibbaseid":"furht-thresholdschemeswithminimumpixelexpansion-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","title":"Threshold Schemes with Minimum Pixel Expansion","copyright":"©2008 Springer-Verlag","isbn":"978-0-387-74724-8 978-0-387-78414-4","url":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_230","abstract":"DefinitionIn visual secrete sharing schemes, attempts have been made to restrict the pixel expansion while images with high contrast are produced.Although results obtained via a (k,n)-visual secret sharing (VSS) scheme can be easily revealed by a human observer without any computations, the size of shares is usually much larger compared to the size of the original input image. By encrypting the secret pixel into m1m2 blocks of share pixels, the expansion is determined by the so-called expansion factor m1m2 which denotes the number of columns of the n × m1m2 basis matrices. In the recent past, attempts have been made to restrict the pixel expansion while images with high contrast are produced. The designer most often has to trade pixel expansion constraints to the recovered image quality and/or the order of (k,n)-threshold schemes [1–3].A probabilistic VSS scheme which offers no pixel expansion (m1m2 = 1) which can be regarded as a VSS scheme with the minimum pixel expansion i ...","language":"en","urldate":"2016-05-03","booktitle":"Encyclopedia of Multimedia","publisher":"Springer US","editor":[{"propositions":[],"lastnames":["Furht"],"firstnames":["Borko"],"suffixes":[]}],"year":"2008","note":"00000","pages":"873–874","bibtex":"@incollection{furht_threshold_2008,\n\ttitle = {Threshold {Schemes} with {Minimum} {Pixel} {Expansion}},\n\tcopyright = {©2008 Springer-Verlag},\n\tisbn = {978-0-387-74724-8 978-0-387-78414-4},\n\turl = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_230},\n\tabstract = {DefinitionIn visual secrete sharing schemes, attempts have been made to restrict the pixel expansion while images with high contrast are produced.Although results obtained via a (k,n)-visual secret sharing (VSS) scheme can be easily revealed by a human observer without any computations, the size of shares is usually much larger compared to the size of the original input image. By encrypting the secret pixel into m1m2 blocks of share pixels, the expansion is determined by the so-called expansion factor m1m2 which denotes the number of columns of the n × m1m2 basis matrices. In the recent past, attempts have been made to restrict the pixel expansion while images with high contrast are produced. The designer most often has to trade pixel expansion constraints to the recovered image quality and/or the order of (k,n)-threshold schemes [1–3].A probabilistic VSS scheme which offers no pixel expansion (m1m2 = 1) which can be regarded as a VSS scheme with the minimum pixel expansion i ...},\n\tlanguage = {en},\n\turldate = {2016-05-03},\n\tbooktitle = {Encyclopedia of {Multimedia}},\n\tpublisher = {Springer US},\n\teditor = {Furht, Borko},\n\tyear = {2008},\n\tnote = {00000},\n\tpages = {873--874}\n}\n\n","editor_short":["Furht, B."],"key":"furht_threshold_2008","id":"furht_threshold_2008","bibbaseid":"furht-thresholdschemeswithminimumpixelexpansion-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_230"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:14.152Z","downloads":0,"keywords":[],"search_terms":["threshold","schemes","minimum","pixel","expansion"],"title":"Threshold Schemes with Minimum Pixel Expansion","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}