Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xavier Rolland-Nevière

dblp:133/0587 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorSecurity and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Digital forensics and information hiding · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › watermarking
3d mesh watermarking
0.212014
Triangle Surface Mesh Watermarking Based on a Constrained Optimization Framework · IEEE Trans. Inf. Forensics Secur. 2014
Digital forensics and information hiding
information hiding
0.212014
Triangle Surface Mesh Watermarking Based on a Constrained Optimization Framework · IEEE Trans. Inf. Forensics Secur. 2014
Geometric modeling and processing › mesh processing › surface mesh processing
triangle mesh processing
0.112014
Triangle Surface Mesh Watermarking Based on a Constrained Optimization Framework · IEEE Trans. Inf. Forensics Secur. 2014

Methods — techniques the papers use, named apart from their topics

quadratic programming · 0.4constrained optimization · 0.4
YearPublicationVenuePosition
2015 Anti-cropping blind resynchronization for 3D watermarking
abstract
Radial-based 3D watermarking alters the distances between the center of mass of the 3D mesh and its vertices. These watermarking systems are inherently sensitive to cropping. To address this limitation, this paper introduces a complementary blind resynchronization module to transmit critical synchronization information to the watermark decoder. Spherical patterns formed by several secret landmark vertices are embedded alongside the payload and blindly retrieved by the decoder, thereby conveying the synchronization information needed. Experimental results showcase significant improvement against cropping, while preserving performances against valumetric attacks thanks to a control parameter that automatically switches between alternate resynchronization modes.
Xavier Rolland-Nevière, Gwenaël J. Doërr, Pierre Alliez
ICASSP1
2014 Spread transform and roughness-based shaping to improve 3D watermarking based on quadratic programming
abstract
Modulating the distances between the vertices and the center of mass of a triangular mesh is a popular approach to watermark 3D objects. Prior work has formulated this approach as a quadratic programming problem which minimizes the geometric distortion while embedding the watermark payload in the histogram of distances. To enhance this framework, we introduce two watermarking components, namely the spread transform and perceptual shaping based on roughness information. Benchmarking results showcase the benefits of these add-ons with respect to the fidelity-robustness trade-off.
Xavier Rolland-Nevière, Gwenaël J. Doërr, Pierre Alliez
ICIP1
2014 Triangle Surface Mesh Watermarking Based on a Constrained Optimization Framework
abstract
A watermarking strategy for triangle surface meshes consists of modifying the vertex positions along the radial directions, in order to adjust the distribution of radial distances and thereby encode the desired payload. To guarantee that watermark embedding does not alter the center of mass, prior work formulated this task as a quadratic programming problem. In this paper, we contribute to the generalization of this formulation with: 1) integral reference primitives; 2) arbitrary relocation directions to alter the vertex positions; and 3) alternate distortion metrics to minimize the perceptual impact of the embedding process. These variants are benchmarked against a range of attacks and we report both improved robustness performances, in particular for simplification attacks, and improved control over the embedding distortion.
Xavier Rolland-Nevière, Gwenaël J. Doërr, Pierre Alliez
IEEE Trans. Inf. Forensics Secur.1
2013 Robust diameter-based thickness estimation of 3D objects
Xavier Rolland-Nevière, Gwenaël J. Doërr, Pierre Alliez
Graph. Model.1