English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90074/105197 (86%)
Visitors : 7155674      Online Users : 36
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/6476


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


    Title: Full-Searching-Equivalent Vector Quantization Method Using Two-Bounds Triangle Inequality
    Authors: Chang, C. C.;Chen, C. C.
    Keywords: Full-searching-equivalent;triangle inequality;vector quantization (VQ
    Date: 2007-01
    Issue Date: 2009-12-17 14:58:11 (UTC+8)
    Publisher: Asia University
    Abstract: The encoding process of vector quantization (VQ) is indeed computational complex and time consuming. Compared with actual Euclidean distance computation, some inequalities can generate estimations with less computation to filter out the impossible codevectors as well as to reduce the computation time. In this paper, we introduce a new estimation for the Euclidean distance using two-bounds triangle inequality. The experimental results show that our proposed scheme can reduce Euclidean distance computation by 71% to 94% for full search. Having been proved, our proposed scheme can reduce the computing time by 42% to 51%.
    Relation: Fundamenta Informaticae 76(1-2): 25-37
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0KbUnknown193View/Open
    310904400-6476.doc31KbMicrosoft Word206View/Open


    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