Optimization and Tracking of Polygon Vertices for Shape Coding
The efficiency of shape coding is an important problem in low-bitrate object-based video compression. Lossy contour coding methods typically include contour approximation by polygons or splines, spatial and/or temporal prediction of vertices, and entropy coding the of prediction error. In conventional contour coding schemes, however, the coding gain in the interframe mode is typically small. This indicates that the temporal redundancy is not successfully removed. The paper addresses the issue of temporal shape decorrelation by proposing the Kalman filtering-based approach to vertex tracking and prediction. A temporal vertex association procedure is proposed effectively minimizing bit rate in each frame. The prediction error is coded using adaptive arithmetic encoding. Vertex optimization is employed to reduce the shape reconstruction error.
KeywordsPrediction Error Temporal Prediction Video Object Vertex Position Polygon Approximation
Unable to display preview. Download preview PDF.
- 2.Lee, S., Cho, D., Cho, Y., Son, S., Jang, E., Shin, J.: Binary shape coding using 1-D distance values from baseline. In: Proc. ICIP, pp. I-508–511 (1997)Google Scholar
- 8.Cho, S.H., Kim, R.C., Oh, S.S., Lee, S.U.: A Coding Technique for the Contours in Smoothly Perfect Eight-Connectivity Based on Two-Stage Motion Compensation. IEEE Trans. CSVT 9, 59–69 (1999)Google Scholar
- 11.Gerken, P.: Object-based analysis-synthesis coding of image sequences at very low bit rates. IEEE Trans. CSVT 4, 228–235 (1994)Google Scholar