架構於小波關聯隱藏馬可夫樹模式的 紋理影像分割 ;Texture Image Segmentation based on Wavelet Contextual Hidden Markov Tree Models

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > Electronic Thesis & Dissertation > Item 987654321/9364

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9364

Title:	架構於小波關聯隱藏馬可夫樹模式的紋理影像分割;Texture Image Segmentation based on Wavelet Contextual Hidden Markov Tree Models
Authors:	陳怡萍;Yi-Ping Chen
Contributors:	資訊工程研究所
Date:	2007-06-29
Issue Date:	2009-09-22 11:46:14 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	在本論文中，我們提出了關聯隱藏馬可夫樹模式 (contextual hidden Markov tree model, CHMT) 和邊界精細化 (boundary refinement) 方法來做紋理影像分割。關聯隱藏馬可夫樹模式是由建立在小波轉換架構下的隱藏馬可夫樹模式 (hidden Markov tree model, HMT) 改良而來的。隱藏馬可夫樹模式是用來捕捉小波係數之統計特性的一種樹狀結構機率模式；隱藏馬可夫樹可以完整的描述小波係數的繼承性 (persistence property)，但不太具有聚集性 (clustering property)。而關聯隱藏馬可夫樹模式則使用擴增點 (extended nodes) 的觀念，來加強隱藏馬可夫樹模式的聚集性。在影像分割的應用上，因為邊界精細化方法加入影像像素的位置資訊，區分為同質區域及邊界區域，因此，我們使用邊界精細化方法來加強粗分割的正確性。首先，對於每一種紋理影像，利用關聯隱藏馬可夫樹模式訓練一組代表此紋理影像的關係參數；接著利用這些參數算出不同解析度區塊的最大相似度函數值做第一次分割；但分割結果，解析度愈高的影像正確率愈低。接著依照影像的區域性融合不同解析度的分割結果以得到更精確的分割結果。 A multiscale texture image segmentation approach based on the contextual hidden Markov tree (CHMT) model and boundary refinement is proposed. The hidden Markov tree models (HMT) is a statistical model of tree structure for capturing properties of wavelet coefficients. The HMT model describes persistence property of wavelet coefficients, but loses clustering property. We have proposed the CHMT model which improved from the HMT model by enhancing the clustering property. The CHMT model reinforces clustering property by using extended coefficients without changing the wavelet tree structure; thus the HMT training scheme can be easily modified to estimate the parameters of the CHMT model. In this study, the CHMT model is applied for texture segmentation. For each texture, we use the CHMT model to train a set of parameters and then utilize these parameters compute likelihood functions for all mulitscale squares of a test image. At last, we segment the test image with the principle of maximum likelihood. Only based on the CHMT model, the segmentation results are not good enough when the size of dyadic square is small; thus the boundary refinement algorithm is adopted to fuse the multiscale square to get better-quality segmented results. The segmented results based on the HMT and CHMT models are compared to show the improvement of the CHMT model over the HMT model; moreover, the boundary refinement algorithm is also evaluated to show its ability.
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...