In this page we collect the data and images related to our interest in visual cryptography.
Leszek J Chmielewski, Mariusz Nieniewski and Arkadiusz Orłowski Authors
Copyright
Copyright (C) Leszek J Chmielewski, Arkadiusz Orłowski and Mariusz Nieniewski, and the copyright holders of the respective publications. These data are made available for personal and private reading purposes, as respective parts of preprints of the related papers. See also the notes inside the preprints available in the respective sections.
To use these data in your publication, besides the requirements posed by the Publishers of our relevant papers, you should cite the publication in which the files appeared, and this web page "www.lchmiel.pl/visualcrypto" .
L. J. Chmielewski, M. Nieniewski, and A. Orłowski. Error analysis and graphical evidence of randomness in two methods of color visual cryptography. In L. J. Chmielewski and A. Orłowski, editors, Computer Vision and Graphics: Proc. ICCVG 2022, volume 598 of Lecture Notes in Networks and Systems, pages 237–267, Warsaw, Poland, 19-21 Sep 2022. Springer, Cham, 2023. DOI:10.1007/978-3-031-22025-8_17. (Preprint)
L. J. Chmielewski, M. Nieniewski, and A. Orłowski. Truly random color visual cryptography without surplus color spikes. In P. Jędrzejowicz and I. Czarnowski, editors, Proc. 3rd Polish Conference on Artificial Intelligence PP-RAI’2022, pages 53–56, Gdynia, Poland, 25-27 Apr 2022. Publishing House of Gdynia Maritime University. https://wydawnictwo.umg.edu.pl/pp-rai2022/. (Preprint)
L. J. Chmielewski, M. Nieniewski, and A. Orłowski. Testing the randomness of shares in color visual cryptography. Pattern Analysis and Applications (2021) DOI:10.1007/s10044-021-00999-5. (Preprint) go to files
L. J. Chmielewski, M. Nieniewski, and A. Orłowski. Can color visual cryptography be truly random? In M. Chora¶, R. S. Chora¶, M. Kurzyński, et al., editors, Progress in Image Processing, Pattern Recognition and Communication Systems – Proc. Int. Conf. CORES, IP&C, ACS 2021, volume 255 of Lecture Notes in Networks and Systems, pages 72–86, Bydgoszcz, Poland, 28-30 Jun 2021. Springer, 2022. DOI:https://doi.org/10.1007/978-3-030-81523-3_7. (Preprint) go to files
L. J. Chmielewski and A. Orłowski. Does randomness in the random visual cryptography protocol depend on the period of pseudorandom number generators? In L. J. Chmielewski, R. Kozera, and A. Orłowski, editors, Computer Vision and Graphics: Proc. ICCVG 2020, volume 12334 of Lecture Notes in Computer Science, pages 36–47, Warsaw, Poland, 14-16 Sep 2020. Springer. DOI:10.1007/978-3-030-59006-2_4. (Preprint)
L. J. Chmielewski, G. Gawdzik, and A. Orłowski. Towards color visual cryptography with completely random shares. In Proc. Conf. PP-RAI 2019 – Konf. Polskiego Porozumienia na rzecz Rozwoju Sztucznej Inteligencji, pages 150–155, Wrocław, Poland, 16-18 Oct 2019. Wrocław University of Science and Technology. http://pp-rai.pwr.edu.pl/PPRAI19_proceedings.pdf. (Preprint)
A. Orłowski and L. J. Chmielewski. Color visual cryptography with completely randomly coded colors. In M. Vento and G. Percannella, editors, Proc. Int. Conf. on Computer Analysis of Images and Patterns CAIP 2019, volume 11678 of Lecture Notes in Computer Science, pages 589–599, Salerno, Italy, 2-6 Sep 2019. Springer. DOI:10.1007/978-3-030-29888-3_48. (Preprint)
A. Orłowski and L. J. Chmielewski. Randomness of shares versus quality of secret reconstruction in black-and-white visual cryptography. In L. Rutkowski et al., editors, Proc. Int. Conf. on Artificial Intelligence and Soft Computing ICAISC 2019, volume 11509 of Lecture Notes in Artificial Intelligence, pages 58–69, Zakopane, Poland, 16-20 Jun 2019. Springer. DOI:10.1007/978-3-030-20915-5_6. (Preprint)
A. Orłowski and L. J. Chmielewski. Generalized visual cryptography scheme with completely random shares. In N. Petkov, N. Strisciuglio, and C. M. Travieso, editors, Proc. 2nd Int. Conf. Applications of Intelligent Systems APPIS 2019, pages 33:1–33:6, Las Palmas de Gran Canaria, Spain, 7-9 Jan 2019. Association for Computing Machinery. DOI:10.1145/3309772.3309805. (Preprint)
Files for:
L. J. Chmielewski, M. Nieniewski, and A. Orłowski. Testing the randomness of shares in color visual cryptography. Pattern Analysis and Applications (2021) DOI:10.1007/s10044-021-00999-5
Files for:
L. J. Chmielewski, M. Nieniewski, and A. Orłowski. Can color visual cryptography be truly random? Progress in Image Processing, Pattern Recognition and Communication Systems – Proc. Conf. (CORES, IP&C, ACS) 2021. Chora¶, M.; Chora¶, R.S.; Kurzyński, M.; others., Eds. Vol. 255 in Lecture Notes in Networks and Systems, pp. 72-86. Springer (2021) DOI:10.1007/978-3-030-81523-3_7
The images were collected during the years of our work in various web resources, mainly those listed in [1] and [2]. These pages are historical, they have undergone many changes, and with time many links disappeared. Therefore, now it is difficult to find many of the images in them. It is also difficult or impossible to track the original source and the authors. For years they have been freely used by the people working in image processing, they have been used in numerous publications, so we assume we can also use them in the same way. See also [3] for explanations.
The images with reduced sizes were scaled down with the IrfanView graphic viewer [4], function "Image | Resize/Resample", Size method: Resample, Filter: Lanczos.