本篇論文一共提出三個結合資料探勘中關聯規則概念的浮水印技術。在第一個方法中，藉由在原始影像與彩色浮水印影像上定義關聯規則，並利用浮水印規則校準原始影像規則的程序來藏匿浮水印，以突破過去方法在資訊藏量以及浮水印型態上的限制；為了證明對於不同型態的浮水印仍然可達到相同藏匿浮水印的目的，在第二個方法中，針對隨機序列 (random sequence) 型態的浮水印，同樣以關聯規則來做浮水印的藏匿，並透過增加規則中的項目 (item) 數量，以提升不同浮水印之間的辨識率；在第三個方法中，則進一步將關聯規則概念的浮水印技術延伸至二維條碼影像上。藉由建立二維條碼影像與灰階浮水印影像之間規則的關聯性，使得二維條碼資訊存量能夠更有效的被利用，以藏匿更複雜的浮水印資訊。此外，直接利用取出的關聯規則即可驗證二維條碼與取出浮水印的正確性，有效解決過去方法在資訊藏量的限制與驗證機制上的不便。最後，實驗結果也與過去的方法做比較，以證實我們的方法確實是可行的，且對於所藏匿的浮水印有著更好的藏匿與檢測效果。

In this paper, we propose three association rule based watermark techniques. The association rules are defined on color image in the beginning. The watermark is embedded by aligning the original image’s rules with watermark’s rules. This new concept of watermarking can get over the limit of information capacity and type of watermarks considered the conventional methods. In order to clarify the various applications of difference watermark types, the second method uses the concept of association rules to embed watermark as a random sequence. In the random sequence case, the number of items of each rule is increased to enhance the recognizing capability of different watermarks. The third scheme extends our concept to 2D barcode. The information capacity of 2D barcode can be more efficient utilized, and more information is embedded by constructing associations between 2D barcode and watermark image. Beside, the proposed scheme can direct prove the correctness of 2D barcode and its extracted watermark by checking the variation of association rules, without any extra reserving data which are requested by the existent research results. According to our experiment results, compare with past methods, the proposed methods are feasible and better than the conventional watermarking techniques of the same applications.

目錄

中文摘要　………………………………………………………………I
英文摘要　………………………………………………………………II
致謝　……………………………………………………………………III
目錄　……………………………………………………………………IV
圖目錄　…………………………………………………………………VI
表目錄　…………………………………………………………………VIII

第一章　簡介　…………………………………………………………1
1.1　背景　…………………………………………………1
1.2　文獻探討　……………………………………………2
1.2.1　位元樣式類型浮水印　…………………3
1.2.2　隨機序列類型浮水印　…………………5
1.2.3　標章類型浮水印　………………………10
1.3　研究動機目的　………………………………………11
1.4　論文架構　……………………………………………14

第二章　相關技術　……………………………………………………16
2.1　關聯規則　……………………………………………16
2.2　離散餘弦轉換　………………………………………17
2.3　正好察覺破壞　………………………………………19
2.4　邊緣檢測方法　………………………………………20
2.5　PDF417二維條碼　……………………………………21
2.6　向量量化　……………………………………………23

第三章　使用關聯規則校準之浮水印技術　…………………………24
3.1　背景與目的　…………………………………………24
3.2　提出的方法　…………………………………………25
3.2.1　影像中關聯規則的定義　………………26
3.2.2　浮水印藏匿方法　………………………28
3.2.3　浮水印檢測方法　………………………30
3.3　實驗結果　……………………………………………31
3.4　結果與討論　…………………………………………34

第四章　植基於相似圖表之強韌關聯式浮水印技術　………………35
4.1　背景與目的　…………………………………………35
4.2　提出的方法　…………………………………………38
4.2.1　影像中關聯規則的定義　………………40
4.2.2　浮水印藏匿方法　………………………44
4.2.3　浮水印檢測方法　………………………47
4.3　實驗結果　……………………………………………50
4.4　結果與討論　…………………………………………57

第五章　使用二維條碼浮水印技術協助身份辨識　…………………59
5.1　背景與目的　…………………………………………59
5.2　提出的方法　…………………………………………60
5.2.1　編碼簿中編碼字的前置處理　…………61
5.2.2　影像中關聯規則的定義　………………64
5.2.3　浮水印藏匿方法　………………………66
5.2.4　浮水印還原與驗證方法　………………69
5.3　實驗結果　……………………………………………71
5.4　結果與討論　…………………………………………76

第六章　結論　…………………………………………………………78
參考文獻　………………………………………………………………80
附錄 (使用符號定義)　…………………………………………………84

圖目錄

圖1　數位浮水印的藏匿與檢測流程。……………………………………………2
圖2　可視浮水印範例。……………………………………………………………3
圖3　處理前與處理後的相似圖表。………………………………………………9
圖4　關聯規則浮水印技術概念關係圖。…………………………………………14
圖5　一個影像區塊的空間/頻率域矩陣轉換範例。……………………………19
圖6　3×3的空間區域。……………………………………………………………21
圖7　不同方向的濾波遮罩。………………………………………………………21
圖8　一個編碼字的結構。…………………………………………………………22
圖9　PDF417二維條碼結構。………………………………………………………22
圖10　向量量化壓縮示意圖。……………………………………………………23
圖11　浮水印的藏匿流程圖。……………………………………………………29
圖12　浮水印的檢測流程圖。……………………………………………………30
圖13　彩色浮水印、彩色Lena原始影像與藏匿浮水印後的彩色Lena影像。…32
圖14　藏匿浮水印後的彩色Lena影像經各種影像處理過後的結果。…………33
圖15　傳統隨機序列型態浮水印的藏匿流程圖。………………………………37
圖16　傳統隨機序列型態浮水印的檢測流程圖。………………………………37
圖17　使用關聯規則概念的浮水印藏匿流程圖。………………………………39
圖18　使用關聯規則概念的浮水印檢測流程圖。………………………………40
圖19　影像區塊編號示意圖。……………………………………………………41
圖20　由圖5的影像資料所得到的B4I(k)。………………………………………43
圖21　由圖5的影像資料所得到的B4W(k)。………………………………………43
圖22　浮水印藏匿流程圖。………………………………………………………45
圖23　浮水印檢測流程圖。………………………………………………………48
圖24　使用第100個key所產生的浮水印影像。…………………………………52
圖25　藏匿浮水印前的原始影像與藏匿浮水印後的影像。……………………53
圖26　藏匿浮水印後的Lena影像經各種影像處理過後的結果。………………54
圖27　Lena影像藏匿第100個浮水印經由不同影像處理後的相似圖表。………55
圖28　不同的影像處理攻擊下經檢測程序所獲得的SD分佈範圍。……………56
圖29　Lena影像藏匿區塊位置示意圖。…………………………………………57
圖30　類別編號藏匿範例。………………………………………………………63
圖31　元素編號藏匿範例。………………………………………………………63
圖32　二維條碼影像與浮水印影像上的關聯規則定義示意圖。………………64
圖33　第一個項目值取得示意圖。………………………………………………65
圖34　第三個項目值取得示意圖。………………………………………………66
圖35　浮水印藏匿方法流程圖。…………………………………………………67
圖36　 之第三個項目值修改示意圖。……………………………………………68
圖37　 之第一個項目值修改示意圖。……………………………………………69
圖38　浮水印還原與驗證方法流程圖。…………………………………………69
圖39　二維條碼影像與藏匿浮水印後的二維條碼影像。………………………73
圖40　原始浮水印影像與取出的浮水印影像。…………………………………73
圖41　藏匿過浮水印的二維條碼影像經各種影像處理過後的結果。…………74
圖42　經不同影像處理攻擊後所取出的浮水印影像。…………………………75

表目錄

表1　交易資料庫範例。…………………………………………………16
表2　Lena影像的檢測結果。……………………………………………33
表3　針對1000張檢測影像的檢測結果。………………………………34
表4　不同方法之間的比較結果。………………………………………56
表5　不同的實驗測試參數所取出的浮水印影像PSNR值。……………75
表6　二維條碼影像所能藏匿資訊容量的比較結果。…………………75
表7　檢測二維條碼是否遭受竄改的比較結果。………………………76

參考文獻

[1] L. H. Chen, J. J. Lin, “Mean quantization based image watermarking,” Image and Vision Computing, Vol. 21 (2003) 717-727.
[2] Y. W. Kim, Oh Il-Seok, “Watermarking text document images using edge direction histograms,” Pattern Recognition Letters, Vol. 25 (2004) 1243-1251.
[3] J. L. Liu, D. C. Lou, M. C. Chang, H. K. Tso, “A robust watermarking scheme using self-reference image,” Computer Standards & Interfaces, Vol. 28 (2006) 356-367.
[4] I. J. Cox, J. Kilian, F. T. Leighton, T. Shamoon, “Secure Spread Spectrum Watermarking for Multimedia,” IEEE Transactions on Image Processing, Vol. 6 (1997) 1673-1687.
[5] M. Barni, F. Bartolini, V. Cappellini, A. Piva, “A DCT-domain system for robust image watermarking,” Signal Processing, Vol. 66 (1998) 357-372.
[6] C. I. Podilchuk, “Image-Adaptive Watermarking Using Visual Models,” IEEE Journal on Selected Areas in Communications, Vol. 16 (1998) 525-539.
[7] W. Zeng, B. Liu, “A Statistical Watermark Detection Technique Without Using Original Images for Resolving Rightful Ownerships of Digital Images,” IEEE Transactions on Image Processing, Vol. 8 (1999) 1534-1548.
[8] M. Barni, F. Bartolini, A. Piva, “Improved Wavelet-Based Watermarking Through Pixel-Wise Masking,” IEEE Transactions on Image Processing, Vol. 10 (2001) 783-791.
[9] V. Fotopoulos, A.N. Skodras, “Improved watermark detection based on similarity diagrams,” Signal Processing: Image Communication, Vol. 17 (2002) 337-345.
[10] M. A. Suhail, M. S. Obaidat, “Digital Watermarking-Based DCT and JPEG Model,” IEEE Transactions on Instrumentation and Measurement, Vol. 52 (2003) 1640-1647.
[11] D. Zhao, G. Chen, W. Liu, “A chaos-based robust wavelet-domain watermarking algorithm,” Chaos Solitons and Fractals, Vol. 22 (2004) 47-54.
[12] X. M. Niu, Z. Ming, S. H. Siin, “DIGITAL WATERMARKING OF STILL IMAGES WITH,” IEEE Transactions on Cosumer Electronics, Vol. 46 (2000) 137-145.
[13] A. Noore, N. Tungala, M. M. Houck, “Embedding biometric identifiers in 2D barcodes for improved security,” Computers & Security, Vol. 23 (2004) 679-686.
[14] H. C. Wu, C. C. Chang, “A novel digital image watermarking scheme based on the vector quantization technique,” Computers & Security, Vol. 24 (2005) 460-471.
[15] R. Agrawal, T. Imielinski, A. Swami, “Mining Association Rules between Sets of Items in Large Databases,” Proc. Of ACM Special Interest Group on Management of Data, ACM SIGMOD’93, Vol. 22 (1993) 207-216.
[16] R. Srikant, R. Agrawal, “Mining generalized association rules,” Future Generation Computer Systems, Vol. 13 (1997) 161-180.
[17] A. Savasere, E. Omiecinski, S. Navathe, “An efficient algorithm for mining association rules in large databases,” In Proceedings of the VLDB, Zurich, Switzerland, (1995) 432-444.
[18] M. J. Zaki, “Scalable algorithms for association mining,” IEEE Transactions on Knowledge and Data Engineering, Vol. 12 (2000) 372-390.
[19] G. Chen, Q. Wei, D. Liu, G. Wets, “Simple association rules (SAR) and the SAR-based rule discovery,” Computer and Industrial Engineering, Vol. 43 (2002) 721-733.
[20] L. Feng, T. Dillon, J. Liu, “Inter-transactional association rules for multi-dimensional contexts for prediction and their application to studying meteorological data,” Data and Knowledge Engineering, Vol. 37 (2001) 85-115.
[21] R. Agrawal, R. Srikant, ”Fast Algorithms for Mining Association Rules,” Proc. Of the 20th International Conference on Very Large Data Bases, VLDB’94, (1994) 487-499.
[22] H. Kii, J. Onishi, S. Ozawa, “The digital watermarking method by using both patchwork and DCT,” IEEE Multimedia Computing and System, Vol. 1 (1999) 895-899.
[23] A. B. Watson, “DCT quantization matrices visually optimized for individual images,” Human Vision Visual Processing and Digital Display IV Proc. SPIE, Vol. 1913 (1993) 202-216.
[24] R. C. Gonzalez, R. E. Woods, “Digital Image Processing 2/e,” Pearson Education, (2002).
[25] N. Kanopoulos, N. Vasanthavada, R. L. Baker, “Design of and image edge detection filter using the Sobel operator,” IEEE Journal of solid-state circuits, Vol. 23 (1988) 358-367.
[26] T. Pavlidis, J. Swartz, Y. P. Wang, “Information encoding with two dimensional bar codes,” Computer, Vol. 25 (1992) 18-28.
[27] R. M. Gray, “Vector Quantization,” IEEE ASSP Magazine, Vol. 1 (1984) 4-29.
[28] Y. C. Hu, C. C. Chang, “A Progressive Subcodebook Search Algorithm for Vector Quantization,” Proceedings of the Fifth Asia-Pacific Conference on Communications and Fourth Optoelectronics and Communications Conference (APCC/OECC 99’), Beijing, China, Vol. 2 (1999) 936-939.
[29] 張真誠, 黃國峰, 陳同孝, “電子影像技術,” 松崗電腦圖書資料股份有限公司, (2000).
[30] T. Pavlidis, “A new paper/computer interface: two-dimensional symbologies,” IEEE international conference on pattern recognition, Vol. 2 (2000) 145-151.
[31] L. O’Gorman, I. Rabinovich, “Secure identification documents via pattern recognition and public-key cryptography,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 20 (1998) 1097-1102.
[32] L. O’Gorman, T. Pavlidis, “Auto ID technology: from barcodes to biometrics,” IEEE Robotics and Automation Magazine, Vol. 6 (1999) 4-16.
[33] S. Chow, N. Serinken, S. Shlien, “Forgery and tamper-proof identification document,” Proceedings of IEEE international carnahan conference on security technology, (1993) 11-14.
[34] D. Ross, “Back on the cards,” IEE Review, Vol. 49 (2003) 22-23.
[35] A. Vaidya, “Keeping card data secure at low cost,” European Convention on Security and Detection May, (1995) 212-215.