Paper Info
Title
Multiplication-free fast codeword search algorithm using Haar transform with squared-distance measure
Abstract
This letter presents novel multiplication-free fast codeword search algorithms for encoding of vector quantizers (VQs) based on squared-distance measure. The algorithms accomplish fast codeword search by performing the partial distance search (PDS) in the wavelet domain. To eliminate the requirement for multiplication, simple Haar wavelet is used so that the wavelet coefficients of codewords are finite precision numbers. The computation of squared distance for PDS can therefore be effectively realized using additions. To further enhance the computational efficiency of the algorithms, the addition-based squared-distance computation is decomposed into a number of stages. The PDS process is then extended to these stages to reduce the addition complexity of the algorithm. In addition, by performing PDS over smaller number of stages, lower computational complexity can be obtained at the expense of slightly higher average distortion for encoding. Simulation results show that our algorithms are very effective for the encoding of VQs, where both low computational complexity and average distortion are desired.
Year
DOI
Venue
2000
10.1016/S0167-8655(00)00007-6
Pattern Recognition Letters
Keywords
Field
DocType
codeword search algorithm,squared-distance measure,vector quantization,image compression,fast codeword search,search algorithm,computational complexity
Search algorithm,Pattern recognition,Vector quantization,Multiplication,Code word,Artificial intelligence,Haar wavelet,Mathematics,Encoding (memory),Wavelet,Computational complexity theory
Journal
Volume
Issue
ISSN
21
5
Pattern Recognition Letters
Citations 
PageRank 
References 
0
0.34
2
Authors
4
Name
Order
Citations
PageRank
Wen-Jyi Hwang120336.34
Ray-Shine Lin200.34
Wen-Liang Hwang3326.93
Chung-Kun Wu410.70