G. Cheung, "Optimal bit allocation strategy for joint source/Channel coding of scalable video," M.S. thesis, Electrical Eng. and Computer Sci.n, U.C. Berkeley, 1998.  Home/Search   Document Details and Download   Summary   Related Articles

....to set up the cost of each possible quadtree. Since there are two constraints, two Lagrange multipliers have to be used. The optimal tree pruning algorithm in [9] is used with this Lagrangian cost, and the search in the 2D space of Lagrange multipliers is done using the technique proposed in [10]. The resulting coding technique allows the encoder to select the decoder complexity with a fine level of granularity and therefore our results are superior, in R C D terms, to comparable work reported in the literature [4, 3] 2. VCA FOR IDCT In our previous work [5] we proposed a VCA IDCT ....

....a frame of image is computed. Then the Lagrange parameters are adjusted, and the whole process repeats until the bit budget and the complexity budget constraint are met. There are several methods for adjusting the Lagrange multipliers. In this paper, we use the linear approximation algorithm [10] in which each Lagrange multiplier is shrunk (by a factor # ) or expanded ( by a factor ## ) depending on whether its corresponding constraint (rate or complexity) has been met or exceeded, respectively. 4. EXPERIMENTAL RESULTS 0 5 10 15 x 10 1 2 3 4 5 6 7 8 10 20 30 40 ....

G. Cheung, "Optimal bit allocation strategy for joint source/Channel coding of scalable video," M.S. thesis, Electrical Eng. and Computer Sci.n, U.C. Berkeley, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC