The efficiency of shape coding is an important problem concerning content-based image manipulations and object-based coding of the video sequences. In order to encode the shape information of an object, the boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum allowable distortion. The conventional boundary coding schemes, however, does not successfully remove the temporal redundancy of the video sequences. This paper proposes a new boundary encoding scheme by which the temporal redundancy between two successive frames is efficiently removed, resulting in lower bit-rate than the conventional algorithms. The interframe vertex selection problem is solved by finding the path with the minimum cost in the directed acyclic graph (DAG) and its fast version using a simplified graph is introduced to reduce the computational load. The vertices were selected from both the current frame to be encoded and the previous frame already encoded, and thus, the temporal redundancy was effectively removed.
Bibliographical noteFunding Information:
Manuscript received March 24, 1999; revised May 31, 2000. This work was supported in part by the Brain Korea 21 Program. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Rashid Ansari. K. J. Kim is with Serome Technology Laboratory, Seoul 120–749, Korea. J.-Y. Suh and M. G. Kang are with the Department of Electronic Engineering, Yonsei University, Seoul 120-749, Korea (e-mail: email@example.com). Publisher Item Identifier S 1057-7149(00)07599-0.
All Science Journal Classification (ASJC) codes
- Computer Graphics and Computer-Aided Design