English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90068/105181 (86%)
Visitors : 7143087      Online Users : 328
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
    ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 >  Item 310904400/7390

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/7390

    Title: Full-Searching-Equivalent Vector Quantization Method Using Orthogonal Projection
    Authors: Chen, C. C.;Chang, C. C
    Date: 2008-12
    Issue Date: 2010-01-29 14:39:10 (UTC+8)
    Publisher: Asia University
    Abstract: 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.
    Relation: The 2008 IEEE International Symposium on Intelligent Information Technology Application (IITA 2008) , pp. 65-69 , 2008-12. Shanghai, China
    Appears in Collections:[資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat

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

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