Lossless data hiding for binary document images using n-pairs pattern

Abstract

Lossless data embedding theory has entered a new era for data hiding and information security. In a lossless scheme, the original data and the embedded data should be completely recoverable. Our n-pairs pattern method is a significant advance in lossless data hiding schemes. This paper shows that the proposed n-pairs pattern method can achieve greater embedding capacity while keeping distortion at the same level as the PS-K method (Pattern Substitution by pseudo random number generator to produce a key K). The performance of the n-pairs pattern method is thus shown to be better than the performance of PS-K.