English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23068199      Online Users : 10
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/44508


    Title: 適用於唇形辨識之改良式主動形狀模型匹配演算法;Improved Active Shape Models Fitting Algorithm for Lip Contour Recognition
    Authors: 余幸娟;Hsing-Chuan Yu
    Contributors: 通訊工程研究所
    Keywords: 唇形辨識;主動形狀模型;匹配演算法;active shape model;lip recognition;fitting algorithm
    Date: 2010-07-26
    Issue Date: 2010-12-09 13:46:40 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 主動形狀模型(Active Shape Models,簡稱ASMs)是一種描繪物件形狀的統計模型。ASMs中包含了一個平均形狀及一組形狀變異模式(shape variation modes),且利用平均形狀與形狀變異模式之線性組合,在疊代過程中逐次變化模型,使其能與目標影像相符。由於最佳模型參數可精確地合成出目標物件之外形,因此如何搜尋並找出測試影像之最佳模型參數,為辨識相關應用之前的重要步驟。 在本論文中,我們提出一個新的主動形狀模型匹配演算法(ASMs fitting algorithm),此演算法包含了三部分。第一部分提供初始模板的選擇,且此部分可使ASMs由較佳的初始形狀開始搜尋。第二部分則以計算相關度的方式,提出新的目標函數(objective function),以判斷系統是否收斂。在第三部分,我們在搜尋之前先訓練一參照表(reference table),並且使用此參照表於搜尋階段更新模型參數。相較於原始ASMs,我們的演算法降低了23.60%的形狀誤差,增加41.38%(約1.1秒)的搜尋時間。與原始AAMs相比,我們的演算法降低了18.76% 的形狀誤差,並且也減少了59.58% (約5.4秒)的搜尋時間。而與robust AAMs相比,我們的演算法降低了16.98% of形狀誤差,且減少90.98% (約37.3秒)的搜尋時間。Active shape models (ASMs) are the statistical models for representing the shapes of objects. ASMs include a mean shape and a set of shape variation modes, and iteratively deform to fit the target image with linear combination of the mean shape and the variation modes. Because the optimal model parameters can exactly synthesize the shapes of target objects, how to search and find out the optimal model parameters of test images is an important step before recognition. In this paper, we propose a novel ASMs fitting algorithm which includes three parts. In the first part, it provides initial modes selection, and it could make the ASMs search from better initial shapes. The second part proposes a novel objective function where the convergence of the system is determined based on the correlation coefficient. The last part, we train a reference table before search, and update the model parameters with the reference table during the search process. Compare with the original ASMs, our algorithm reduces 23.60% of the shape error, and increases 41.38% (about 1.1s) of search time. Compare with the original AAMs, our algorithm reduces18.76% of the shape error, and reduces 59.58% (about 5.4s) of search time. Compare with the robust AAMs, our algorithm reduces 16.98% of the shape error, and reduces 90.98% (about 37.3s) of search time.
    Appears in Collections:[通訊工程研究所] 博碩士論文

    Files in This Item:

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