Reversible data hiding based on block-selection strategy
碩士 === 國立臺北大學 === 資訊工程學系 === 106 === We studied the reversible data hiding scheme of images and proposed a method for optimizing regional complexity. In the proposed method, we are based on using pixel selection and embedding hidden data in the following manner. First of all, according to the comple...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/5nq2k9 |
| Summary: | 碩士 === 國立臺北大學 === 資訊工程學系 === 106 === We studied the reversible data hiding scheme of images and proposed a method for optimizing regional complexity. In the proposed method, we are based on using pixel selection and embedding hidden data in the following manner.
First of all, according to the complexity of the block, we can observe that under the large amount of storage, it is impossible to find a smooth block. So we use the value of reducing the pixel points in the block too large or too small to reduce the number of pixels observed to find the most average block of pixels to embed the value. The experimental results show that the proposed method can improve the discovery of good hidden value blocks under large capacity.
|
|---|