Reversible Data Hiding with Difference Modification and Rhombus Relationships in Quadtree Decomposition

Digital watermarking has been an effective means for copyright protection and digital rights management (DRM). One of the current trends for researches in this field would focus on reversible data hiding. Considering the ease of implementation and employing the inherent characteristics of original images, we propose our reversible data hiding algorithm with the rhombus relationships of original pixels with a much increased embedding capacity. Only the smooth regions after quad tree decomposition are selected for data embedding. Simulation results with our algorithm have demonstrated the superiority over existing ones in embedding capacity and side information needed for decoding.