Method based on Naor Shamir 1995, proposes a method without growing file size and losses in quality or contrast
Probably not really connected to our theme, but some useful references ther
Sometimes (n, n+1) MSIS provide partial information about image with k < n shares, provides mehod to disable this Also uses modular arithmetics to reduce time spent on decrypting
2 page article from the author of algorithm Basic principles of sharing secret
Sharing secret applied to images Problems of proposed scheme: 1 pixel of secret image is mapped into several pixels in shared transparencies, so there is loss in contrast and resolution, also image size increased
Naor Shamir's image algorithm without expansion to multiple pixels, but with loss in contrast
Matrix projection combined with shamir's iss, decrypting in real time (but no info provided about possibility of exposing secret in less than k shares)
Cool article about hiding info in noise of another images and reconstructing original image
Review of various methods
Big fat book about image encrypting
Хабр про схему шамира - пересказ оригинальной статьи на русском, подробнее расписано про то, зачем нужна модульная арифметика
https://github.com/gburca/ssss-js/
Сайт с демо библиотеки https://ebixio.com/ssss.html