Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/74680
標題: 使用三維模型來發展三維模型浮水印
作者: 王宗銘 
陳孝文
關鍵字: 三維浮水印模型;三維多面體網格模型;K-D Tree演算法;光譜係數值
出版社: 國立中興大學工學院;Airiti Press Inc.
Project: 興大工程學刊, Volume 14, Issue 2, Page(s) 123-134.
摘要: 
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. Watermarks normally consist of image information or bit streams such as 0 and 1, severely restricting the applications of digital watermarking. In this paper, we present a novel robust watermarking method that adds a watermark represented as a 3D model into a 3D polygonal mesh in the mesh’s spectral domain. To our best knowledge this is the original approach resented in the literature of watermarking 3D polygonal mesh. Our approach first adopts the K-D tree algorithm to search several sub-meshes in the original 3D polygonal mesh. We then calculate the Kirchhoff matrices, eigenvectors, and spectral coefficients corresponding to the sub-meshes and the 3D watermark, respectively. Finally, we embed the 3D watermark by modifying the magnitude of the summated weighted spectral coefficients. Experimental results show that the proposed method are resistant to similarity transformation, random noise added to vertex coordinates, and mesh smoothing. In conclusion, our method extends the feasibility of the digital watermarking in 3 dimensional polygonal meshes.

大多數的浮水印技術通常將浮水?資訊藏入二維影像或三維模型中,但是藏入的浮水印通常侷限於影像資料或是0、1位元資訊,因此限制了浮水印技術的應用範圍。故本論文採用三維模型作為浮水印,並將之葞入三維原始模型的光譜域中,如此便可以改進傳統浮水印技術的限制。首先,我們利用K-D Tree演算法在三維原始模型中選定數個子網格(sub-mesh),以作為三維浮水印模型預定藏入之處。接著,我們分別求出sub-mesh與三維浮水印模型各自的Kirchhoff矩陣、特徵向量與光譜係數值。最後,我們對兩個模型的光譜係數值做加權相日處理後,就可將三維浮水印模型巧妙地藏入三維原始模型中,而且也能夠抵抗放大、平移、旋轉、雜訊與平滑化等破壞攻擊,故符合浮水印強韌性之需求。此外,利用K-D Tree演算法可以有效降低選定sub-mesh之搜尋時間。因此,我們的方法促使浮水印技術的應用範疇更為廣泛。
URI: http://hdl.handle.net/11455/74680
ISSN: 1017-4397
Appears in Collections:第14卷 第2期
工學院

Show full item record
 
TAIR Related Article

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.