Progressive compression of geometry information with smooth intermediate meshes

Taejung Park, Haeyoung Lee, Chang-Hun Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each grid point, a binary sign, which indicates inside or outside of the mesh, is generated based on the distance to the mesh. In each leaf cell having a vertex, a least square fitting plane is created for a localized geometry range with signs. Finally, quantized geometry information is locally encoded. We demonstrate that the octree with signs can be used to predict the vertex positions. As a result, the proposed method generates competitive bitrates compared to the current state-of-art progressive geometry coder. Our method also shows better rate-distortion performance during decompression or transmission with improved smoothness.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages89-96
Number of pages8
Volume4478 LNCS
EditionPART 2
Publication statusPublished - 2007 Dec 1
Event3rd Iberian Conference on Pattern Recognition and Image Analysis, IbPRIA 2007 - Girona, Spain
Duration: 2007 Jun 62007 Jun 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume4478 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd Iberian Conference on Pattern Recognition and Image Analysis, IbPRIA 2007
CountrySpain
CityGirona
Period07/6/607/6/8

Fingerprint

Information Geometry
Octree
Compression
Mesh
Geometry
Decompression
Least-Squares Analysis
Grid
Least Square Fitting
Rate-distortion
Vertex of a graph
Smoothness
Leaves
Coding
Binary
Predict
Cell
Range of data
Demonstrate

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Park, T., Lee, H., & Kim, C-H. (2007). Progressive compression of geometry information with smooth intermediate meshes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 4478 LNCS, pp. 89-96). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4478 LNCS, No. PART 2).

Progressive compression of geometry information with smooth intermediate meshes. / Park, Taejung; Lee, Haeyoung; Kim, Chang-Hun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4478 LNCS PART 2. ed. 2007. p. 89-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4478 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, T, Lee, H & Kim, C-H 2007, Progressive compression of geometry information with smooth intermediate meshes. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 4478 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 4478 LNCS, pp. 89-96, 3rd Iberian Conference on Pattern Recognition and Image Analysis, IbPRIA 2007, Girona, Spain, 07/6/6.
Park T, Lee H, Kim C-H. Progressive compression of geometry information with smooth intermediate meshes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 4478 LNCS. 2007. p. 89-96. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
Park, Taejung ; Lee, Haeyoung ; Kim, Chang-Hun. / Progressive compression of geometry information with smooth intermediate meshes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4478 LNCS PART 2. ed. 2007. pp. 89-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{5946ab3bf6fc493fbfd33a10b6259cb9,
title = "Progressive compression of geometry information with smooth intermediate meshes",
abstract = "We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each grid point, a binary sign, which indicates inside or outside of the mesh, is generated based on the distance to the mesh. In each leaf cell having a vertex, a least square fitting plane is created for a localized geometry range with signs. Finally, quantized geometry information is locally encoded. We demonstrate that the octree with signs can be used to predict the vertex positions. As a result, the proposed method generates competitive bitrates compared to the current state-of-art progressive geometry coder. Our method also shows better rate-distortion performance during decompression or transmission with improved smoothness.",
author = "Taejung Park and Haeyoung Lee and Chang-Hun Kim",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540728481",
volume = "4478 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "89--96",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 2",

}

TY - GEN

T1 - Progressive compression of geometry information with smooth intermediate meshes

AU - Park, Taejung

AU - Lee, Haeyoung

AU - Kim, Chang-Hun

PY - 2007/12/1

Y1 - 2007/12/1

N2 - We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each grid point, a binary sign, which indicates inside or outside of the mesh, is generated based on the distance to the mesh. In each leaf cell having a vertex, a least square fitting plane is created for a localized geometry range with signs. Finally, quantized geometry information is locally encoded. We demonstrate that the octree with signs can be used to predict the vertex positions. As a result, the proposed method generates competitive bitrates compared to the current state-of-art progressive geometry coder. Our method also shows better rate-distortion performance during decompression or transmission with improved smoothness.

AB - We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each grid point, a binary sign, which indicates inside or outside of the mesh, is generated based on the distance to the mesh. In each leaf cell having a vertex, a least square fitting plane is created for a localized geometry range with signs. Finally, quantized geometry information is locally encoded. We demonstrate that the octree with signs can be used to predict the vertex positions. As a result, the proposed method generates competitive bitrates compared to the current state-of-art progressive geometry coder. Our method also shows better rate-distortion performance during decompression or transmission with improved smoothness.

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

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

M3 - Conference contribution

AN - SCOPUS:38049113426

SN - 9783540728481

VL - 4478 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 89

EP - 96

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -