Abstract
We present an improved codebook search algorithm in this paper. We call it thedouble test of principal components(DTPC). This algorithm speeds up the codebook search by searching only an appropriate sub-codebook instead of the whole set of codewords. Moreover, DTPC inherits several benefits from some previous techniques, such as the double test (DT) and the principal component analysis (PCA). Thus DTPC is much more efficient than the other algorithms. Simulation results confirm this efficiency. According to these results, the total number of the mathematical operations needed in DTPC is usually less than that needed in any other method, even if the MSE degradation of DTPC is limited within 0.13 dB. Furthermore, in some cases, this number of DTPC is only 3% of that in a full search.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Visual Communication and Image Representation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
