ASIA unversity:Item 310904400/7390
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21675625      線上人數 : 512
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 >  Item 310904400/7390


    請使用永久網址來引用或連結此文件: 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.html0KbHTML307檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.


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