TY - GEN
T1 - Geodesic distance-based pose-invariant blind watermarking algorithm for three-dimensional triangular mesh model
AU - Tsai, Jen Sheng
AU - Liao, Ming Chou
AU - Huang, Win Bin
AU - Kuo, Yau Hwang
PY - 2010
Y1 - 2010
N2 - Pose editing, changing the poses of three-dimensional (3D) mesh model, frequently results in de-synchronization effect which most 3D watermarking methods are sensitive to and normally regard it as an attack. A novel pose-invariant blind watermarking algorithm for 3D triangular mesh model is proposed in this paper to resist the pose changing attack. In this algorithm, the geodesic distance of each vertex pair on the 3D mesh model to be watermarked is calculated, and then this model is segmented into meaningful pose-invariant components based on the calculation result. Each meaningful component is further divided into non-overlapping cells according to the distribution of geodesic distances from its vertices to the cutting boundary. Finally the defined watermark is embedded into these cells by adjusting the mean value of geodesic distances in order to achieve the invariance of pose changing, and later detection follows the same concept. Our experimental result demonstrates that the proposed algorithm has the ability to resist the attacks of pose changing, similarity transformations, vertex reordering, local deformation, cropping, simplification, additive random noise, and smoothing.
AB - Pose editing, changing the poses of three-dimensional (3D) mesh model, frequently results in de-synchronization effect which most 3D watermarking methods are sensitive to and normally regard it as an attack. A novel pose-invariant blind watermarking algorithm for 3D triangular mesh model is proposed in this paper to resist the pose changing attack. In this algorithm, the geodesic distance of each vertex pair on the 3D mesh model to be watermarked is calculated, and then this model is segmented into meaningful pose-invariant components based on the calculation result. Each meaningful component is further divided into non-overlapping cells according to the distribution of geodesic distances from its vertices to the cutting boundary. Finally the defined watermark is embedded into these cells by adjusting the mean value of geodesic distances in order to achieve the invariance of pose changing, and later detection follows the same concept. Our experimental result demonstrates that the proposed algorithm has the ability to resist the attacks of pose changing, similarity transformations, vertex reordering, local deformation, cropping, simplification, additive random noise, and smoothing.
UR - http://www.scopus.com/inward/record.url?scp=78651061484&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651061484&partnerID=8YFLogxK
U2 - 10.1109/ICIP.2010.5652120
DO - 10.1109/ICIP.2010.5652120
M3 - Conference contribution
AN - SCOPUS:78651061484
SN - 9781424479948
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 209
EP - 212
BT - 2010 IEEE International Conference on Image Processing, ICIP 2010 - Proceedings
T2 - 2010 17th IEEE International Conference on Image Processing, ICIP 2010
Y2 - 26 September 2010 through 29 September 2010
ER -