本篇論文乃將形態影像學和四分樹演算法做結合，並提出新的方法改良圖案對映法，和圖案對映法比較更能加快程式運算速度。
圖案對映法為將樹圖案以字串形式進行儲存動作，並且為非指標資料結構形式。而本篇論文所提出的方法乃將樹圖案以指標資料結構形式儲存，因此和圖案對映法相比，指標樹樹圖能立即被四分樹所使用而不需要非指標轉換成指標運算時間。
而本篇論文預先將非指標四分樹轉換成指標四分樹形式來降低運算時間，而本篇所提出的新方法能被運用在影像修復、影像分割和細胞計數…等應用上

Quadtree algorithm and morphological image processing are combined in the proposed method in this paper. A new method is proposed to improve the previous pattern mapping method for faster processing.

The previous pattern mapping method is a pattern mapping method by storing the tree pattern by string form, which is a pointless data structure. In the proposed method the tree pattern is saved in a point data structure. Therefore, the pointer tree can be applied to the quadtree immediately without the transforming time, which was required in the previous pattern mapping method.

In this paper, the pointless quad tree work is modified to pointer quad tree to reduce the processing time. The modified algorithm is applied to circuit detection, image restoration, image segmentation and cell counting.

第 一 章 引言 1
第 二 章 形態影像學 7
2.1 簡介 7
2.2 黑白影像的擴張運算 7
2.3 黑白影像的侵蝕運算及結果 8
2.4 開放和閉鎖運算 9
第 三 章 四分樹資料結構 12
3.1 簡介 12
3.2 影像二維座標與四分樹對應關係 13
3.3 四分樹資料結構表現方式 15
第 四 章 四分樹擴張運算處理 17
4.1 概念 17
4.2 製作資料庫樹圖案 19
4.3 懸掛樹圖案 26
4.4 程式記憶體配置問題 28
4.5 改良圖案對應演算法 30
第 五 章 實驗結果 34
5.1 鑰匙刮痕修補 34
5.2 電路圖修復 39
5.3 文件復原 43
5.4 細胞計數 45
第 六 章 結論 49
參考文獻 51

1. Samet H, “Applications of spatial data structures, computer graphics,image processing, and GIS.,” Reading, Addison Wesley, 1990.
2. E. Kawaguchi and T. Endo, “On a method of binary picture representation and its application to data compression,” IEEE Trans. on PAMI, Jan. 1980, pp.27-35.
3. Serra J., “Image analysis and mathematical morphology,” New York：Academic Press, 1983.
4. Matheron G., “Random sets and integral geometry,” New York：John Wiley and Sons, 1975.
5. Jain A. K., “Fundamentals of digital image processing,” Prentice-Hall, Englewood Cliffs, N.J. 1989.
6. M. F. Goodchild and A. W. Grandfield, “Optimizing raster storage：an examination of four alternatives,” Proceedings of Auto-Carto 6, vol. 1, Ottawa, Oct. 1983, pp.400-407.
7. G. M. Morton, “A computer oriented geodetic data base and a new technique in file sequencing,” IBM Ltd. Ottawa, Canada 1966.
8. E. Kawaguchi, T. Endo, and J. Matsunaga, “Depth-first expression viewed from digital picture processing,” IEEE Trans. on PAMI 5,4 Jul. 1983, pp.373-384.
9. Philippe Salembier, Patrick Brigger, Josep R. Casas, and Montse Pardas, “Morphological operators for image and video compression,” IEEE Trans. On Image Processing, vol. 5, no. 6, Jun. 1996.
10. C. K. Lee and S. P. Wong, “A methematical morphological approach for segmentation heavily noise-corrupted images,” Pattern Recognition, 1996, vol. 29, no. 8, pp.1347-1358.
11. En-Hui Liang and Edward K. Wong, “Hierarchical algorithms for morphological image processing,” Pattern Recognition, 1993, vol. 26, no. 4, pp.511-529.
12. N. Kharma, H. Moghnieh, J. Yao; Y.P. Guo, A. Abu-Baker, J. Laganiere, G. Rouleau and M. Cheriet, “Automatic segmentation of cells from microscopic imagery using ellipse detection,” IET image processing, 2007, pp.39-47.