Abstract
Prediction-error expansion (PEE) has been widely utilized in reversible data hiding (RDH) due to its advantage of high-quality marked image. Recently, a RDH method based on multiple histogram modification (MHM) has been proposed, achieving good performance at low capacity. However, its exhaustive expansion-bin-selection mechanism is time consuming, so that it can only choose a single pair of expansion bins in each histogram for embedding data. As an extension of MHM, a novel RDH scheme for high-capacity embedding is proposed in this paper. In the proposed method, multiple pairs of expansion bins are utilized in each histogram and a greedy search algorithm is designed to determine the nearly optimal expansion bins. The results of experiments demonstrate that the proposed scheme has real-time performance and high-quality marked image, and it outperforms the original MHM-based RDH method and some other state-of-the-art works.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
