{'fraction_non_alphanumeric': 0.031278748850046, 'fraction_numerical': 0.0018399264029438822, 'mean_word_length': 5.112359550561798, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Data hiding using adaptive LSB and PVD technique resisting PDH and RS analysis

This paper proposes an improved data hiding technique using the principle of least significant bit (LSB) substitution and pixel value differencing (PVD). It addresses two issues: 1) the error block problem (EBP); 2) the fall of boundary problem (FOBP). The image is divided into non-overlapping blocks of two consecutive pixels. The blocks are divided into three levels depending upon the pixel value difference. The level of the block and the pixel difference range decides the hiding capacity of a block. The proposed technique has been compared with related existing techniques in terms of parameters like peak signal to noise ratio (PSNR), quality index (Q), hiding capacity, bits per pixel (BPP), and the count of the blocks suffering from FOBP. The experimental results prove that the proposed technique offers better PSNR and hiding capacity as compared to the related existing techniques. Furthermore, the proposed technique is resistant to pixel difference histogram (PDH) analysis and RS analysis.