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


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6457


    題名: Fast Planar-Oriented Ripple Search Algorithm for Hyperspace VQ Codebook
    作者: Chang, C. C.;Wu, W. C.
    關鍵詞: Planar Voronoi diagram;principal component analysis;vector quantization (VQ) codebook search
    日期: 2007-06
    上傳時間: 2009-12-17 06:58:04 (UTC+0)
    出版者: Asia University
    摘要: This paper presents a fast codebook search method
    for improving the quantization complexity of full-search vector
    quantization (VQ). The proposed method is built on the planar
    Voronoi diagram to label a ripple search domain. Then, the appropriate
    codeword can easily be found just by searching the local
    region instead of global exploration. In order to take a step further
    and obtain the close result full-search VQ would, we equip
    the proposed method with a duplication mechanism that helps to
    bring down the possible quantizing distortion to its lowest level. According
    to the experimental results, the proposed method is indeed
    capable of providing better outcome at a faster quantization speed
    than the existing partial-search methods. Moreover, the proposed
    method only requires a little extra storage for duplication.
    關聯: IEEE Transactions on Image Processing 16(6): 1538-1547
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0KbUnknown491檢視/開啟
    310904400-6457.doc32KbMicrosoft Word266檢視/開啟


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


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