尚未登入 請由此登入
 
 
 










知識分享平台Eshare檢視資訊View
返回前一頁Back
      [檢舉]

標題Title: An Efficient VQ-based Data Hiding Scheme Using Voronoi Clustering
作者Authors: 李育強,Ming-Ni Wu..等
上傳單位Department: 資訊工程系
上傳時間Date: 2009-12-1
上傳者Author: 李育強
審核單位Department: 資訊工程系
審核老師Teacher: 李育強
檔案類型Categories: 研討會報告Seminar Report
關鍵詞Keyword: data hiding, Voronoi diagram, vector quantization
摘要Abstract: In this paper, we propose a vector quantization (VQ)-based information hiding scheme that cluster the VQ codeowrds according the codewords’ relation on Voronoi Diagram (VD). The clustering method is fast and easy to implement when projecting the codewords into VD space. The hiding capacities can be adaptive adjusted just modifying the threshold value which didn’t need reorganizing the codebook sequence. Besides, the image quality is acceptable when raising the embedding capacity. Experiments demonstrate that the method can efficiently hiding the secret data into VQ indexes by the fast hiding procedure, high hiding capacity and good image quality.

檔案名稱
FileName
檔案大小
Size
檔案格式
Format
瀏覽次數
Browses
下載次數
Downloads
2009_12_9bf674b3.ppt 1450Kb ppt 547 189
文件中檔案:
 

開啟檔案Download
 
 
返回前一頁