TY - JOUR
T1 - Constant quality rate allocation for FGS coding using composite R-D analysis
AU - Cheng, Hui
AU - Zhang, Xi Min
AU - Shi, Yun Q.
AU - Vetro, Anthony
AU - Sun, Huifang
N1 - Funding Information:
Manuscript received June 24, 2003; revised March 19, 2005. This work was supported in part by the National Institutes of Health under Grants R01EB002309 and R01NS38494. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Chalapathy Neti. H. Cheng is with the Sarnoff Corporation, Princeton, NJ 08540 USA (e-mail: [email protected]). X. M. Zhang is with the US Advanced Technologies Center, SONY Electronics, Inc., San Jose, CA 95134 USA (e-mail: [email protected]). Y. Q. Shi is with the Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102-1982 USA (e-mail: [email protected]). A. Vetro and H. Sun are with the Mitsubishi Electronic Research Laboratory, Cambridge, MA 02139 USA (e-mail: [email protected]; [email protected]). Digital Object Identifier 10.1109/TMM.2005.864351
PY - 2006/4
Y1 - 2006/4
N2 - In this correspondence, we propose a constant quality rate allocation algorithm for fine granularity scalability (FGS) coded videos. The rate allocation problem is formulated as a constrained minimization of quality fluctuation. The minimization is solved using a composite rate distortion (R-D) analysis. For a set of video frames, a composite R-D curve is first computed and then used for computing the optimal rate allocation. This algorithm is efficient because it is neither iterative nor recursive. After the composite R-D curve is computed, it can be used for optimal rate allocation of any rate budget. Moreover, the composite R-D curve can be updated efficiently over sliding windows. Experimental results have shown both the effectiveness and the efficiency of the proposed algorithm.
AB - In this correspondence, we propose a constant quality rate allocation algorithm for fine granularity scalability (FGS) coded videos. The rate allocation problem is formulated as a constrained minimization of quality fluctuation. The minimization is solved using a composite rate distortion (R-D) analysis. For a set of video frames, a composite R-D curve is first computed and then used for computing the optimal rate allocation. This algorithm is efficient because it is neither iterative nor recursive. After the composite R-D curve is computed, it can be used for optimal rate allocation of any rate budget. Moreover, the composite R-D curve can be updated efficiently over sliding windows. Experimental results have shown both the effectiveness and the efficiency of the proposed algorithm.
UR - http://www.scopus.com/inward/record.url?scp=33645159252&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33645159252&partnerID=8YFLogxK
U2 - 10.1109/TMM.2005.864351
DO - 10.1109/TMM.2005.864351
M3 - Article
AN - SCOPUS:33645159252
SN - 1520-9210
VL - 8
SP - 405
EP - 407
JO - IEEE Transactions on Multimedia
JF - IEEE Transactions on Multimedia
IS - 2
ER -