DocumentCode :
2289836
Title :
Finding of optimal morphological filter on binary images based on greedy and branch & bound searching
Author :
Han, Chin-Chuan ; Fan, Kuo-Chin
Author_Institution :
Inst. of Comput. Sci. & Electron. Eng., Nat. Central Univ., Chung-Li, Taiwan
fYear :
1994
fDate :
13-16 Apr 1994
Firstpage :
5
Abstract :
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
Keywords :
filtering and prediction theory; image processing; mathematical morphology; optimisation; search problems; trees (mathematics); binary images; branch & bound searching; error code graph; greedy properties; greedy searching; minimal path; nodes; optimal morphological filter; optimal solution; Computer errors; Computer graphics; Computer science; Digital images; Electrocardiography; Filters; Random variables;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Speech, Image Processing and Neural Networks, 1994. Proceedings, ISSIPNN '94., 1994 International Symposium on
Print_ISBN :
0-7803-1865-X
Type :
conf
DOI :
10.1109/SIPNN.1994.344979
Filename :
344979
Link To Document :
بازگشت