D. T. Hoang, P. M. Long, and J. S. Vitter, "Explicit bitminimization for motion-compensated video coding", in Proceedings  Home/Search   Document Details and Download   Summary   Related Articles   Check

....was applied in the dotted region. Since Phi(0) and Phi(1) the blocks Phi is divided into) are motion compensated prior to Phi (labels mc1 and mc2) the costs of the MC of Phi can be calculated from already known data by a simple addition. This is similar to techniques presented in [10] for hierarchical MC. C. Color Image Coding Compression of color images only needs a trivial extension of the standard compression algorithms because every color image can be decomposed into three spectral bands. As usual the RGB color image is transformed into its luminance (Y) and chrominance ....

D. T. Hoang, P. M. Long, and J. S. Vitter, "Explicit bit minimization for motion-compensated video coding," in Proc. of the Data Compression Conference, J. A. Storer and M. Cohn, Eds., 1994, pp. 175--184.

....other popular schemes such as quad trees, and has been explored in [P96] it is also being implemented and tested[MM 96] Then the problem of computing the best tiling is precisely our 2D ffi weight partition problem with H c . Here, the bound ffi is the error threshold set by practitioners. See [HLV95, MP96] and references therein, or [S94] for background on block matching and [M94] for an extensive bibliography. ut We focus on these three problems in this paper. 1.3 Results We state our results for each of the three problems of our interest. 1D p partition under F . This problem has been ....

D. Hoang, P. Long and J. Vitter. Explicit bit minimization for motioncompensated video coding. Proc. Data Compression Conference, 1995.

....forward prediction (P frame) as well as backward or bi directional prediction (B frame) We integrated a hierarchical motion compensation (MC) in the bintree based WFA codec to exploit the correlation between successive frames. A similar approach based on quadtrees was successfully used e.g. in [4]. The search for the best fitting motion vectors is realized with a modified version of the recursive backtracking algorithm of the WFA codec. This obviously leads to a trade off between low bit rates and the cost of increasing encoding times. The paper is organized as follows. In the first ....

....was applied in the dotted region. Since Phi(0) and Phi(1) the blocks Phi is divided into) are motion compensated prior to Phi (labels mc1 and mc2) the costs of the MC of Phi can be calculated from already known data by a simple addition. This is similar to techniques presented in [4] for hierarchical MC. In general comparisons with fixed block sizes for MC show a noticeable reduction (5 15 ) of the bit rate for this hierarchical algorithm. 2.3 Variable Quality The quality of an WFA encoded frame or block is controlled by a quality factor q, which is normally fixed for all ....

D. T. Hoang, P. M. Long, and J. S. Vitter. Explicit bit minimization for motion-compensated video coding. In J. A. Storer and M. Cohn, editors, Proc. of the Data Compression Conference, pages 175--184. IEEE Computer Society Press, 1994.

....forward prediction (P frame) as well as backward or bi directional prediction (B frame) We integrated a hierarchical motion compensation (MC) in the bintree based WFA codec to exploit the correlation between successive frames. A similar approach based on quadtrees was successfully used e.g. in [3]. The search for the best fitting motion vectors is realized with a modified version of the recursive backtracking algorithm of the WFA codec. This obviously leads to a trade off between low bit rates and the cost of increasing encoding times. The paper is organized as follows. In the first ....

....was applied in the dotted region. Since Phi(0) and Phi(1) the blocks Phi is divided into) are motion compensated prior to Phi (labels mc1 and mc2) the costs of the MC of Phi can be calculated from already known data by a simple addition. This is similar to techniques presented in [3] for hierarchical MC. 3.3 Variable Quality The quality of an WFA encoded frame or block is controlled by a quality factor q, which is normally fixed for all frames. If, for example, the border of a frame is coded with a lower value for q than the center, the border region will be coded with less ....

D. T. Hoang, P. M. Long, and J. S. Vitter. Explicit bit minimization for motion-compensated video coding. In J. A. Storer and M. Cohn, editors, Proc. of the Data Compression Conference, pages 175--184, 1994.

....is processed with a recursive backtracking function that subdivides the image adaptively into a set of non overlapping range blocks. These range blocks are predicted by searching past and future frames for blocks that most closely match the corresponding ranges. We use techniques presented in [6] to obtain the hierarchical motion compensation. After this, the motion compensation prediction error (MCPE) is computed for each range. Then the MCPE is processed recursively with the standard WFA coding algorithm of [1] i.e. the MCPE is subdivided into several range blocks which are ....

D. T. Hoang, P. M. Long, and J. S. Vitter. Explicit bit minimization for motion-compensated video coding. In J. A. Storer and M. Cohn, editors, Proc. of the Data Compression Conference, pages 175--184, 1994.

....of the prediction error and motion vector codelength. These heuristic coders give compression performance comparable to the explicit minimization coders while running much faster. Experimental results are presented in Sections III D and IV B. Preliminary descriptions of this work can be found in [12], 13] 14] 15] II. PVRG Implementation of H.261 As a basis for comparing the different motion estimation schemes proposed in this chapter, we use the p Theta 64 coder supplied by the Portable Video Research Group (PVRG) In the base PVRG implementation, a motion vector v is determined ....

....generally applicable to any video coder that employs motion compensation in a low bit rate setting. In particular, the H.263 standard is similar enough to H.261 that it seems clear that these methods will work well with H.263. As a case in point, the bit minimization strategy has been applied in [12] within a non standard quadtree based coder that chooses motion vectors to optimize a hierarchical encoding of the motion information within a block matching framework with variable block sizes. VII. Acknowledgements Support for this work was provided in part by Air Force Office of Scientific ....

D. T. Hoang, P. M. Long, and J. S. Vitter, "Explicit bitminimization for motion-compensated video coding", in Proceedings

....of the prediction error and motion vector code length. These heuristic coders give compression performance comparable to the explicit minimization coders while running much faster. Experimental results are presented in Sections III D and IV B. Preliminary descriptions of this work can be found in [12], 13] 14] 15] II. PVRG Implementation of H.261 As a basis for comparing the different motion estimation schemes proposed in this chapter, we use the p Theta 64 coder supplied by the Portable Video Research Group (PVRG) In the base PVRG implementation, a motion vector v is determined ....

....should be applicable to any video coder that employs motion compensation in a low bit rate setting. In particular, the H.263 standard is similar enough to H.261 that it seems clear that these methods will work well with H.263. As a case in point, the bit minimization strategy has been applied in [12] within a non standard quadtree based coder that chooses motion vectors to optimize a hierarchical encoding of the motion information within a block matching framework with variable block sizes. VII. Acknowledgements Support for this work was provided in part by Air Force Office of Scientific ....

D. T. Hoang, P. M. Long, and J. S. Vitter, "Explicit bitminimization for motion-compensated video coding", in Proceedings

....of the prediction error and motion vector code length. These heuristic coders give compression performance comparable to the explicit minimization coders while running much faster. Experimental results are presented in Sections 3.4 and 4.2. Preliminary descriptions of this work can be found in [12, 13, 14, 15]. 2 PVRG Implementation of H.261 As a basis for comparing the different motion estimation schemes proposed in this chapter, we use the p Theta 64 coder supplied by the Portable Video Research Group (PVRG) 2 In the base PVRG implementation, a motion vector v is determined for each macroblock ....

....generally applicable to any video coder that employs motion compensation in a lowbit rate setting. In particular, the H.263 standard is similar enough to H.261 that it seems clear that these methods will work well with H.263. As a case in point, the bit minimization strategy has been applied in [12] within a non standard quadtree based coder that chooses motion vectors to optimize a hierarchical encoding of the motion information within a block matching framework with variable block sizes. 7 Acknowledgements Support for this work was provided in part by Air Force Office of Scientific ....

D. T. Hoang, P. M. Long, and J. S. Vitter, "Explicit bit-minimization for motion-compensated video coding", in Proceedings 1994 Data Compression Conference, Snowbird, UT, Mar. 1994, pp. 175--184, IEEE Computer Society Press.

....or less. At such low bit rates, the coding of motion vectors and side information takes up a significant portion of the bandwidth. This observation had been previously made in [5] but much of the work on block matching motion compensation remained focused on speeding up the motion search until [6], where we described techniques that explicitly minimize rate (which includes coding of residuals, motion vector, and side information) when choosing motion vectors. In [7] we extended this work by performing motion estimation to minimize a combination of rate and distortion. In related work, ....

....motion estimation to minimize a combination of rate and distortion. In related work, Chung, Kossentini and Smith [8] considered rate distortion optimizations for motion estimation in a video coder based on subband coding and vector quantization. The explicit minimization algorithms described in [6, 7] are computationally intensive and therefore not practical for use in real time, cost effective solutions for desktop video conferencing and video phone. However, they serve to demonstrate that by taking the coding of motion vectors into consideration when performing motion estimation, we can get ....

[Article contains additional citation context not shown here]

D. T. Hoang, P. M. Long, and J. S. Vitter, "Explicit bit-minimization for motioncompensated video coding", in Proceedings of the 1994 Data Compression Conference, Snowbird, UT, Mar. 1994, pp. 175--184, IEEE Computer Society Press.

....other than the H.261 standard. The upcoming H.263 standard is similar enough to H.261 that it seems clear that these methods will work well with the H.263 standard. An example of the use of the techniques of this paper in a coder where the motion field is encoded using a quadtree is described in [4]. ....

D. T. Hoang, P. M. Long, and J. S. Vitter. Explicit bit-minimization for motion-compensated video coding. In Proceedings of the 1994 IEEE Data Compression Conference, pages 175--184, Snowbird, UT, 1994.

No context found.

D. T. Hoang, P. M. Long, and J. S. Vitter, "Explicit bit-minimization for motion-compensated video coding", in Proceedings of the 1994 Data Compression Conference, Snowbird, UT, Mar. 1994, pp. 175--184, IEEE Computer Society Press.

....of the prediction error and motion vector code length. These heuristic coders give compression performance comparable to the explicit minimization coders while running much faster. Experimental results are presented in Sections 4.3.4 and 4.4.2. Preliminary descriptions of this work can be found in [37, 38, 39, 40]. 4.2 PVRG Implementation of H.261 As a basis for comparing the di#erent motion estimation schemes proposed in this chapter, we use the p 64 coder supplied by the Portable Video Research Group (PVRG) 45] The block diagram for a basic p 64 coder is shown in Figure 3.18. In the base PVRG ....

....correlated motion vectors to be e#ciently coded. In this chapter, we consider the instantiation of the bit minimization principle in a video coder that uses a quadtree to code motion vectors, thereby departing from the p 64 standard. The contents of this chapter were originally presented in [37]. 5.1 Quadtree Data Structure Often used as a representation for bi level images, the quadtree can also be used to code motion vectors. We first describe the quadtree in the context of bi level image representation and later show how to use it to code a motion field. 5.1.1 Quadtree Representation ....

D. T. Hoang, P. M. Long, and J. S. Vitter. Explicit bit-minimization for motion-compensated video coding. In Proceedings 1994 Data Compression Conference, pages 175--184, Snowbird, UT, March 1994. IEEE Computer Society Press.

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