English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22999848      Online Users : 473
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/29215


    Title: Finding of optimal binary morphological erosion filter via greedy and branch & bound searching
    Authors: Han,CC;Fan,KC
    Contributors: 資訊工程研究所
    Date: 1996
    Issue Date: 2010-06-29 20:16:35 (UTC+8)
    Publisher: 中央大學
    Abstract: In this paper, an effective and efficient algorithm for finding the optimal morphological erosion filter on binary images is proposed. The design of morphological erosion filter is based on statistical method by minimizing mean square error. Traditionally, finding optimal morphological erosion filters requires searching through a large number of structuring-element combinations which is a long search and time consuming procedure. In the proposed method, the problem of finding the optimal solution is reduced to the problem of searching a minimal path on the error code graph (EGG). Since the graph satisfies some greedy criteria, only few nodes need to be traversed and examined. Experiments are conducted to illustrate the validity of our proposed method.
    Relation: JOURNAL OF MATHEMATICAL IMAGING AND VISION
    Appears in Collections:[資訊工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML352View/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  - 隱私權政策聲明