Bit-plane complexity segmentation (BPCS) steganography is advantageous in its capacity and imperceptibility.The important step\nof BPCS steganography is how to locate noisy regions in a cover image exactly. The regular method, black-and-white border\ncomplexity, is a simple and easy way, but it is not always useful, especially for periodical patterns. Run-length irregularity and\nborder noisiness are introduced in this paper to work out this problem. Canonical Cray coding (CGC) is also used to replace\npure binary coding (PBC), because CGC makes use of characteristic of human vision system. Conjugation operation is applied\nto convert simple blocks into complex ones. In order to contradict BPCS steganalysis, improved BPCS steganography algorithm\nadopted different bit-planes with different complexity. The higher the bit-plane is, the smaller the complexity is. It is proven that\nthe improved BPCS steganography is superior to BPCS steganography by experiment.
Loading....