本文選題：壓縮感知　切入點(diǎn)：數(shù)字水印　出處：《華北電力大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著互聯(lián)網(wǎng)與多媒體技術(shù)的普及,數(shù)字產(chǎn)品的存儲(chǔ)、復(fù)制和傳播越來(lái)越便捷,但同時(shí)多媒體數(shù)據(jù)的安全性也遭受著越來(lái)越多的威脅。輸入輸出設(shè)備的發(fā)展和高精度產(chǎn)品的出現(xiàn)使得偽造更加容易；通信技術(shù)的發(fā)展與普及,數(shù)字作品、電子出版物的傳播與交易變得越來(lái)越便捷,侵權(quán)盜版活動(dòng)也日益猖獗；互聯(lián)網(wǎng)的普及與黑客技術(shù)的出現(xiàn)使得機(jī)要信息的發(fā)布、傳遞、管理更加容易引起攻擊者的注意,這樣的情況讓加密數(shù)據(jù)與未加密數(shù)據(jù)幾乎一樣危險(xiǎn)。傳統(tǒng)的加密措施已經(jīng)無(wú)法解決現(xiàn)今面臨的各種問(wèn)題,數(shù)字水印技術(shù)作為信息隱藏技術(shù)的一個(gè)分支,在版權(quán)保護(hù)、完整性認(rèn)證和保密通信方面具有不可小覷的作用。現(xiàn)有數(shù)字水印算法的研究成果大多集中在變換域,此類方法嵌入水印相對(duì)于空域而言數(shù)據(jù)量較大,安全性較高,魯棒性較強(qiáng),但是其計(jì)算復(fù)雜且抗攻擊能力和防提取能力仍然有限。 壓縮感知(CRPSUHVVLYH6HQVLQJ, C6)是最早由CDQGHV等人提出的優(yōu)于傳統(tǒng)香農(nóng)采樣理論的新理論,它針對(duì)稀疏或者可壓縮信號(hào),能夠在信號(hào)采樣的同時(shí)對(duì)數(shù)據(jù)進(jìn)行壓縮,且其采樣率遠(yuǎn)遠(yuǎn)低于lyTXLVW采樣定理限制下的采樣率,該理論能夠通過(guò)一定的優(yōu)化算法由少量采樣數(shù)據(jù)來(lái)完美重建信號(hào)。C6理論有三個(gè)核心過(guò)程,分別為：信號(hào)的稀疏化、感知矩陣的構(gòu)建和信號(hào)的重建,該理論具有比D：7、DC7以及小波變換所無(wú)法企及的優(yōu)勢(shì),因此本文將壓縮感知應(yīng)用于數(shù)字水印算法的研究,能夠得到更為魯棒、更為安全的數(shù)字水印。 本文首先深入的研究了先前的數(shù)字水印算法和C6理論及其重建方法,然后結(jié)合人眼視覺(jué)系統(tǒng)(HXPDQ9LVXDO6yVWHP, H96)的特性,提出一種較高性能的數(shù)字水印算法,該算法主要利用塊不均勻度來(lái)選取容量大的子塊,采用量化的方法自適應(yīng)的選擇量化步長(zhǎng)來(lái)嵌入經(jīng)過(guò)置亂處理后的數(shù)字水印,然后詳細(xì)的介紹該算法實(shí)現(xiàn)步驟。經(jīng)實(shí)驗(yàn)驗(yàn)證,該算法可保證數(shù)字水印具有更好的魯棒性、隱蔽性和安全性,并且提高含水印圖像的抗攻擊能力和防提取能力,而且提取水印不需原圖像的參與,能夠大大降低存儲(chǔ)成本。
[Abstract]:With the popularity of the Internet and multimedia technology, the storage, replication and dissemination of digital products are becoming more and more convenient. But at the same time, the security of multimedia data is also being threatened by more and more. The development of input and output equipment and the appearance of high-precision products make it easier to forge, the development and popularization of communication technology, digital works, The dissemination and transaction of electronic publications have become more and more convenient, and piracy activities have become increasingly rampant. With the popularity of the Internet and the emergence of hacker technology, the publication, transmission, and management of confidential information are more likely to attract the attention of attackers. This situation makes encrypted data almost as dangerous as unencrypted data. Traditional encryption measures can no longer solve the problems faced today. Digital watermarking technology, as a branch of information hiding technology, is protected by copyright. The research results of the existing digital watermarking algorithms are mostly focused on the transform domain. Compared with the spatial domain, this method has a large amount of data, high security, strong robustness. However, its computational complexity and its ability to resist attack and extraction are still limited. CRPSU HVVLYH6HQVLQJ (C6) is a new theory proposed by CDQGHV et al. It is superior to the traditional Shannon sampling theory. It can compress the data while sampling the signal for sparse or compressible signals. The sampling rate is far lower than the sampling rate limited by the lyTXLVW sampling theorem. The theory can reconstruct the signal perfectly by a small amount of sampling data through a certain optimization algorithm. There are three core processes of the theory: sparse signal. The theory of perception matrix construction and signal reconstruction has more advantages than that of D7 / DC7 and wavelet transform. Therefore, this paper applies compressed sensing to the research of digital watermarking algorithm and can obtain more robust and secure digital watermarking. In this paper, the previous digital watermarking algorithm, the C6 theory and the reconstruction method are studied in depth, and then a high performance digital watermarking algorithm is proposed based on the characteristics of the human visual system (HXPDQ9LVXDO6yVWHP, H96). The algorithm mainly uses block inhomogeneity to select large capacity sub-blocks, adopts quantization method to select quantization step size adaptively to embed the scrambled digital watermark, and then introduces the implementation steps of the algorithm in detail. This algorithm can guarantee better robustness, concealment and security of digital watermarking, and improve the ability of resisting attack and anti-extraction of watermark image. Moreover, the watermark extraction does not need the participation of the original image, so the storage cost can be greatly reduced.
【學(xué)位授予單位】：華北電力大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP309.7;TN911.7

【參考文獻(xiàn)】

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

1 石光明;劉丹華;高大化;劉哲;林杰;王良君;;壓縮感知理論及其研究進(jìn)展[J];電子學(xué)報(bào);2009年05期

2 李旭東;;圖像量化水印方法中量化公式的最優(yōu)化分析[J];光電工程;2010年02期

3 魏豐;梁棟;張成;鮑文霞;;基于壓縮感知觀測(cè)值的數(shù)字圖像水印算法[J];安徽大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年03期

4 張永平;蘇廣川;;基于小波樹(shù)的數(shù)字圖像盲水印技術(shù)[J];計(jì)算機(jī)工程與應(yīng)用;2006年13期

5 劉芳;賈成;馮雁;劉歆;;圖像置亂在數(shù)字水印中的應(yīng)用研究[J];通信技術(shù);2008年09期

6 許君一;熊昌鎮(zhèn);齊東旭;黃繼武;;量化水印算法分析[J];通信學(xué)報(bào);2006年03期

7 陳國(guó)法;郭樹(shù)旭;李楊;李亮;;基于壓縮感知的數(shù)字圖像水印算法[J];現(xiàn)代電子技術(shù);2012年13期

8 張小華,劉芳焦,李成;一種基于混沌序列的圖象加密技術(shù)[J];中國(guó)圖象圖形學(xué)報(bào);2003年04期

9 張專成;張殿富;閆小萍;;一種魯棒的基于DWT域自適應(yīng)量化步長(zhǎng)的圖像盲水印算法[J];中國(guó)圖象圖形學(xué)報(bào);2006年06期

10 佟雨兵;張其善;祁云平;;基于PSNR與SSIM聯(lián)合的圖像質(zhì)量評(píng)價(jià)模型[J];中國(guó)圖象圖形學(xué)報(bào);2006年12期

，

本文編號(hào)：1607227