A modified sharing method for image conservation.pdfVIP

國立臺南大學 「理工研究學報」第 42卷第 1期（民國 97年）：49～58 49 A modified sharing method for image conservation Chen Shang-Kuan Department of Computer Science and Information Engineering Yuanpei University, Hsinchu, Taiwan Abstract The paper is proposed for image conservation. It improves the traditional (r, n)-threshold image sharing method. The traditional image sharing method generates n shadow images from a significant image which can be fault-tolerantly recovered by collecting at least r of the n shadow images. Therefore we can create a fault-tolerant image database for conservation by the method. However, by using the method, the shadow images are fragile. The reason is that even if a bit error occurs on one of the shadow images, the region of recovered image corresponding to that error bit is destroyed seriously. In the proposed paper, the sharing method is improved to be able to automatically fix most of the distortion of the image due to unstable transmitting the shadow images. Keywords : image sharing, image conservation. Chen Shang-Kuan 50 1. Introduction Blakley (Blakley, 1979) and Shamir (Shamir, 1979) first proposed the idea of secret sharing, named (r, n)-threshold scheme. By adopting the idea, n shares can be generated and distributed by the dealer. The secret can be fault-tolerantly recovered if at least r shares are received. There is no idea to achieve anything about the secret, if the receiver only receives less than r shares. Naor and Shamir (Naor, Shamir, 1995) introduced the so-called (r, n)-threshold visual secret sharing scheme. By using their scheme, a secret image is encrypted into n transparencies, called shares. Stacking at least r of the n generated shares together can decrypt the secret, but stacking less than r shares together gives no information about the secret. Hou (Hou, 2003) and Shyu (Shyu, 2006) introduced color versions of visual secret sharing schemes, w