• DocumentCode
    1288021
  • Title

    Fast nearest neighbour searching algorithm using L1 norm

  • Author

    Baek, Seongjoon ; Kang, SangKi ; Sung, Koeng-Mo

  • Author_Institution
    Dept. of Electr. Eng., Seoul Nat. Univ., South Korea
  • Volume
    35
  • Issue
    24
  • fYear
    1999
  • fDate
    11/25/1999 12:00:00 AM
  • Firstpage
    2104
  • Lastpage
    2105
  • Abstract
    Simple but effective fast codebook searching algorithms for vector quantisation are presented. The Euclidean distance (L2 norm) calculation requires a number of multiplications. The proposed algorithms use the L1 norm between the input vector and codeword to discard many unlikely codewords. Since the proposed algorithms significantly reduce the number of multiplications, a considerable reduction in encoding time is achieved. Simulation results confirm the effectiveness of the proposed algorithms
  • Keywords
    computational complexity; image coding; vector quantisation; Euclidean distance; L1 norm; codebook searching algorithms; encoding time; input vector; nearest neighbour searching algorithm; vector quantisation;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19991409
  • Filename
    815920
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1288021