簡易檢索 / 詳目顯示

研究生: 石宜承
Shih, I-Cheng
論文名稱: 應用多重蛇輪廓競爭於紋理影像分割
Multi-Snake Competition for Textured Image Segmentation
指導教授: 謝璧妃
Hsieh, Pi-Fuei
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2007
畢業學年度: 95
語文別: 英文
論文頁數: 57
中文關鍵詞: 多重蛇輪廓競爭
外文關鍵詞: Multi-Snake
相關次數: 點閱:81下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  •   近年來紋理影像分割已越來越多採用多維分析法來進行。一張影像通常先經由一組紋理瀘波器處理,產生一張多維影像,其中每一個像素對應一組頻率特徵。常被採用之紋理瀘波器像是小波轉換(wavelet transform)或賈柏瀘波器(Gabor filters)。雖然這些特徵增加了紋理之間的類別分離度,但是瀘波過程中,由於尺度函數或瀘波視窗於紋理交接處跨越不同類別,也可能於相鄰紋理的邊界附近產生混合像素,反而造成分類錯誤,導致像是鋸齒狀和三明治夾層狀等不規則邊界。此外,在均值區域經常發生破碎形狀的分割,這通常由於離群像素(outlier)或是類別分離度低的緣故。此研究的目的即在改善紋理分割的這些缺陷。
      我們提出了一個適用於多類別紋理分割的多重蛇輪廓競爭模型。為了達成多類別多物體追縱的目的,我們設計了基於情境式機率(contextual probabilities)的蛇輪廓外力而非用於傳統蛇輪廓模型的梯度值。紋理分割的過程包含三步驟:首先,利用小波轉換或賈柏瀘波器在影像中來萃取出有用的紋理特徵;第二步,利用以馬可夫隨機場(Markov random field)為基礎的分類器在影像上來產生下一步驟將定義輪廓外力的情境式機率;第三步,多個蛇輪廓在設定初始位置之後開始成長,當蛇輪廓之間的競爭到達平衡時,決定了紋理之間邊界的位置。
      本篇論文琢磨了一些輪廓拓譜的問題。例如,當蛇輪廓成長遭遇離群像素或非均質區域可能造成蛇輪廓自我交錯(self-intersection)的問題,我們藉由偵測在蛇輪廓內較小的交錯迴路並決策基於規則:順時針則保留並持續和內部的類別競爭;反時針則移除並更正分類錯誤的區域,來解決問題。另一個輪廓拓譜問題是因為促使輪廓圓滑的內力造成收斂到角落(連接點)的困難,我們建立了一個拉鏈的技巧,讓蛇輪廓盡可能的接近角落。
      我們以合成的Brodatz紋理庫影像、自然影像和遙測影像來測試效能的好壞。實驗結果顯示,輪廓的內力與蛇輪廓自我交錯處理,可以消除均質區域的破碎分割,定義的類別內部正確率增加到幾乎100%。此外,蛇輪廓競爭達到平衡時,邊緣可以正確地界定,並且邊界附近的正確率增加了3~15%。由這量化分析我們證實了以上視覺效果上重大的改進。

      The multiband analysis has been increasingly adopted nowadays for textured image segmentation. An image is usually processed through a series of texture filters, such as wavelet transforms or Gabor filters, to yield a set of features for a pixel and thus form a multi-band image. Although adding these features increase class separability between textures, the filtering operations may as well generate mixed pixels near boundaries, where a scaling function or a filter window crosses different classes. Misclassification of the mixed pixels may lead to irregular boundaries, such as zigzag and sandwich boundaries. In addition, fragmented segmentation often occurs in a homogeneous region due to outliers or poor class separability. Our objective is to mitigate these defects in texture segmentation.
      We propose a multi-snake competition model for multiclass texture segmentation. In order to fulfill the purpose of multiclass multiobject tracking, we redesign the external forces of snakes based on contextual probabilities rather than the gradient magnitudes used in the classic snake model. The texture segmentation process consists of three stages. First, wavelet transforms (or Gabor filters) are applied to the image to extract effective texture features. In the second stage, an MRF-based classifier is applied to the image to produce contextual probabilities, which will be used in the next stage to define the external forces of snakes. In the third stage, a number of snakes are initiated and start growing. As the competition between snakes arrives at a balance, the locations of boundaries between textures are finalized.
      In this study, we also address several contour topology problems. As a snake grows, the self-intersection problem may arise when the snake encounters outliers or heterogeneous regions. We overcome the problem by detecting the smaller intersect loop in a snake and making a decision based on the rule: clockwise to remain and keep competing with the inner classes; anticlockwise to remove and correct the misclassified region. Another contour topology problem is the difficult convergence to corners (conjunction points) because of the internal force, which enforces the smoothness of the contour. We have developed a zipper technique for snakes to approach corners as closely as possible.
      Tests have been performed on synthesized Brodatz texture images, natural images and a remote sensing image. The experimental results show that the proposed self-intersection treatment and the internal forces of snakes can eliminate the fragmented segmentation in a homogeneous region, where the defined interior accuracy increased to almost 100%. Besides, reliable boundaries were obtained as snakes reached a competition balance and gave an increment of 3-15% near the boundary. This quantitative analysis confirms these significant improvements in visualization.

    1.   Introduction                 1  1.1  Motivation                  1  1.2  Objective                  5  1.3  Outline                   7 2.   Texture Segmentation             8  2.1  Wavelet Transform              8  2.2  Gabor Filters                11  2.3  Properties of Texture Features      13  2.4  Markov Random Field            15  2.5  Normalized Cuts              17 3.   Multi-Snake Competition           20  3.1  Parametric Snake Model           20  3.2  Concept of Region Growing          22  3.3  Proposed Snake Competition         23   3.3.1 Initialization of region growing     23   3.3.2 The statistical force           24   3.3.3 Contour topology             28   3.3.4 Overall algorithm              32 4.   Experimental Results             33  4.1  Brodatz Textured Images            33  4.2  Natural Images                40  4.3  Remote Sensing Image             45  4.4  The Comparison with Ncut          51 5.   Conclusions                   54 References                       55

    [1]R. C. Gonzalez and R. E. Woods, Digital Image Processing,   Second Edition. Prentic Hall, 2001.
    [2]A. Graps, “An introduction to wavelets,” IEEE Trans.    Computational Science and Engineering, vol. 2, no. 2, pp.   50–61, July 1995.
    [3]J. Yao, P. Krolak, and C. Steele, “The generalized Gabor   transform,” IEEE Trans. Image Processing, vol. 4, no. 7,   pp. 978–988, July 1995.
    [4]C. M. Pun and M. C. Lee, “Log-polar wavelet energy      signatures for rotation and scale invariant texture     classification,” IEEE Trans. Pattern Analysis and      Machine Intelligence, vol. 25, no. 5, pp, 590–603, May   2003.
    [5]C. M. Pun and M. C. Lee, “Extraction of shift invariant   wavelet features for classification of images with      different sizes,” IEEE Trans. Pattern Analysis and     Machine Intelligence, vol. 26, no. 9, pp, 1228–1232,    Sept. 2004.
    [6]M. Acharyya, R. K. De, and M. K. Kundu, “Extraction of    features using M-band wavelet packet frame and their     neuro-fuzzy evaluation for multitexture segmentation,”   IEEE Trans. Pattern Analysis and Machine Intelligence,    vol. 25, no. 12, pp. 1639–1644, Dec. 2003.
    [7]P. Kruizinga and N. Petkov, “Nonlinear operator for     oriented texture,” IEEE Trans. Image Processing, vol. 8,   no. 10, pp. 1395–1407, Oct. 1999.
    [8]S. E. Grigorescu, N. Petkov, and P. Kruizinga,       “Comparison of texture features based on Gabor filters,”   IEEE Trans. Image Processing, vol. 11, no. 10, pp.      1160–1167, Oct. 2002.
    [9]L. K. Soh, and C. Tsatsoulis, “Texture analysis of SAR    sea ice imagery using gray level co-occurrence        matrices,” IEEE Trans. Geoscience and Remote Sensing,    vol. 37, no.2, pp.780–795, Mar. 1999.
    [10]D. A. Clausi and Huang Deng, “Design-based texture     feature fusion using Gabor filters and co-occurrence     probabilities,” IEEE Trans. Image Processing, vol. 14,   no. 7, pp. 925–936, July 2006.
    [11]R. O. Duda, P. E. Hart, and D. G. Stork, Pattern       Classification, Second Edition, John Wiley, 2001.
    [12]A. W. Liew, H. Yen, and N. F. Law, “Image segmentation   based on adaptive prototype estimation,” IEEE Trans.    Fuzzy System, vol. 13, no. 4, pp. 444–453, Aug. 2005.
    [13]X. Liu and D. Wand, “Texture classification using      spectral histograms,” IEEE Trans. Image Processing, vol.   12, no. 6, pp. 661-670, June 2003.
    [14]X. Liu and D. Wang, “Image and texture segmentation     using local spectral histograms,” IEEE Trans. Image     Processing, vol. 15, no. 10, pp. 3066–3077, Oct. 2006.
    [15]T. Kasetkasem and P. K. Varshney, “An image change     detection algorithm based on Markov random field       models,” IEEE Trans. Geoscience and Remote Sensing, vol.   40, no. 8, pp. 1815–1823, Aug. 2002.
    [16]G. Rellier, X. Descombes, F. Falzon, and J. zerubia,    “Texture feature analysis using a Gauss-Markov model in    hyperspectral image classification,” IEEE Trans.      Geoscience and Remote Sensing, vol. 42, no. 7, pp.      1543–1551, July 2004.
    [17]J. Canny, “A computational approach to edge detection,”   IEEE Trans. Pattern Analysis and Machine Intelligence,    vol. 8, pp. 679–698, 1986.
    [18]P. Bao, L. Zhang, and X. Wu, “Canny edge detection     enhancement by scale multiplication,” IEEE Trans.      Pattern Analysis and Machine Intelligence, vol. 27, no.   9, pp. 1485–1490, Sept. 2005.
    [19]L. Ganesan and P. Bhattacharyya, “Edge detection in     untextured and textured images—a common computation     framework,” IEEE Trans. Systems, Man, and          Cybernetics—Part B: Cybernetics, vol. 27, no. 5, pp.    823–834, Oct. 1997.
    [20]C. Grigorescu, N. Petkov, and M. A. Westenberg, “Contour   detection based on nonclassical receptive field       inhibition,” IEEE Trans. Image Processing, vol. 12, no.   7, pp. 729–739, July 2003.
    [21]Q. Ye, W. Gao, and W. Wang, “A new texture-insensitive   edge detection method,” in ICICS-PCM2003, Singapore,    Dec.15–18, 2003.
    [22]M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active   contour models,” Int. J. Comput. Vis., vol. 1, pp.     321–331, 1987.
    [23]C. Xu and J. L. Prince, “Snakes, shapes, and gradient    vector flow,” IEEE Trans. Image Processing, vol. 7, no.   3, pp. 359–368, Mar. 1998.
    [24]R. Goldenberg, R. Kimmel, E. Rivlin, and M. Rudzsky,    “Fast geodesic active contours,” IEEE Trans. Image      Processing, vol. 10, no. 10, pp. 1467–1475, Oct. 2001.
    [25]C. Sagiv, N. A. Sochen, and Y. Y. Zeevi, “Integrated    active contours for texture segmentation,” IEEE Trans.   Image Processing, vol.15, no. 6, pp. 1633–1646, June    2006.
    [26]J. Ivins and J. Porrill, “Statistical snakes: Active    region models,” Image and Vision Computing, vol. 13, no.   5, pp. 431–438, 1995.
    [27]M. S. Horritt, “A statistical active contour model for   SAR image segmentation,” Image and Vision Computing, no.   17, pp. 213–224, 1999.
    [28]S. C. Zhu and A.Yuille, “Region competition: Unifying    snakes, region growing, and Bayes/MDL for multiband image   segmentation,” IEEE Trans. Pattern Analysis and Machine   Intelligence, vol. 18, no. 9, pp. 884–900, Sep. 1996.
    [29]Y. Matsuzawa and T. Abe, “Region extraction using      competition of multiple active contour models,” in Proc.   IEEE Conf. Image Processing, vol. 3, pp. 198–202, Oct.   1999.
    [30]C. S. Burrus, R. A. Gopinath, and H. Guo, Introduction to   Wavelets and Wavelet Transforms: A Primer, Upper Saddle   River, N.J. :Prentice Hall,c1998.
    [31]K. L. Lee and L. H. Chen, “Unsupervised texture       segmentation by determining the interior of texture     regions based on wavelet transform,” Inter. Journal of   Pattern Recognition and Artificial Intelligence, vol. 15,   no. 8, pp. 1231–1250, 2001.
    [32]W. Cai, J. Wu, and A. C. S. Chung, “Shape-based image    segmentation using normalized cuts,” in IEEE Int. Conf.   Image Processing, pp. 1101–1104, Oct. 2006.
    [33]J. Shi and J. Malik, “Normalized cuts and image       segmentation,” IEEE Trans. Pattern Analysis and Machine   Intelligence, vol. 22, no. 8, pp. 888–905, Aug. 2000.
    [34]Z. Wu and R. Leahy, “An optimal graph theoretic approach   to data clustering: theory and its application to image   segmentation,” IEEE Trans. Pattern Analysis and Machine   Intelligence, vol. 15, no. 11, pp. 1101–1113, Nov. 1993.
    [35]J. Hao and Y. Shen, “Region growing with level set     framework: 3-D image segmentation,” in Intelligent     Control and Automation, vol.2, pp. 21–23, June 2006.
    [36]R. Adams and L. Bischof, “Seeded region growing,” IEEE   Trans. Pattern Analysis and Machine Intelligence, vol.    16, no. 6, pp. 641–671, Sep. 1996.
    [37]P. Brodatz, Texture: A Photographic Album for Artists and   Designers. New York: Dover, 1966.

    下載圖示 校內:2010-08-27公開
    校外:2010-08-27公開
    QR CODE