淡江大學機構典藏:Item 987654321/45283
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62861/95882 (66%)
造訪人次 : 4243078      線上人數 : 640
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45283


    題名: An Improved Shape Matching Technique
    作者: Kao, Yang-ta;林慧珍;Lin, Hwei-jen;Wu, Hung-husan
    貢獻者: 淡江大學資訊工程學系
    關鍵詞: Transformation-Invariance;Clustering;Mountain Climbing Sequence MCS;Longest Common Subsequence LCS;Selection Algorithm
    日期: 2007-09-01
    上傳時間: 2010-03-26 18:55:32 (UTC+8)
    出版者: 臺北縣：淡江大學
    摘要: Shape representation and matching is a not only important but also challenging part in image retrieval. In our previous work, a shape-based image retrieval system was proposed. The Mountain Climbing Sequence (MCS) is used to represent the shape feature of an object, which is invariant to some transformations such as translation, scaling, rotation, and even reversion, and also has a high tolerance for occlusion and noise. In this paper we improve this system, in terms of both retrieval precision and time efficiency, by adopting the Longest Common Subsequence (LCS) matching mechanism to match two MCSs more effectively and utilizing the Selection algorithm to speed up the retrieval process. Experimental results show that the improved system has far better performance. Especially it copes with the occlusion problem very well; that is, it has higher tolerance for occlusion.
    關聯: 淡江理工學刊 = Tamkang journal of science and engineering 10(3), pp.265-274
    DOI: 10.6180/jase.2007.10.3.09
    顯示於類別:[資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML338檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋