- 作者: 韓欽銓; 范國清
- 作者服務機構: 中央研究院資訊科學研究所; 中央大學資訊工程研究所
- 中文摘要: 在本篇文章中,我們提出一種圖形搜尋演算法,找尋最佳二位元形態濾波器。傳統上,我們需要大量的時間來搜尋最佳解,在本文中,搜尋最佳解的問題被轉換成:在錯誤碼圖形中找尋一條具有最短路徑的途徑。並利用兩種圖形搜尋方法:貪婪及條件滿足搜尋演算法,避免在大量的搜尋空間中,搜尋最佳解,實驗結果證實了我們的方法是非常不錯的。
- 英文摘要: A graphic-theoretic search-based algorithm is proposed to find the optimal binary morphologicalerosion filter. According to the Matheron representation, the binary morphological erosion filter is definedas the union of multiple erosions. Traditionally, finding the optimal solution involves a long search andis a time consuming procedure because we have to compute the MSE values over all possible structuringelement combinations and make comparisons among them. The search for the optimal solution is reducedto the problem of obtaining a path with the minimal cost from the root node to the optimal node on anerror code graph (ECG). In this paper, two graphical searching techniques, the greedy and constraintsatisfaction algorithms, are applied to avoid searching an extremely large search space. Experimentalresults are illustrated to show the feasibility and efficiency of our proposed method.
- 中文關鍵字: morphological erosion filter; error code graph; mean-square error; greedy searching; constraint satisfaction searching
- 英文關鍵字: --