Fast Sharing, High-Capacity Hiding, and Their Applications in Images' Recovery
|關鍵字:||影像分享;影像隱藏;影像修復;image’s fast sharing;image’s high-capacity hiding|
This is a 3-year project. Year 1 is for the fast sharing of an image. Year 2 is for the design of high-capacity hiding methods, including the study of the upper bound of each cover image’s hiding capacity. Year 3 is for images’ authentication and recovery, by applying the fast sharing methods and high-capacity hiding methods designed in Years 1 and 2. Year 1 has three subtopics, as follows. 1a): the design of a fast sharing method based on Boolean operations. The storage space will be small, and the decoding time will be very short. 1b): to accelerate the polynomial-based (t, n) threshold sharing method. In general, polynomial-based image-sharing method is good in getting small-size shares; however, it is not fast. Therefore, we will analyze its repeated patterns and design a new algorithm to accelerate speed. 1c): fast sharing for a system with shares of dynamic weights. In many companies, people of different importance levels might have different weights when they vote for the disclosure of a shared secret image. The weights might also be dynamic to match the company’s dynamic developing. We will design a fast method for such system. Year 2 is has four subtopics. 2a): a lossless high-capacity image-hiding method based on secret image’s Hamming norm. 2b): a lossy high-capacity image hiding method based on the similarity between neighboring pixels of the secret image. The secret image can be several times larger than the cover image, with small distortion in the recovery of secret image. 2c): an upper bound of a cover image’s hiding capacity. It is a natural barrier for all hiding methods. We will require this upper bound be as low as possible. 2d): a high-capacity image hiding method based on a high-dimensional space for pixels. We will design a new method whose hiding-rate is close to the upper bound found in 2c) above. Year 3 is an application of the sharing methods and hiding methods designed in Years 1 and 2. The three subtopics are 3a): a block-based image authentication method with self-recovery of tampering. The method utilizes the accelerated-polynomial-based sharing of Year 1 and a hiding method of Year 2. The method detects which parts of the image are tampered, and then do automatic repairing. 3b): authentication and self-recovery of an image’s ROI (Region of interest). The image’s ROI will be shared and hidden in the non-ROI of the same image. Later, when the damaged area of the processed image is so large that it covers both ROI and non-ROI, the recovery of the ROI and non-ROI will be processed separately. 3c): using fast sharing in image’s fast-repairing. The given image will be shared by a module-based sharing method so that each share is small and easy to be hidden. After our processing, image will still look natural. Later, if being tampered, the image can still be recovered in a fast speed.
|Appears in Collections:||Research Plans|