ASIA unversity:Item 310904400/7390
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94286/110023 (86%)
造访人次 : 21674573      在线人数 : 616
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 >  Item 310904400/7390


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/7390


    题名: Full-Searching-Equivalent Vector Quantization Method Using Orthogonal Projection
    作者: Chen, C. C.;Chang, C. C
    日期: 2008-12
    上传时间: 2010-01-29 06:39:10 (UTC+0)
    出版者: Asia University
    摘要: The encoding process of vector quantization (VQ) is computational complex and time consuming. Compared with traditional Euclidean distance computation, some geometric properties can generate approximations with simpler computation and filter out impossible codevectors to reduce computation time. In this paper, we introduce a new approximation adopting orthogonal projection on a hyperplane for speed-up VQ encoding. Experimental results show that our proposed scheme requires only 2.7~23.2% of actual Euclidean distance calculation in the full searching. Having been proved, our proposed scheme requires only 30.1~40.3% of computation time that other recently proposed schemes need.
    關聯: The 2008 IEEE International Symposium on Intelligent Information Technology Application (IITA 2008) , pp. 65-69 , 2008-12. Shanghai, China
    显示于类别:[資訊工程學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML303检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


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