跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.134) 您好!臺灣時間:2025/12/21 01:22
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:吳文鳳
研究生(外文):Wen-Feng,Wu
論文名稱:研究利用K-means之粒子群優化分群演算法的彩色影像資訊隱藏
論文名稱(外文):A Study of Data Hiding Method in Color Image using Grouping Palette Index by Particle Swarm Optimization with K-means Clustering
指導教授:楊權輝楊權輝引用關係
指導教授(外文):Chyuan-Huei Thomas Yang
學位類別:碩士
校院名稱:玄奘大學
系所名稱:資訊管理學系碩士班
學門:電算機學門
學類:電算機一般學類
論文種類:學術論文
論文出版年:2011
畢業學年度:99
語文別:中文
論文頁數:81
中文關鍵詞:影像調色盤資訊隱藏粒子族群最佳化演算法
外文關鍵詞:image palettedata hidingparticle swarm optimizationK-means
相關次數:
  • 被引用被引用:0
  • 點閱點閱:500
  • 評分評分:
  • 下載下載:72
  • 收藏至我的研究室書目清單書目收藏:0
本文提出一個使用彩色影像本身的調色盤指標分群之資訊隱藏法;許多學者提出的方法通常將資訊藏匿在調色盤或是調色盤的分群指標上;這些資訊隱藏的方法是將資訊藏匿在調色盤本身上,以至於調色盤會有所改變,這將使得秘密訊息的取出更加困難。而本文結合K-means叢集之粒子族群最佳化演算法應用於資訊隱藏中,將調色盤分割成數個二的冪次方群集;調色盤分群群體越大者,可藏匿的秘密訊息越多。而在選擇秘密訊息要嵌入的像素時,首先檢查它是屬於哪一個調色盤分群群組,依據分出來的群組得知此像素可嵌入多少位元的秘密訊息,在此每個群組的群數皆為二的冪次方;此時像素值將依照秘密訊息的順序依序替換為同一群組的像素值。取出時,首先先將偽裝影像做分群,檢查該像素值隸屬於哪一個分群的群組,而後找尋像素值在該群組的哪一個順序位置上,順序位置的值即為秘密訊息的值;秘密訊息可從分群的群組中被取出,直到整個秘密訊息完整取出為止。最後經由實驗結果顯示,本文提出的方法具有較好的嵌入量和影像品質,此外,由於本文並未使用頻率域來做為調色盤指標分群的依據,所以在秘密訊息嵌入之後並不會更改像素值在調色盤指標分群的順序位置。
We propose a data hiding method in color image with its image palette. Many authors usually embed data into the palette or into the index table of the palette directly. Those data hiding methods embedded the secret data into palette itself, the palette will be changed to a different one. It becomes more difficultly to reveal the embedded information. We apply the particle swarm optimization method with K-means clustering to divide the color image palette into several groups. The largest numbers of pixels of a palette group has, the more data may be embedded in the pixel that falls in this group. In each candidate embedding pixel we check it belongs which group, then we know how many bits can be embedded, due to the number of group members we are going to use is power of two. The current embedding pixel will be replaced by the same group of pixel in the order of embedding data value. The extraction method firstly groups of the pixels of stego-image, and check the pixels to find which group has. Then, find what order in its group. That order is the embedded value. The information can be extracted from each group till all the pixels are extracted. From the experimental results, the method has the good embedding capacity and the image quality. Additionally, the proposed method will not be affected by the change of the order of the color palette after embedded since we keep the highest frequency for each cluster.
中文摘要 I
英文摘要 III
致謝 IV
目錄 VI
表目錄 VIII
圖目錄 IX
第壹章 緒論 1
1.1 研究動機 1
1.2 研究目的 3
1.3 論文架構 4
第貳章 文獻探討 5
2.1 資訊安全 5
2.1.1資訊隱藏 6
2.2 彩色影像於資訊隱藏之應用 10
2.2.1 YCbCr色彩空間 12
2.2.2 YUV色彩空間 12
2.2.3 HSV色彩空間 13
2.2.4 調色盤 14
2.3 分群方法 15
2.3.1 階層式分群法 15
2.3.2 分割式分群法 16
2.3.3 K-means分群法概念 16
2.3.4 PSO分群法概念 19
第?章 本文提出的方法 22
3.1 調色盤建置 23
3.2 本文的分群方法 26
3.2.1 K-means+PSO混合型分群演算法 27
3.3 嵌入方法 30
3.4 萃取方法 41
3.5 溢位問題 47
第肆章 實驗結果與分析 48
4.1 實驗結果 50
4.1.1嵌入玄奘大學Logo之實驗 51
4.1.2本實驗方法之Lena實驗圖示驗 52
4.1.3本實驗方法之Lena實驗圖示 55
4.2 實驗結果總結與分析 63
第伍章 結論與未來展望 64
參考文獻 65
[1]A. Ahmadyfard, and H. Modares, “Combining PSO and k-means to enhance data clustering” International Symposium on Telecommunications, pp.688-691, Aug. 2008.
[2]A. Al-Gindy, H. Al-Ahmad, R. Qahwaji, and A. Tawfik, “Watermarking of colour images in the DCT domain using Y channel,” IEEE/ACS International Conference on Computer Systems and Applications, pp. 1025-1028, May 2009.
[3]M. E. Celebi, “Effective initialization of k-means for color quantization,” IEEE International Conference on Image Processing, pp. 1649-1652, Nov. 2009.
[4]D. Charalampidis, “A modified k-means algorithm for circular invariant clustering,” IEEE Transactions on Pattern Analysis and Machine Intelligence,Vol.27,No.12, pp. 1856-1865, Dec. 2005.
[5]Qian-lan Deng, “The blind detection of information hiding in color image,” International Conference on Computer Engineering and Technology(ICCET), Vol.7,pp. 346-348, April 2010.
[6]Jinxin, Dong. and Minyong, Qi, “A New Algorithm for Clustering Based on Particle Swarm Optimization and K-means,” International Conference on Artificial Intelligence and Computational Intelligence (AICI), Vol.4, pp. 264-268, Nov. 2009.
[7]R. Goyal, S. Vijay, S. Agarwal, V. Laxmi, and M.S. Gaur, “Difference steg-analysis for LSB embedding in images,” International Conference on Computer Design and Applications (ICCDA), Vol.1,pp. 407-210, June 2010.
[8]Chengqing, Guo. Guoai, Xu. Xinxin, Niu. Yixian, Yang. and Yang, Li, “A color image watermarking algorithm resistant to print-scan,” IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS), pp.518-521, June 2010.
[9]Chih-Cheng Hung and Li Wan, “Hybridization of particle swarm optimization with the K-Means algorithm for image classification,” IEEE Symposium on Computational Intelligence for Image Processing, pp.60-64, 2009 April.
[10]H.G. Kaganami, Zou Beiji and M.S. Soliman, “Advanced Color Images Enhancement Using Wavelet and K-means Clustering,” International Conference on Intelligent Information Hiding and Multimedia Signal Processing, pp. 648-652, Sept 2009.
[11]Jia-Hong Lee and Mei-Yi Wu, “Reversible Data Hiding Scheme for Color Image Protection Based on Palette Color Replacement,” International Conference on Innovative Computing Information and Control(ICICIC),pp.24-27, June 2008.
[12]Xinwu Li, “Research on Text Clustering Algorithm Based on Improved K_means,” International Conference on Future Computer and Communication, pp.19-22, June 2009.
[13]Yu-Chiang Li, Piyu Tsai, Chih-Hung Lin, Hsiu-Lien Yeh and Chien-Ting Huang, “Palette Partition Based Data Hiding for Color Images,” International Conference on Intelligent Information Hiding and Multimedia Signal Processing, pp.620-623, Sept 2009.
[14]Mahamed G. Omran and Andries P. Engelbrecht, “A Color Image Quantization Algorithm Based on Particle Swarm Optimization,” Informatica, pp. 261–269, February 2005.
[15]F.A.P. Petitcolas, R.J. Anderson, and M.G. Kuhn, “Information Hiding-A Survey,”Proceeding of the IEEE,Vol.87,No.7,July 1999.,pp.1062-1078.
[16]B. Pfitzmann, “Information Hiding Terminology, ”Proceeding of the first workshop on Information Hiding,Lecture Notes in Computer Science,Springer-Verlag,Berlin,Cambridge,UK,pp.347-350.
[17]Yuhua Qin, “The Realization of Information Hiding in BMP Images,” Second International Workshop on Computer Science and Engineering,Vol.2, pp.49-53, Oct 2009.
[18]Xiaoping Qin and Shijue Zheng, “A New Method for Initialising the K-Means Clustering Algorithm,” Second International Symposium on Knowledge Acquisition and Modeling,Vol.2, pp.41-44. Dec 2009.
[19]M.S. Al Rababaa, “Colored image-in-image hiding,” International Conference - The Experience of Designing and Application of CAD Systems in Microelectronics, pp.445-450, Feb 2009.
[20]K.B. Raja, S. Siddaraju, K.R. Venugopal, and L.M. Patnaik, “Secure Steganography using Colour Palette Decomposition,” International Conference on Signal Processing, Communications and Networking, pp.74-81, Feb 2007.
[21]A. Rekik, M. Zribi, M. Benjelloun, and A. Ben Hamida, “A k-Means Clustering Algorithm Initialization for Unsupervised Statistical Satellite Image Segmentation,” IEEE International Conference on E-Learning in Industrial Electronics, pp.11-16, Dec 2006.
[22]R. Ridzon, and D. Levicky, “Usage of different color models in robust digital watermarking,” International Conference on Radioelektronika, pp.127-130, April 2009.
[23]N.A. Saleh, H.N. Boghdady, S.I. Shaheen, and A.M. Darwish, “An Efficient Lossless Data Hiding Technique for Palette-Based Images with Capacity Optimization,” International Workshop on Systems, Signals and Image Processing, pp.241-244, June 2007.
[24]S.G.K. Samaratunge, “New steganography technique for palette based images,” International Conference on Industrial and Information Systems, pp.335-340, Aug 2007.
[25]Tsu-Wang Shen Xavier Kuo and Yue-Loong Hsin, “Ant K-Means Clustering Method on Epileptic Spike Detection,” International Conference on Natural Computation(ICNC), pp.334-338, Aug 2009.
[26]T.C. Thanuja, and U. Kumari, “Invertible Data Hiding in Color Images Using Multiple Peaks Histogram,” International Conference on Signal Processing Systems, pp.52-55, May 2009.
[27]Ching-Te Wang Chiu-Hsiung Liao and Ruey-Maw Chen,“High Capacity Image Data Hiding Scheme for Grouping Palette Index,” International Conference on Multimedia and Ubiquitous Engineering, pp.197-204, June 2009.
[28]Hui-qin Wang Ji-chao Hao and Fu-ming Cui,“Colour Image Watermarking Algorithm Based on the Arnold Transform,” International Conference on Communications and Mobile Computing (CMC), Vol.1, pp.66-69, April 2010.
[29]G.A. Wilkin, and Xiuzhen Huang,“K-Means Clustering Algorithms: Implementation and Comparison,” International Multi-Symposiums on Computer and Computational Sciences, pp.133-136, Aug 2007.
[30]Qing Xie Jianquan Xie and Yunhua Xiao,“A High Capacity Information Hiding Algorithm in Color Image,” International Conference on e-Business and Information System Security (EBISS), pp.1-4, May 2010.
[31]Wei Yan Yihong Hu Guochu Shou and Zongjue Qian,“The Algorithm of Color Image Watermarking Based on SIFT,” International Conference on e-Business and Information System Security (EBISS), pp.1-4, May 2010.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top