勤益科大機構典藏:Item 987654321/6694
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 2928/5721 (51%)
Visitors : 375793      Online Users : 507
RC Version 6.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.ncut.edu.tw/handle/987654321/6694


    Title: Objects Extraction Algorithm of Color Image Using Adaptive Forecasting Filters Created Automatically
    Authors: 劉正忠
    Contributors: 電子工程(學)系
    Date: 2011-10
    Issue Date: 2017-11-23 09:29:41 (UTC+8)
    Abstract: This article presents an interactive color object extraction scheme based on pixels extracting where users outline the desired objects on the input original RGB color image as the original seeds. The proposed algorithm analyzes the distribution of seeds in the neighboring region of a seed to automatically generate an adaptive forecasting filter and the corresponding threshold vector. The filter utilizes its corresponding threshold vector to identify the pixels which resemble the desired object. These identified pixels are added to seeds set and can then be used as seeds to extract other pixels. The extrac tion steps are repeated according to the modified significance linked connected component analysis (SLCCA) scheme until all the seeds in the set are used. Finally, the coordinates of seeds of the final seeds set are transformed to the original input RGB color image to extract the desired objects. In the experiment, several measures of errors, such as ME, RFAE, EMM, EER, MHD, are conducted to measure the performance of the proposed algorithm. The experimental results show that (a) the proposed algorithm can simultaneously and efficiently extract multiple desired objects from an RGB color image even though the background complexity and the number of seeds is small (one seed only); (b) the proposed algorithm is simpler and saves more time than the MSRM scheme [19] with the same precision; (c) the proposed algorithm is very accurate and efficient compared with the DTS scheme [18]. © ICIC International 2011. (23 refs)
    Relation: International Journal of Innovative Computing, Information and Control.
    Appears in Collections:[Department of Electronic Engineering] 【電子工程系所】期刊論文

    Files in This Item:

    There are no files associated with this item.



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


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback