Abstract
A new fast approach to the nearest codevector search for 3D mesh compression using an orthonormal transformed codebook is proposed. The algorithm uses the coefficients of an input vector along a set of orthonormal bases as the criteria to reject impossible codevectors. Compared to the full search algorithm, a great deal of computational time is saved without extra distortion and additional storage requirement. Simulation results demonstrate the effectiveness of the proposed algorithm in terms of computational complexity.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
