The Research of Image Data Hiding Based on Coloring in Minimum Spanning Tree
碩士 === 國立清華大學 === 資訊系統與應用研究所 === 94 === Image data hiding is mainly served as transmitting secret information via side channel. The two conflicting properties: image quality and data capacity are the two major concerns to image data hiding. We study image data hiding using vector quantization (VQ) i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/47231068358315562070 |
| Summary: | 碩士 === 國立清華大學 === 資訊系統與應用研究所 === 94 === Image data hiding is mainly served as transmitting secret information via side channel. The two conflicting properties: image quality and data capacity are the two major concerns to image data hiding. We study image data hiding using vector quantization (VQ) in this thesis. In previous literatures, the difference of separated codebooks are not minimized in which will degrade the image quality.
Two approaches have been proposed to achieve a high image quality and data capacity by coloring in a minimum spanning tree. This will minimize the difference between separated codebooks.
These approaches are also implemented on frequency domain. In order to decrease distortion when embed secret data in images, only the high-band coefficients will be modified. The combined DCT-VQ gets much better image quality and more data capacity than traditional VQ.
One of our VQ schemes is shown to be the best theoretic heuristic solution. Our results have significant advantages over the others with experiments support.
|
|---|