Finding of optimal binary morphological erosion filter via greedy and branch & bound searching

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29215

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

Title:	Finding of optimal binary morphological erosion filter via greedy and branch & bound searching
Authors:	Han,CC;Fan,KC
Contributors:	資訊工程研究所
Date:	1996
Issue Date:	2010-06-29 20:16:35 (UTC+8)
Publisher:	中央大學
Abstract:	In this paper, an effective and efficient algorithm for finding the optimal morphological erosion filter on binary images is proposed. The design of morphological erosion filter is based on statistical method by minimizing mean square error. Traditionally, finding optimal morphological erosion filters requires searching through a large number of structuring-element combinations which is a long search and time consuming procedure. In the proposed method, the problem of finding the optimal solution is reduced to the problem of searching a minimal path on the error code graph (EGG). Since the graph satisfies some greedy criteria, only few nodes need to be traversed and examined. Experiments are conducted to illustrate the validity of our proposed method.
Relation:	JOURNAL OF MATHEMATICAL IMAGING AND VISION
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	522	View/Open

社群 sharing