2段階最近傍探索手法についての一検討 A Consideration On Two-step Nearest Neighbor Search Algorithm

Search this Article

Author(s)

Abstract

本稿では,2段階最近傍探索手法についての基本理論を述べている.本手法においては,前段の前置量子化器を用いて信号空間を予備的に分割することにより,候補となる符号語の範囲を限定する.この場合,後段の量子化器における最近傍探索の結果が,真の最近傍符号語となるためには,候補符号語集合を注意深く決定する必要がある.本稿では,このための定理を示し,その証明を与えている.

This paper presents the basic theory of the two-step nearest neighbor search algorithm. At the first stage of the proposed algorithm, the prequantizer is used for locating or spotlighting the range of possible codewords to be the nearest neighbor one. These spotlit codewords are referred to as the candidate codewords. Once the candidate codewords are located, the embeded nearest neighbor search quantizer examines all the candidates to find the nearest neighbor codeword at the second stage. The theorem given and proved in this paper guarantees that the nearest neighbor codeword is just within the candidate codewords.

Journal

  • IEICE technical report. Information theory

    IEICE technical report. Information theory 95(347), 13-18, 1995-11-06

    The Institute of Electronics, Information and Communication Engineers

References:  12

Codes

  • NII Article ID (NAID)
    110003197208
  • NII NACSIS-CAT ID (NCID)
    AN10013083
  • Text Lang
    ENG
  • Article Type
    ART
  • Data Source
    CJP  NII-ELS 
Page Top