Compression of volumetric data using 3D Delaunay triangulation

Raka Jovanovic, Rudolph A. Lorentz

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

2 Citations (Scopus)

Abstract

In this paper we present a new method for lossy compression of volumetric data that is based on data dependent triangulation. We have extended an approach that has previously been successfully applied in the case of two dimensional images. In our method we first select significant points in the data, and using them, a three dimensional Delaunay triangulation is created. The tetrahedrons existing in the triangulation are used as cells for a linear interpolation spline that gives an approximation of the original image. The compression is done by storing the positions and values of the nodes of the tetrahedrons instead of the entire data set. We compare our compression technique to JPG 2000 3D which is a de-facto standard for compression of volumetric data. Tests are done on different classes of data sets, on which we compare the bits per voxel needed to achieve the same level of peak signal to noise ration. We show that our algorithm performs significantly different than wavelet based compression, as in the implementation of JPG 2000 3D, and in case of data that is smooth outperforms it.

Original languageEnglish
Title of host publication2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011
DOIs
Publication statusPublished - 1 Jul 2011
Event2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011 - Kuala Lumpur, Malaysia
Duration: 19 Apr 201121 Apr 2011

Other

Other2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011
CountryMalaysia
CityKuala Lumpur
Period19/4/1121/4/11

Fingerprint

Delaunay triangulation
Triangulation
Compression
Triangular pyramid
Splines
Interpolation
Lossy Compression
Linear Interpolation
Dependent Data
Voxel
Spline
Wavelets
Entire
Three-dimensional
Cell
Approximation
Vertex of a graph

ASJC Scopus subject areas

  • Control and Optimization
  • Modelling and Simulation

Cite this

Jovanovic, R., & Lorentz, R. A. (2011). Compression of volumetric data using 3D Delaunay triangulation. In 2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011 [5775462] https://doi.org/10.1109/ICMSAO.2011.5775462

Compression of volumetric data using 3D Delaunay triangulation. / Jovanovic, Raka; Lorentz, Rudolph A.

2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011. 2011. 5775462.

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

Jovanovic, R & Lorentz, RA 2011, Compression of volumetric data using 3D Delaunay triangulation. in 2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011., 5775462, 2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011, Kuala Lumpur, Malaysia, 19/4/11. https://doi.org/10.1109/ICMSAO.2011.5775462
Jovanovic R, Lorentz RA. Compression of volumetric data using 3D Delaunay triangulation. In 2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011. 2011. 5775462 https://doi.org/10.1109/ICMSAO.2011.5775462
Jovanovic, Raka ; Lorentz, Rudolph A. / Compression of volumetric data using 3D Delaunay triangulation. 2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011. 2011.
@inproceedings{519f96fa54134ba691bf4fdb3b93b1a2,
title = "Compression of volumetric data using 3D Delaunay triangulation",
abstract = "In this paper we present a new method for lossy compression of volumetric data that is based on data dependent triangulation. We have extended an approach that has previously been successfully applied in the case of two dimensional images. In our method we first select significant points in the data, and using them, a three dimensional Delaunay triangulation is created. The tetrahedrons existing in the triangulation are used as cells for a linear interpolation spline that gives an approximation of the original image. The compression is done by storing the positions and values of the nodes of the tetrahedrons instead of the entire data set. We compare our compression technique to JPG 2000 3D which is a de-facto standard for compression of volumetric data. Tests are done on different classes of data sets, on which we compare the bits per voxel needed to achieve the same level of peak signal to noise ration. We show that our algorithm performs significantly different than wavelet based compression, as in the implementation of JPG 2000 3D, and in case of data that is smooth outperforms it.",
author = "Raka Jovanovic and Lorentz, {Rudolph A.}",
year = "2011",
month = "7",
day = "1",
doi = "10.1109/ICMSAO.2011.5775462",
language = "English",
isbn = "9781457700057",
booktitle = "2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011",

}

TY - GEN

T1 - Compression of volumetric data using 3D Delaunay triangulation

AU - Jovanovic, Raka

AU - Lorentz, Rudolph A.

PY - 2011/7/1

Y1 - 2011/7/1

N2 - In this paper we present a new method for lossy compression of volumetric data that is based on data dependent triangulation. We have extended an approach that has previously been successfully applied in the case of two dimensional images. In our method we first select significant points in the data, and using them, a three dimensional Delaunay triangulation is created. The tetrahedrons existing in the triangulation are used as cells for a linear interpolation spline that gives an approximation of the original image. The compression is done by storing the positions and values of the nodes of the tetrahedrons instead of the entire data set. We compare our compression technique to JPG 2000 3D which is a de-facto standard for compression of volumetric data. Tests are done on different classes of data sets, on which we compare the bits per voxel needed to achieve the same level of peak signal to noise ration. We show that our algorithm performs significantly different than wavelet based compression, as in the implementation of JPG 2000 3D, and in case of data that is smooth outperforms it.

AB - In this paper we present a new method for lossy compression of volumetric data that is based on data dependent triangulation. We have extended an approach that has previously been successfully applied in the case of two dimensional images. In our method we first select significant points in the data, and using them, a three dimensional Delaunay triangulation is created. The tetrahedrons existing in the triangulation are used as cells for a linear interpolation spline that gives an approximation of the original image. The compression is done by storing the positions and values of the nodes of the tetrahedrons instead of the entire data set. We compare our compression technique to JPG 2000 3D which is a de-facto standard for compression of volumetric data. Tests are done on different classes of data sets, on which we compare the bits per voxel needed to achieve the same level of peak signal to noise ration. We show that our algorithm performs significantly different than wavelet based compression, as in the implementation of JPG 2000 3D, and in case of data that is smooth outperforms it.

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

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

U2 - 10.1109/ICMSAO.2011.5775462

DO - 10.1109/ICMSAO.2011.5775462

M3 - Conference contribution

AN - SCOPUS:79959657258

SN - 9781457700057

BT - 2011 4th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2011

ER -