Patch-Level Selection and Breadth-First Prediction Strategy for Reversible Data Hiding

A core work in reversible data hiding is designing an embedding method enabling the hider to take advantages of smooth elements as many as possible while the detection procedure for marked elements is invertible to the receiver. It motivates us to introduce a novel patch-level selection and breadth-first prediction strategy for efficient reversible data hiding. However, different from conventional works, the proposed work allows us to preferentially and simultaneously use adjacent smooth elements as many as possible. Experiments show that it significantly outperforms a part of state-of-the-arts at relatively low embedding rates, demonstrating the superiority.