Finding of optimal morphological filter on binary images based on greedy and branch & bound searching

Chin Chuan Han, Kuo Chin Fan

研究成果: 書貢獻/報告類型會議論文篇章同行評審

摘要

The method by searching the error code graph (ECG) to find the optimal morphological filter on binary image is proposed in this paper. 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.

原文???core.languages.en_GB???
主出版物標題ISSIPNN 1994 - 1994 International Symposium on Speech, Image Processing and Neural Networks, Proceedings
發行者Institute of Electrical and Electronics Engineers Inc.
頁面5-8
頁數4
ISBN(電子)078031865X, 9780780318656
DOIs
出版狀態已出版 - 1994
事件1994 International Symposium on Speech, Image Processing and Neural Networks, ISSIPNN 1994 - Hong Kong, Hong Kong
持續時間: 13 4月 199416 4月 1994

出版系列

名字ISSIPNN 1994 - 1994 International Symposium on Speech, Image Processing and Neural Networks, Proceedings

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???1994 International Symposium on Speech, Image Processing and Neural Networks, ISSIPNN 1994
國家/地區Hong Kong
城市Hong Kong
期間13/04/9416/04/94

指紋

深入研究「Finding of optimal morphological filter on binary images based on greedy and branch & bound searching」主題。共同形成了獨特的指紋。

引用此