Compression of 3-D triangle mesh sequences based on vertex-wise motion vector prediction

Jeong H. Yang, Chang-Su Kim, Sang U. Lee

Research output: Contribution to journalArticle

47 Citations (Scopus)

Abstract

In this paper, we propose an efficient geometry compression algorithm for three-dimensional (3-D) mesh sequences based on the two-stage vertex-wise motion vector (MV) prediction. In general, the MV of a vertex is highly correlated to those of the adjacent vertices. To exploit this high correlation, we define the neighborhood of a vertex, and predict the MV of the vertex from those of the neighborhood. The error vectors are related to the local shape changes of 3-D objects, and still have redundancy. To remove the redundancy, the error vectors are also predicted, at the second stage, spatially or temporally by using a rate-distortion optimization technique. It is shown that the proposed algorithm has simpler structure than the existing segment-based algorithm, and yields better compression performance.

Original languageEnglish
Pages (from-to)1178-1184
Number of pages7
JournalIEEE Transactions on Circuits and Systems for Video Technology
Volume12
Issue number12
DOIs
Publication statusPublished - 2002 Dec 1
Externally publishedYes

Fingerprint

Redundancy
Geometry

Keywords

  • Rate-distortion optimization
  • Triangle mesh sequence
  • Vertex-wise motion vector prediction

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Compression of 3-D triangle mesh sequences based on vertex-wise motion vector prediction. / Yang, Jeong H.; Kim, Chang-Su; Lee, Sang U.

In: IEEE Transactions on Circuits and Systems for Video Technology, Vol. 12, No. 12, 01.12.2002, p. 1178-1184.

Research output: Contribution to journalArticle

@article{4ae07851e9434946b239645b141f84cf,
title = "Compression of 3-D triangle mesh sequences based on vertex-wise motion vector prediction",
abstract = "In this paper, we propose an efficient geometry compression algorithm for three-dimensional (3-D) mesh sequences based on the two-stage vertex-wise motion vector (MV) prediction. In general, the MV of a vertex is highly correlated to those of the adjacent vertices. To exploit this high correlation, we define the neighborhood of a vertex, and predict the MV of the vertex from those of the neighborhood. The error vectors are related to the local shape changes of 3-D objects, and still have redundancy. To remove the redundancy, the error vectors are also predicted, at the second stage, spatially or temporally by using a rate-distortion optimization technique. It is shown that the proposed algorithm has simpler structure than the existing segment-based algorithm, and yields better compression performance.",
keywords = "Rate-distortion optimization, Triangle mesh sequence, Vertex-wise motion vector prediction",
author = "Yang, {Jeong H.} and Chang-Su Kim and Lee, {Sang U.}",
year = "2002",
month = "12",
day = "1",
doi = "10.1109/TCSVT.2002.806814",
language = "English",
volume = "12",
pages = "1178--1184",
journal = "IEEE Transactions on Circuits and Systems for Video Technology",
issn = "1051-8215",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - Compression of 3-D triangle mesh sequences based on vertex-wise motion vector prediction

AU - Yang, Jeong H.

AU - Kim, Chang-Su

AU - Lee, Sang U.

PY - 2002/12/1

Y1 - 2002/12/1

N2 - In this paper, we propose an efficient geometry compression algorithm for three-dimensional (3-D) mesh sequences based on the two-stage vertex-wise motion vector (MV) prediction. In general, the MV of a vertex is highly correlated to those of the adjacent vertices. To exploit this high correlation, we define the neighborhood of a vertex, and predict the MV of the vertex from those of the neighborhood. The error vectors are related to the local shape changes of 3-D objects, and still have redundancy. To remove the redundancy, the error vectors are also predicted, at the second stage, spatially or temporally by using a rate-distortion optimization technique. It is shown that the proposed algorithm has simpler structure than the existing segment-based algorithm, and yields better compression performance.

AB - In this paper, we propose an efficient geometry compression algorithm for three-dimensional (3-D) mesh sequences based on the two-stage vertex-wise motion vector (MV) prediction. In general, the MV of a vertex is highly correlated to those of the adjacent vertices. To exploit this high correlation, we define the neighborhood of a vertex, and predict the MV of the vertex from those of the neighborhood. The error vectors are related to the local shape changes of 3-D objects, and still have redundancy. To remove the redundancy, the error vectors are also predicted, at the second stage, spatially or temporally by using a rate-distortion optimization technique. It is shown that the proposed algorithm has simpler structure than the existing segment-based algorithm, and yields better compression performance.

KW - Rate-distortion optimization

KW - Triangle mesh sequence

KW - Vertex-wise motion vector prediction

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

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

U2 - 10.1109/TCSVT.2002.806814

DO - 10.1109/TCSVT.2002.806814

M3 - Article

AN - SCOPUS:0036989824

VL - 12

SP - 1178

EP - 1184

JO - IEEE Transactions on Circuits and Systems for Video Technology

JF - IEEE Transactions on Circuits and Systems for Video Technology

SN - 1051-8215

IS - 12

ER -