Abstract
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 to 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Shoham Y, Gersho A. Efficient bit allocation for an arbitrary set of quantizers.IEEE Transactions on Acoustics, Speech, and Signal Processing, 1988, 36(9): 1445–1453.
Chen Jet al. Optimal bit allocation for coding of video signals over ATM network.IEEE Journal on Selected Areas in Communications, Aug., 1997, 15(6): 1002–1025.
Schuster G, Melnikov G, Katsaggelos A. A review of the minimum maximum criterion for optimal bit allocation among dependent quantizers.IEEE Transactions on Multimedia, March, 1999, 1(1): 3–17.
Westerink P, Biemond J, Boekee D. An optimal bit allocation algorithm for sub-band coding. InProc. IEEE ICASSP88, New York, April, 1988, Vol.2, pp.757–760.
Ronda Jet al. Rate control and bit allocation for MPEG-4.IEEE Trans. Circuits and Systems for Video Technology, December, 1999, 9(8): 1243–1258.
Cheung C, Zakhor A. Bit allocation for joint source/channel coding of scalable video.IEEE Trans. Image Processing, March, 2000, 9(3): 340–356.
Gray R M. Source Coding Theory. Norwell, MA: Kluwer Academic Press, 1990.
Chou P, Lookabaugh T, Gray R. Optimal pruning with applications to tree-structured source coding and modeling.IEEE Trans. Information Theory, March, 1989, IT-35: 299–315.
Ramchandran K, Vetterli M. Best wavelet packet bases in a rate-distortion sense.IEEE Trans. Image Processing, April, 1993, 2(2): 160–175.
Ramchandran K, Ortega A, Vetterli M. Bit allocation for dependent quantization with applications to multiresolution and MPEG video coders.IEEE Trans. Image Processing, September, 1994, 3(4): 533–545.
Ortega A. Optimal bit allocation under multiple rate constraints. InProc. IEEE DCC'96, 1996, pp.349–358.
Geoff Davis. Baseline wavelet transform coder construction kit. Technical Report, University of Dartmouth, January, 1997.
Riskin E. Optimal bit allocation via the generalized BFOS algorithm.IEEE Trans. Information Theory, March, 1991, 37(2): 400–402.
LEE W, Ra J. Fast algorithm for optimal allocation in a rate-distortion sense.Electronics Letters, September, 1996, 32(20): 1871–1873.
Lynch T J. Data Compression Techniques and Applications. Lifetime Learning Publications, Belmont, CA, 1985.
Gersho Aet al. Vector Quantization and Signal Compression. Boston, MA: Kluwer Academic Press, 1992.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China (Grant No.60033020).
Rights and permissions
About this article
Cite this article
Chen, Y., Wang, G. & Dong, S. Further improvement on dynamic programming for optimal bit allocation. J. Comput. Sci. & Technol. 18, 109–113 (2003). https://doi.org/10.1007/BF02946658
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946658