淡江大學機構典藏:Item 987654321/45283
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62830/95882 (66%)
造访人次 : 4035296      在线人数 : 862
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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.html0KbHTML337检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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