We consider optimal encoding of a sequence of video units under a given set of rate constraints which may arise from finite codec delay, finite channel capacity, and finite codec buffer sizes. A Lagrange-multiplier approach is employed and some useful properties of the optimal Lagrange- multiplier solution are obtained under the assumption that the allowed video data rates are continuous. Based on these properties, we derive two solution algorithms for discrete allocation. The algorithms are more efficient than that have been presented to date. The solution is optimal when the distortion-rate relations of the video units are convex and the selectable rates of the video units are uniformly spaced with the same granularity. When these conditions do not hold, the Lagrange-multiplier solution may be suboptimal, but can be improved or optimized by a search about the solution.
|頁（從 - 到）||1370-1381|
|期刊||Proceedings of SPIE - The International Society for Optical Engineering|
|出版狀態||Published - 1 十二月 1997|
|事件||Visual Communications and Image Processing '97 - San Jose, CA, United States|
持續時間: 12 二月 1997 → 12 二月 1997