Abstract
A fast winner search method based on separating all codewords in the original codebook completely into a promising group and an impossible group is proposed. Group separation is realized by using sorted both L1 and L2 norms independently. As a result, the necessary search scope that guarantees full search equivalent PSNR can be limited to the common part of the 2 individual promising groups. The high search efficiency is confirmed by experimental results.
Original language | English |
---|---|
Pages (from-to) | 2483-2486 |
Number of pages | 4 |
Journal | IEICE Transactions on Information and Systems |
Volume | E86-D |
Issue number | 11 |
Publication status | Published - 2003 Nov |
Keywords
- Fast search
- L and L norm
- Vector quantization
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence