# Three-dimensional image quality measurement for the benchmarking of 3D watermarking schemes

@inproceedings{RondaoAlface2005ThreedimensionalIQ, title={Three-dimensional image quality measurement for the benchmarking of 3D watermarking schemes}, author={Patrice Rondao-Alface and Mathieu De Craene and Benoit M. Macq}, booktitle={IS\&T/SPIE Electronic Imaging}, year={2005} }

Three-dimensional image quality assessment causes new challenges for a wide set of applications and particularly for emerging 3-D watermarking schemes. First, new metrics have to be drawn for the distortion measurement from an original 3-D surface to its deformed version: this metric is necessary to address distortions that are acceptable and to which a 3-D watermarking algorithm should resist. In this paper, we focus on distortion energy evaluation extending works on distortion minimization…

## 19 Citations

### Perceptually driven 3D distance metrics with application to watermarking

- Computer ScienceSPIE Optics + Photonics
- 2006

An objective structural distortion measure which reflects the visual similarity between 3D meshes and thus can be used for quality assessment and its strong correlation with subjective ratings is presented.

### Robust and blind 3D watermarking

- Computer Science
- 2006

The algorithms proposed in this thesis significantly improve the visual quality of the watermarked object while the watermark detection robustness is at a relatively low level and the robustness of the proposed methods is decreasing.

### A Comprehensive Survey on Three-Dimensional Mesh Watermarking

- Computer ScienceIEEE Transactions on Multimedia
- 2008

This paper gives a comprehensive survey on 3-D mesh watermarking, which is considered an effective solution to the above two emerging problems.

### No-reference color-depth quality measure: CDME

- Computer ScienceCommercial + Scientific Sensing and Imaging
- 2018

A novel no-reference based depth image measure is proposed and further fuses this measure with an extended color quality metric that has no constraint on the 3D images being compared and demonstrates a very high correlation with the human judgment.

### A roughness measure for 3D mesh visual masking

- Computer ScienceAPGV
- 2007

The notion of roughness for a 3D mesh is introduced, as a local measure of geometric noise on the surface, which is based on curvature analysis on local windows of the mesh and is independent of the resolution/connectivity of the object.

### A local roughness measure for 3D meshes and its application to visual masking

- Computer ScienceTAP
- 2009

An algorithm for estimating the roughness of a 3D mesh, as a local measure of geometric noise on the surface is introduced, which is based on curvature analysis on local windows of the mesh and is independent of the resolution/connectivity of the object.

### A scheme of digital watermarking for 3-D models using correlation method in polar coordinate system

- Computer Science2010 International Symposium On Information Theory & Its Applications
- 2010

The experimental results for some test models show that the watermark information in each model can be detected by the proposed scheme even when the watermarked models are subjected to attack such as random noise addition.

### A Comprehensive Survey on Three-Dimensional

- Computer Science
- 2008

This paper gives a comprehensive survey on 3-D mesh watermarking, which is considered an effective solution to the above two emerging problems.

### Watermarking 3D models using spectral mesh compression

- Computer ScienceSignal Image Video Process.
- 2009

Improved performance and robustness against the most common attacks including the geometric transformations, adaptive random noise, mesh smoothing, mesh cropping, and combinations of these attacks are shown.

### Applying 3D Polygonal Mesh Watermarking for Transmission Security Protection through Sensor Networks

- Computer Science
- 2014

The proposed blind watermarking algorithm is proposed to protect the transmission security of 3D polygonal meshes through sensor networks and can achieve robustness against the cropping attack both theoretically and experimentally.

## References

SHOWING 1-10 OF 22 REFERENCES

### Texture-based watermarking of 3D video objects

- Computer ScienceIEEE Trans. Circuits Syst. Video Technol.
- 2003

This work describes a novel framework for watermarking three-dimensional (3D) video objects via their texture information, to retrieve information originally hidden in the textured image of the object from resulting images or videos having used the 3D synthetic object, thus protecting the visual representations of theobject.

### Robust and fast modeling of 3D natural objects from multiple views

- Computer ScienceElectronic Imaging
- 1994

An algorithm for the robust and fast automatic construction of a 3D model of any real object using images from multiple views is presented, ensuring a computational complexity proportional to the size of the real object surface and enabling a fast and simple construction of the volume model.

### Intrinsic Parameterizations of Surface Meshes

- Computer ScienceComput. Graph. Forum
- 2002

This paper presents new theoretical and practical results on the parameterization of triangulated surface patches and proposes robust, efficient and tunable tools to obtain least‐distorted parameterizations automatically.

### Image-driven simplification

- Computer ScienceTOGS
- 2000

We introduce the notion of image-driven simplification, a framework that uses images to decide which portions of a model to simplify. This is a departure from approaches that make polygonal…

### Alignment by Maximization of Mutual Information

- Computer ScienceProceedings of IEEE International Conference on Computer Vision
- 1995

A new information-theoretic approach is presented for finding the pose of an object in an image that works well in domains where edge or gradient-magnitude based methods have difficulty, yet it is more robust than traditional correlation.

### Inter-surface mapping

- Computer ScienceACM Trans. Graph.
- 2004

This work directly creates and optimize a continuous map between two arbitrary triangle meshes, and obtains better parametrizations than with previous specialized techniques, thanks to the fine-grain optimization.

### Discrete differential error metric for surface simplification

- Computer Science10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings.
- 2002

A new error metric based on the theory of local differential geometry in such a way that the first and the second order discrete differentials approximated locally on a discrete polygonal surface are integrated into the usual distance error metric.

### Quadric-Based Polygonal Surface Simplification

- Computer Science
- 1999

This dissertation presents a simplification algorithm, based on iterative vertex pair contraction, that can simplify both the geometry and topology of manifold as well as non-manifold surfaces, and proves a direct mathematical connection between the quadric metric and surface curvature.

### Mesh reduction with error control

- Computer ScienceProceedings of Seventh Annual IEEE Visualization '96
- 1996

This work presents a new algorithm to reduce the number of triangles of a mesh without exceeding a user defined Hausdorff distance between the original and simplified mesh, which allows one to generate a hierarchical geometric representation in a canonical way and automatically preserves sharp edges.

### Texture mapping progressive meshes

- Computer ScienceSIGGRAPH
- 2001

This work presents a method to construct a progressive mesh (PM) such that all meshes in the PM sequence share a common texture parametrization, and demonstrates using such atlases to sample color and normal maps over several models.