Compression of 3D Triangle Mesh Sequences 


Vol. 27,  No. 5, pp. 458-466, May  2002


PDF
  Abstract

As 3D data is widely used for various applications, much attemps have been made to compress a huge amount of 3D data. Until now, however, most efforts have been focused on the compression of 3D static data, and little attemps to compress 3D sequence data have been made. In this paper, we propose a new geometry compression algorithm for 3D mesh sequences, based on the vertex-wise motion vector(MV) prediction scheme. In general, the MV of a vertex is highly correlated to those of adjacent vertices. To exploit high correlation, we define a neighborhood of a vertex, and predict the MV of the vertex from those of the neighborhood. It is shown that the proposed algorithm has simpler structure than the existing segment-based algorithm [10]. Furthermore, intensive simulation results demonstrate that the proposed algorithm yields better compression performance than the existing algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Yang and S. Lee, "Compression of 3D Triangle Mesh Sequences," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 458-466, 2002. DOI: .

[ACM Style]

Jeong-Hyu Yang and Sang-Uk Lee. 2002. Compression of 3D Triangle Mesh Sequences. The Journal of Korean Institute of Communications and Information Sciences, 27, 5, (2002), 458-466. DOI: .

[KICS Style]

Jeong-Hyu Yang and Sang-Uk Lee, "Compression of 3D Triangle Mesh Sequences," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 458-466, 5. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880