TY - GEN

T1 - Fast encoding method for image vector quantization by using partial sum concept in Walsh domain

AU - Pan, Zhibin

AU - Kotani, Koji

AU - Ohmi, Tadahiro

PY - 2005/12/1

Y1 - 2005/12/1

N2 - In a framework of image vector quantization (VQ), the encoding speed is a key issue for its practical applications. To speed up the VQ encoding process, it is benificial to use lower dimensional features of k-dimensional vectors (k-D) first to check the difference between the input vector and a candidate codeword so as to reject a lot of unlikely codewords. As the features of a k-D vector in spatial domain, sum (1-D) and partial sums (2-D) are already proved to be very effective for codeword rejections in the previous works. However, because the energy of image vectors or codewords distributes almost equivalently at each dimension in spatial domain, the search efficiency through using sum and patial sums in spatial domain is still not very high. By exploiting the energy compaction property of Walsh transform, this paper proposes to use partial sum concept in Walsh domain instead of spatial domain to improve search efficiency further. Unlike to compute two partial sums over the first half of [1, k/2] dimensions of a vector and the second half of [k/2+1, k] dimensions in spatial domain, partial sums are computed over [1, K Wal/2] and [K Wal/2+1, K Wal] dimensions (K Wal<

AB - In a framework of image vector quantization (VQ), the encoding speed is a key issue for its practical applications. To speed up the VQ encoding process, it is benificial to use lower dimensional features of k-dimensional vectors (k-D) first to check the difference between the input vector and a candidate codeword so as to reject a lot of unlikely codewords. As the features of a k-D vector in spatial domain, sum (1-D) and partial sums (2-D) are already proved to be very effective for codeword rejections in the previous works. However, because the energy of image vectors or codewords distributes almost equivalently at each dimension in spatial domain, the search efficiency through using sum and patial sums in spatial domain is still not very high. By exploiting the energy compaction property of Walsh transform, this paper proposes to use partial sum concept in Walsh domain instead of spatial domain to improve search efficiency further. Unlike to compute two partial sums over the first half of [1, k/2] dimensions of a vector and the second half of [k/2+1, k] dimensions in spatial domain, partial sums are computed over [1, K Wal/2] and [K Wal/2+1, K Wal] dimensions (K Wal<

UR - http://www.scopus.com/inward/record.url?scp=84863698507&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863698507&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84863698507

SN - 1604238216

SN - 9781604238211

T3 - 13th European Signal Processing Conference, EUSIPCO 2005

SP - 2198

EP - 2201

BT - 13th European Signal Processing Conference, EUSIPCO 2005

T2 - 13th European Signal Processing Conference, EUSIPCO 2005

Y2 - 4 September 2005 through 8 September 2005

ER -