In this study, a new (r, n)-threshold secret image sharing scheme with low information overhead for images is provided, which has a low distortion rate, and is more applicable for light images. A secret image is encoded into n noise-like shadow images to satisfy the condition that any r of the n shares can be used to reveal the secret image, and no information on the secret can be revealed from any r -1 or fewer shares. The size of the shadow images is relatively small. The experimental results show the effectiveness of the proposed scheme.
A new fast approach to the nearest codeword search using a single kick-out condition is proposed. The nearest codeword found by the proposed approach is identical to the one found by the full search, although the processing time is much shorter. The principle is to bypass those codewords which satisfy the proposed kick-out condition without the actual (and time-consuming) computation of the distortions from the bypassed codewords to the query vector. Due to the efficiency and simplicity of the proposed condition, a considerable saving of the central processing unit time needed to encode a data set (using a given codebook) can be achieved. Moreover, the memory requirement is low. Comparisons with some recent works are included to show these two benefits.Index Terms-Fast searching, nearest codeword.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.