DEBLOCKING FOR DYNAMIC TRIANGLE MESHES

Jan Rus, Libor Váša

Abstract

Mesh segmentation (clustering) is a useful tool, which improves compression performance. On the other hand, per-partes processing of meshes often leads to new types of artifacts - cracks and shifts on the borders between clusters. These artifacts are detected by both, Human Visual System (HVS) and perceptually-motivated distortion metrics. In this paper, we present a post processing algorithm, which aims at reducing such artifacts without needing any additional data - using only information about the cluster distribution that is already present at the decoder. A rigid transformation, which minimises the border artifacts, is iteratively computed and applied per cluster. Our experiments show that this approach leads to a reduction of distortion, as measured by the STED metric, by up to 18% for low bitrates. We also present visual results confirming that the improvement is well visible.

References

  1. Amjoun, R. and Straßer, W. (2007). Efficient compression of 3d dynamic mesh sequences. Journal of the WSCG.
  2. Arun, K. S., Huang, T. S., and Blostein, S. D. (1987). Leastsquares fitting of two 3-d point sets. IEEE Trans. Pattern Anal. Mach. Intell., 9:698-700.
  3. Desbrun, M., Meyer, M., Schröder, P., and Barr, A. H. (1999). Implicit fairing of irregular meshes using diffusion and curvature flow. In Proceedings of the 26th annual conference on Computer graphics and interactive techniques, SIGGRAPH 7899, pages 317-324, New York, NY, USA. ACM Press/Addison-Wesley Publishing Co.
  4. Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., Wu, A. Y., Member, S., and Member, S. (2002). An efficient k-means clustering algorithm: Analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:881-892.
  5. Karni, Z. and Gotsman, C. (2000). Spectral compression of mesh geometry. In SIGGRAPH, pages 279-286.
  6. Karypis, G. and Kumar, V. (1998). Metis: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices version 4.0. In University of Minnesota, Department of Comp. Sci. and Eng., Army HPC Research Center, Minneapolis.
  7. Lavoué, G. (2011). A Multiscale Metric for 3D Mesh Visual Quality Assessment. Computer Graphics Forum (Proceedings of Eurographics Symposium on Geometry Processing 2011), 30.
  8. Lavoué, G., Drelie Gelasca, E., Dupont, F., Baskurt, A., and Ebrahimi, T. (2006). Perceptually driven 3D distance metrics with application to watermarking. In SPIE Applications of Digital Image Processing XXIX.
  9. Lengyel, J. E. (1999). Compression of time-dependent geometry. In In I3D 99: Proceedings of the 1999 symposium on Interactive 3D graphics, pages 89-95. ACM.
  10. Mamou, K., Zaharia, T. B., and Preˆteux, F. J. (2008). Famc: The mpeg-4 standard for animated mesh compression. In ICIP, pages 2676-2679.
  11. Marpe, D., Schwarz, H., Blttermann, G., Heising, G., and Wieg, T. (2003). Context-based adaptive binary arithmetic coding in the h.264/avc video compression standard. IEEE Transactions on Circuits and Systems for Video Technology, 13:620-636.
  12. Müller, K., Smolic, A., Kautzner, M., Eisert, P., and Wiegand, T. (2005). Predictive compression of dynamic 3d meshes. In ICIP (1), pages 621-624.
  13. Rossignac, J. (1999). Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 5:47-61.
  14. Rus, J. and Vás?a, L. (2010). Analysing the influence of vertex clustering on pca-based dynamic mesh compression. In Articulated Motion and Deformable Objects, pages 55-66, Heidelberg. Springer.
  15. Sattler, M., Sarlette, R., and Klein, R. (2005). Simple and efficient compression of animation sequences. In SCA 7805: Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation, pages 209-217. ACM Press.
  16. Vás?a, L. and Skala, V. (2007). Coddyac: connectivity driven dynamic mesh compression. In 3DTV-CON 2007, pages 1-4, Piscataway. IEEE.
  17. Vás?a, L. and Skala, V. (2009). Cobra: Compression of the basis for pca represented animations. Computer Graphics forum, 28(6):1529-1540.
  18. Vás?a, L. and Skala, V. (2011). A perception correlated comparison method for dynamic meshes. IEEE Transactions on Visualization and Computer Graphics, 17(2):220-230.
  19. Wang, Z., Bovik, A. C., Sheikh, H. R., and Simoncelli, E. P. (2004). Image quality assessment: From error visibility to structural similarity. IEEE Transactions on Image Processing, 13(4):600-612.
  20. Zhang, J. and Owen, C. B. (2004). Octree-based animated geometry compression. In Data Compression Conference'04, pages 508-520.
Download


Paper Citation


in Harvard Style

Rus J. and Váša L. (2012). DEBLOCKING FOR DYNAMIC TRIANGLE MESHES . In Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012) ISBN 978-989-8565-02-0, pages 48-57. DOI: 10.5220/0003829700480057


in Bibtex Style

@conference{grapp12,
author={Jan Rus and Libor Váša},
title={DEBLOCKING FOR DYNAMIC TRIANGLE MESHES},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012)},
year={2012},
pages={48-57},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003829700480057},
isbn={978-989-8565-02-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012)
TI - DEBLOCKING FOR DYNAMIC TRIANGLE MESHES
SN - 978-989-8565-02-0
AU - Rus J.
AU - Váša L.
PY - 2012
SP - 48
EP - 57
DO - 10.5220/0003829700480057