부산대학교 도서관

In prediction error-based reversible data hiding, multiple histograms modification (MHM) is well known for high image quality and thus has received wide attention in recent years. However, the computational cost for performance optimization in MHM is too high, which is particularly critical for real-time applications. This manuscript aims to reduce the computational complexity of MHM by presenting two techniques, including fast performance optimization and adaptive pixel distribution. Fast performance optimization provides a two-stage process for optimal bin selection by exploiting the concept of per-bit distortion of data embedding within a prediction error histogram (PEH). In fast performance optimization, the distribution characteristics of the per-bit distortion are investigated to significantly narrow down the solution space of optimal bin selection. The second technique is adaptive pixel distribution, which tries to nonuniformly allocate pixels into multiple PEHs to further reduce the time complexity. Extensive experiments show that the computational complexity of MHM is significantly reduced while well preserving the image quality. [ABSTRACT FROM AUTHOR]