Data compression: techniques and applications
Data compression: techniques and applications
Vector quantization and signal compression
Vector quantization and signal compression
Source Coding Theory
Optimal bit allocation under multiple rate constraints
DCC '96 Proceedings of the Conference on Data Compression
A review of the minimum maximum criterion for optimal bitallocation among dependent quantizers
IEEE Transactions on Multimedia
Optimal bit allocation for coding of video signals over ATM networks
IEEE Journal on Selected Areas in Communications
Bit allocation for joint source/channel coding of scalable video
IEEE Transactions on Image Processing
Rate control and bit allocation for MPEG-4
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
Dynamic programming algorithms based on Lagrange multiplier method is often used for obtaining an optimal bit allocation strategy to minimize the total distortion given a constrained rate budget in both source and channel coding applications. Due to possible large quantizer set and improper initialization, the algorithm often suffers from heavy computational complexity. There have been many solutions in recent years so the above question. In this paper, a simple but efficient algorithm is presented to further speed up the convergence of the algorithm. This algorithm can be easily realized and get the final solution much faster. The experimental result shows that our new algorithm can figure out the optimal solution with a speed 5-7 times faster than the original algorithm.