Abstract

This paper presents a reversible data hiding scheme for digital audio by using noncausal prediction of alterable orders. Firstly, the samples in a host signal are divided into the cross and the dot sets. Then, each sample in a set is estimated by using the past P samples and the future Q samples as prediction context. The order P + Q and the prediction coefficients are computed by referring to the minimum error power method. With the proposed predictor, the prediction errors can be efficiently reduced for different types of audio files. Comparing with the existing several state-of-the-art schemes, the proposed prediction model with expansion embedding technique introduces less embedding distortion for the same embedding capacity. The experiments on the standard audio files verify the effectiveness of the proposed method.

Highlights

  • Reversible data hiding technique is used for embedding data in a host signal and the host signal can be completely recovered [1]

  • Among all the minimum error power values, the smallest one is corresponding to the order and the prediction coefficients used for reversible data hiding

  • We can see that different audio clip have different K1

Read more

Summary

Introduction

Reversible data hiding technique is used for embedding data in a host signal and the host signal can be completely recovered [1]. For exploring the correlation of the neighbor pixels/samples adequately, in [21], a non-integer prediction error expansion embedding method was proposed. Comparing with existing reversible audio data hiding methods, the proposed one has lower distortion at the same embedding rate.

Results
Conclusion

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 call

Disclaimer: 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.