A Greedy and Branch and Bound Searching Algorithm for Finding the Optimal Morphological Erosion Filter on Binary Images

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

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

Title:	A Greedy and Branch and Bound Searching Algorithm for Finding the Optimal Morphological Erosion Filter on Binary Images
Authors:	Han,CC;Fan,KC
Contributors:	資訊工程研究所
Date:	1994
Issue Date:	2010-06-29 20:17:03 (UTC+8)
Publisher:	中央大學
Abstract:	The searching via error code graph (ECG) to find the optimal morphological erosion filter is proposed in this letter. The problem to find the optimal solution is reduced to the problem for searching a minimal path in ECG. Since this graph satisfies some greedy properties, only few nodes need to be traversed and examined in this graph.
Relation:	IEEE SIGNAL PROCESSING LETTERS
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	558	View/Open

社群 sharing