By Topic

A Reversible Data Hiding Scheme for 3D Point Cloud Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hao Luo ; Shenzhen Graduate Sch., Harbin Inst. of Technol., Shenzhen ; Zhe-Ming Lu ; Jeng-Shyang Pan

This paper proposes a reversible data hiding scheme for 3D point cloud model. The method exploits the high correlation among neighboring vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique in the integer DCT domain is employed to modulate the watermark bit. After that, the modified coefficients are inverse transformed into coordinates in the spatial domain. In data extraction, we need to recreate the modified clusters first, and other operations are the inverse process of the data hiding. The original model can be perfectly recovered using the clusters information if it is intact. This technique is suitable for some specific applications where content accuracy of the original model must be guaranteed. Moreover, the method can be easily extended to 3D point cloud model authentication

Published in:

Signal Processing and Information Technology, 2006 IEEE International Symposium on

Date of Conference:

Aug. 2006