Generalized interframe vertex-based shape encoding scheme for video sequences

Kyeong Joong Kim, Jong Yeul Suh, Moon Gi Kang

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1667-1676
Number of pages10
JournalIEEE Transactions on Image Processing
Volume9
Issue number10
DOIs
Publication statusPublished - 2000 Oct 1

Fingerprint

Redundancy
Encoding
Coding
Vertex of a graph
Directed Acyclic Graph
Polygon
Manipulation
Path
Costs
Graph in graph theory
Object

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design

Cite this

@article{6ffa0e6de16f416792f1db7b51607c88,
title = "Generalized interframe vertex-based shape encoding scheme for video sequences",
abstract = "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.",
author = "Kim, {Kyeong Joong} and Suh, {Jong Yeul} and Kang, {Moon Gi}",
year = "2000",
month = "10",
day = "1",
doi = "10.1109/83.869178",
language = "English",
volume = "9",
pages = "1667--1676",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

Generalized interframe vertex-based shape encoding scheme for video sequences. / Kim, Kyeong Joong; Suh, Jong Yeul; Kang, Moon Gi.

In: IEEE Transactions on Image Processing, Vol. 9, No. 10, 01.10.2000, p. 1667-1676.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Generalized interframe vertex-based shape encoding scheme for video sequences

AU - Kim, Kyeong Joong

AU - Suh, Jong Yeul

AU - Kang, Moon Gi

PY - 2000/10/1

Y1 - 2000/10/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034298841&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034298841&partnerID=8YFLogxK

U2 - 10.1109/83.869178

DO - 10.1109/83.869178

M3 - Article

C2 - 18262906

AN - SCOPUS:0034298841

VL - 9

SP - 1667

EP - 1676

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 10

ER -