• DocumentCode
    1129246
  • Title

    A greedy and branch and bound searching algorithm for finding the optimal morphological erosion filter on binary images

  • Author

    Han, Chin-Chum ; Fan, Kuo-Chin

  • Author_Institution
    Inst. of Comput. Sci. & Electron. Eng., Nat. Central Univ., Chung-Li, Taiwan
  • Volume
    1
  • Issue
    2
  • fYear
    1994
  • Firstpage
    41
  • Lastpage
    44
  • Abstract
    Searching via error code graph (ECG) to find the optimal morphological erosion filter is proposed. 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 a few nodes need to be traversed and examined in this graph.<>
  • Keywords
    digital filters; directed graphs; filtering and prediction theory; image coding; mathematical morphology; optimisation; search problems; ECG; binary images; branch and bound searching algorithm; error code graph; greedy properties; minimal path; optimal morphological erosion filter; Computer science; Councils; Digital images; Electrocardiography; Filters; Graphics; Mean square error methods; Process design; Random variables; Signal generators;
  • fLanguage
    English
  • Journal_Title
    Signal Processing Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1070-9908
  • Type

    jour

  • DOI
    10.1109/97.300314
  • Filename
    300314
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1129246