English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22932185      Online Users : 280
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    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:[資訊工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML385View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明