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

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29215

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29215

题名:	Finding of optimal binary morphological erosion filter via greedy and branch & bound searching
作者:	Han,CC;Fan,KC
贡献者:	資訊工程研究所
日期:	1996
上传时间:	2010-06-29 20:16:35 (UTC+8)
出版者:	中央大學
摘要:	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.
關聯:	JOURNAL OF MATHEMATICAL IMAGING AND VISION
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	519	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing