博碩士論文 985303002 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:27 、訪客IP:35.173.234.237
姓名 張瑞芳(Juei-Feng Chang)  查詢紙本館藏   畢業系所 通訊工程學系在職專班
論文名稱 粒子群優化與二維Otsu演算法於影像二元化閥值選取研究
(Image Threshold selection based on PSO and 2D-Otsu Algorithm)
相關論文
★ Branch and Bound 演算法在全光網路包含串音局限的限制條件之最佳化規劃效能分析★ 平行式最佳區塊碼解碼演算法
★ 數位廣播之視訊系統架構與信號估測★ 粒子群優化演算法應用於電信業解決方案選商及專案排程之優化
★ 結合PSO及K-Means聚類分析演算法的圖像分割★ 利用粒子群優化演算法改善分群演算法在訊號分群上之應用
★ 應用模糊聚類與粒子演算法之色彩分群研究★ 粒子群優化演算法應用於企業更新數據網路採購之優化
★ 粒子群演算法應用於無線區域網路產品硬體開發成本優化★ 粒子群演算法應用企業伺服器負載平衡之省電優化
★ 粒子群優化演算法應用於瓦斯業微電腦瓦斯表自動讀表之優化★ 近場通訊之智慧倉儲管理
★ 在Android 平台上實現NFC 室內定位★ 適用於訊號傳輸暨無線電力傳輸之設計
★ 結合PSO及圖像品質評估演算法識別頻譜訊號★ 利用A*解碼法應用到線性區塊碼的最大可能性解碼之研究
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   至系統瀏覽論文 ( 永不開放)
摘要(中) 圖像分割中的閥值選取是一個相當重要的技術,也延伸到許多領域當中,如特徵辨識、生物醫學影像等等,而選取的方法包含許多,P參數法、最大熵閥值法、Otsu法等都是可以作為選取閥值的方法。閥值選取基本上是一個像素分佈的問題,基於可以依像素特性將圖像分為兩類:一個是屬於目標部份,另一個則是背景部分,判斷的依據則為像素的灰階數值小於或等於閥值分為一類,像素的灰階數值大於閥值分為一類,此一技術已被提出且廣泛使用。針對Otsu法的延伸-二維的Otsu法(2D-Otsu)可以在當灰階直方圖並未具有雙峰值的特性存在條件下,得到一個較好的分割閥值,將目標及背景區隔開來,但須經過較複雜的計算過程。而PSO演算法是一個人工智慧演算法,具有參數少,收斂速度快等特性,可以成功地結合二維的Otsu法加速搜尋圖像分割閥值。
摘要(英) Threshold selecting is a significant technique for image segmentation, which is applied broadly in many fields such as character recognition, analysis of biologic images etc. The method mainly includes P-tile method , the maximum entropy method , Otsu and so on. It is essentially a pixels classification problem. Its basic objective is to classify the pixels of a given image into two classes: one is those pertaining to an object and another is those pertaining to the background. While one includes pixels with gray values that are below or equal to a certain threshold, the other includes those with gray values above the threshold. As an extension of Otsu algorithm, two-dimensional Otsu algorithm (2D-Otsu) can give good result for those objects whose histogram does not have two peaks which represent objects and background, however, it costs complex computation. Particle swarm optimization (PSO) is a swarm intelligence optimization algorithm as a set few parameters, better global search capability, search results more stable and widely used. So we combined successfully these two algorithms to get ideal segmentation result with less
computation cost.
關鍵字(中) ★ 圖像分割
★ Otsu法
關鍵字(英)
論文目次 目錄
摘 要 i
Abstract ii
誌謝 iii
目錄 iv
圖目錄 v
表目錄 vi
第一章 緒論 1
1-1 研究動機 1
1-2 研究架構與流程 2
第二章 演算法介紹 4
2-1 PSO 4
2-1-1 PSO演算法概述 4
2-1-2 PSO基本原理 5
2-1-3 PSO演算法方程式 6
2-2 圖像分割技術 12
2-2-1圖像分割定義 12
2-2-2圖像分割法 13
2-3 Otsu演算法 17
2-3-1 Otsu演算法概述 17
2-3-2 一維Otsu演算法方程式 19
2-3-3 二維Otsu演算法方程式 22
第三章 PSO結合二維Otsu之研究 29
3-1 PSO結合二維Otsu之構想 29
3-2 PSO結合二維Otsu之流程 31
第四章 PSO結合二維Otsu演算法應用於圖像分割 34
4-1 二維Otsu演算法應用於圖像閥值分割選取 34
4-2 PSO結合二維Otsu演算法應用於圖像閥值分割選取 36
4-2-1 實驗測試 37
4-2-2 結果分析 51
第五章 結論 54
參考文獻 55
參考文獻 [1] Kennedy, J., and Eberhart R. C.,“Particle swarm optimization,” Proc. IEEE International Conference on Neural Networks (Perth, Australia), IEEE Service Center, Piscataway, NJ, 1995, pp. IV:1942-1948.
[2] Kennedy J., Eberhart R. C. and Shi Y.,“Swarm Intelligence,” Morgan Kaufmann, New York., 2001.
[3] Eberhart, R. C., and Kennedy, J., “A new optimizer using particle swarm theory,” In Proc. of Int. Sym. Micro Mach. Hum. Sci., Nagoya, Japan (1995)39-43.
[4] I. C. Trelea,“ The particle swarm optimization algorithm: convergence analysis and parameter selection,” Information Processing Letters, vol. 85, no. 6, pp. 317-325, 2003.
[5] C. Wei, Z. He, Y. Zheng and W. Pi, “Swarm directions embedded in fast evolutionary programming,” in Proceedings of the IEEE Congress on Evolutionary Computation, pp.1278-1283, 2002.
[6] Shi, Y. H., Eberhart, R. C., “Parameter Selection in Particle Swarm Optimization,” The 7th Annual Conference on Evolutionary programming, San Diego, CA., 1998.
[7] Nobuyuki Otsu. “A Threshold Selection Method from Gray-Level Histograms,” IEEE Transactions on System, Mam, and Cybernetics, Vol. SMC-9, No. 1, 1979, pp. 62-66.
[8] Juyong Zhang, Jianmin Zheng, and Jianfei Cai, “A diffusion approach to seeded image segmentation,” in 2010 IEEE Conference on ComputerVision and Pattern Recognition (CVPR)., San Francisco, CA, 2010, pp.2125-2132.
[9] Hui-Lan Luo, Wei-Wang, and Jing-LI, “A new method for image segmentation based on integration technique,” in 2010 International Conference on Machine Vision and Human-machine Interface, Kaifeng, China, 2010, pp. 342–345.
[10] Kapur, J. N., Sahoo, P.K., and Wong, A.K.C., “A New Method for Gray-level Picture Thresholding Using the Entropy of the Histogram,”Computer Vision Graphics Image Processing, vol. 29, 1985, pp. 73-285.
[11] Zheng Chen, Shupeng Ji., “Enhancement algorithm of infrared images based on Otsu and plateau histogram equalization,” Laser&Infrared, 2010, 40-4, pp.438-441.
[12] J. Liu, W. Li, and Y. Tian, “Automatic thresholding of gray-level pictures using two-dimension Otsu method,” in Circuits and Systems, 1991. Conference Proceedings, China., 1991 International Conference on, 1991, pp. 325-327 vol.1.
[13] Kaiping Wei, Tao Zhang, Xianjun Shen, Jingnan Liu, “An Improved Threshold Selection Algorithm Based on Particle Swarm Optimization for Image Segmentation,” Third International Conference on Natural Computation (ICNC 2007).
[14] Zhiwei Ye, Hongwei Chen, Wei Liu, Jinping Zhang, “Automatic threshold selection based on Particle Swarm Optimization algorithm,” 2008 International Conference on Intelligent Computation Technology and Automation, 20-22 Oct. 2008.
[15] CHEN He-Nian , Bin He, Lili Yan, Junqing Li, Wentian Ji, “A Text Clustering Method Based on Two dimensional Otsu and PSO Algorithm,” CNMT 2009, International Symposium on, 18-20 Jan. 2009.
[16] Y. Zhao, Z. L. Zhenkui Pei, “Image segmentation based on Differential Evolution algorithm,” in International Conference on Image Analysis and Signal Processing (IASP 2009), pp. 48-51, 11-12 April 2009.
[17] 孫傳峰, 周劉喜, 粒子群優化中最大速度選擇,南京工業大學自動化學院, 2007.
[18] 陳廷標, 夏良正, 數位影像處理,儒林圖書公司, 1993.
[19] 曾建潮、介婧、崔志華, 微粒群算法, 北京, 科學出版社, 2004.
[20] Alasdair McAndrew原著, 徐曉珮譯, 數位影像處理, 高立出版社, 2009.
指導教授 賀嘉律 審核日期 2013-3-5
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明