【摘要】：隨著互聯(lián)網(wǎng)的迅猛發(fā)展和日益普及,越來越多的人們開始利用網(wǎng)絡(luò)發(fā)布自己的作品、傳遞數(shù)據(jù)、共享信息,多媒體數(shù)據(jù)的存儲(chǔ)、復(fù)制與傳播變得越來越容易。網(wǎng)絡(luò)在方便人們交流的同時(shí),也對(duì)多媒體作品的版權(quán)保護(hù)提出了新的挑戰(zhàn)。隨意篡改、肆意傳播數(shù)字作品,甚至侵犯版權(quán)行為,已經(jīng)引起人們的高度重視,數(shù)字作品的版權(quán)問題亟待解決。 數(shù)字水印技術(shù),作為保護(hù)數(shù)字作品版權(quán)的有效手段,為人們打擊盜版,保護(hù)多媒體知識(shí)產(chǎn)權(quán)提供了新思路。魯棒數(shù)字水印技術(shù)在數(shù)字內(nèi)容保護(hù)的相關(guān)領(lǐng)域中有很好的應(yīng)用價(jià)值,如盜版追蹤、拷貝控制和版權(quán)保護(hù)等。但目前魯棒水印技術(shù)方面的研究還不是很充分,還有很多技術(shù)方面的難題需要解決。本學(xué)位論文將粒子群優(yōu)化算法應(yīng)用于數(shù)字水印的嵌入算法中,以提高水印算法的魯棒性。 首先,利用小波變換的多分辨分析特性,對(duì)二維載體信號(hào)做一層小波分解,提取中低頻系數(shù),并進(jìn)行分塊處理,對(duì)每一塊系數(shù)進(jìn)行離散余弦變換。 其次,設(shè)計(jì)自適應(yīng)量化算法。利用粒子群優(yōu)化算法,在載體信號(hào)的二維空間中動(dòng)態(tài)搜索水印的最優(yōu)嵌入位置,并取出最優(yōu)嵌入位置上的系數(shù),根據(jù)這些系數(shù)的特點(diǎn),在載體信號(hào)的三維空間中動(dòng)態(tài)地確定水印算法的最優(yōu)量化步長。 最后,利用得到的最優(yōu)嵌入位置與最優(yōu)量化步長,將水印信息自適應(yīng)地嵌入到水印載體中,得到含有水印的載體信號(hào)。 實(shí)驗(yàn)結(jié)果表明,本學(xué)位論文提出的基于雙重變換域的魯棒水印算法與傳統(tǒng)水印算法相比,不僅消除了變換過程中可能產(chǎn)生的塊效應(yīng),而且充分利用粒子群優(yōu)化算法確定了水印嵌入的最優(yōu)位置與最優(yōu)量化步長,實(shí)現(xiàn)了自適應(yīng)地嵌入,提高了水印的不可感知性與魯棒性。通過一系列的攻擊實(shí)驗(yàn)與對(duì)比實(shí)驗(yàn)證明,本學(xué)位論文中提出的算法構(gòu)造的水印系統(tǒng)性能優(yōu)于傳統(tǒng)算法。
[Abstract]:With the rapid development and popularity of the Internet, more and more people begin to use the network to publish their works, transfer data, share information, multimedia data storage, replication and dissemination become more and more easy. Network not only facilitates communication, but also poses new challenges to copyright protection of multimedia works. Arbitrary tampering, wanton dissemination of digital works, and even copyright infringement have attracted great attention, and the copyright problems of digital works need to be solved urgently. Digital watermarking technology, as an effective means to protect copyright of digital works, provides a new way for people to crack down on piracy and protect multimedia intellectual property. Robust digital watermarking technology has good application value in the field of digital content protection, such as piracy tracking, copy control and copyright protection. However, the research on robust watermarking is not enough, and there are still many technical problems to be solved. In this thesis, particle swarm optimization algorithm is applied to the embedding algorithm of digital watermarking to improve the robustness of the watermarking algorithm. Firstly, using the multi-resolution analysis characteristic of wavelet transform, the two-dimensional carrier signal is decomposed by a layer of wavelet, the middle and low frequency coefficients are extracted and processed in blocks, and each coefficient is transformed by discrete cosine transform. Secondly, an adaptive quantization algorithm is designed. The particle swarm optimization algorithm is used to dynamically search the optimal embedding position of the watermark in the two-dimensional space of the carrier signal, and the coefficients on the optimal embedding position are extracted. According to the characteristics of these coefficients, The optimal quantization step size of the watermarking algorithm is dynamically determined in the three dimensional space of the carrier signal. Finally, using the optimal embedding position and the optimal quantization step, the watermark information is adaptively embedded into the watermark carrier, and the carrier signal containing the watermark is obtained. Experimental results show that the proposed robust watermarking algorithm based on dual transform domain not only eliminates the block effect in the transformation process, but also compares with the traditional watermarking algorithm. Moreover, the particle swarm optimization (PSO) algorithm is used to determine the optimal position and the optimal quantization step size of the watermark embedding, which realizes adaptive embedding and improves the inperceptibility and robustness of the watermark. Through a series of attack experiments and contrast experiments, it is proved that the performance of the proposed algorithm is superior to that of the traditional algorithm.
【學(xué)位授予單位】：延邊大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP309.7

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 王云曉;王成儒;;一種新的基于Contourlet變換的數(shù)字圖像零水印算法[J];燕山大學(xué)學(xué)報(bào);2010年06期

2 徐達(dá)文;王讓定;;基于分塊三維小波變換的盲視頻水印算法[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年S1期

3 李濤;孫銳;徐彩臣;;基于Contourlet域偽3D-DCT變換的視頻水印[J];電子測量與儀器學(xué)報(bào);2011年08期

4 唐松生;董穎;;數(shù)字視頻水印技術(shù)綜述[J];計(jì)算機(jī)安全;2007年09期

5 劉宇,覃征,盧江,史哲文;多模態(tài)粒子群集成神經(jīng)網(wǎng)絡(luò)[J];計(jì)算機(jī)研究與發(fā)展;2005年09期

6 歐陽春娟;楊群生;劉昌鑫;;基于粒子群優(yōu)化的DCT域盲水印算法[J];井岡山大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年02期

7 李昊;呂建平;楊芳芳;;基于正負(fù)量化的DCT域數(shù)字圖像盲水印算法研究[J];計(jì)算機(jī)工程與應(yīng)用;2011年05期

8 林曉圓;趙健;謝瑜;余秋菊;;圖像擬仿射變換的DWT水印算法[J];計(jì)算機(jī)工程與應(yīng)用;2011年12期

9 劉爭艷;李絮;王峰;;基于粒子群優(yōu)化及二維映射的視頻水印算法[J];計(jì)算機(jī)工程與應(yīng)用;2011年35期

10 曹玉強(qiáng);龔衛(wèi)國;柏森;尤春艷;;基于Curvelet變換的魯棒信息隱藏算法[J];計(jì)算機(jī)工程;2011年05期

相關(guān)博士學(xué)位論文 前1條

1 肖尚勤;魯棒數(shù)字水印算法研究[D];華中科技大學(xué);2008年

相關(guān)碩士學(xué)位論文 前6條

1 劉如京;基于Contourlet變換的數(shù)字水印技術(shù)研究[D];湖南大學(xué);2011年

2 張敏;數(shù)字音頻水印技術(shù)研究[D];哈爾濱工程大學(xué);2004年

3 魏先民;魯棒水印技術(shù)研究[D];山東科技大學(xué);2005年

4 黃菊;魯棒數(shù)字水印研究[D];重慶大學(xué);2007年

5 尹強(qiáng);基于粒子群算法的半脆弱水印技術(shù)研究[D];西南交通大學(xué);2008年

6 程雪;基于分?jǐn)?shù)階傅里葉變換的數(shù)字水印技術(shù)研究[D];南京理工大學(xué);2009年

，

本文編號(hào)：2119875