Hiding Data in Binary Images Using Block-Diagonal Partition Pattern

J.Chhajed, Gyankamal; Garg, Bindu

doi:10.12785/ijcds/130176

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A 3x3 image block used to hide and extract groups of four bits of data using a decision tree technique [28,29]. A diagonal partition patterns analysis of a 3X3 image block to hide data [30,31]. Petri net modeling, which offers security and regulates user access to massive data databases to analyze the privacy issue [32].…”

Section: Related Workmentioning

confidence: 99%

“…The flip-scores greater than or equal to 0.125 were selected from literature [6] for data hiding from the range of calculated scores 0, 0.01, 0.125,0.25,0.375,0.625 considering all 512 patterns for 3X3 block. Similarly, patterns were considered for hiding data in [31]. The other schemes based on special pixel selection [13] and edge based grid pattern [32] are also compared, and it is identified that this method performs better, providing more data hiding capacity.…”

Section: Performance Analysismentioning

confidence: 99%

See 1 more Smart Citation

Novel Scheme for Data Hiding in Binary Images using Cover Pattern Histogram

Chhajed,

Garg

2023

IJE

View full text Add to dashboard Cite

In today's digital age, security and safe communication are necessities. Applications frequently transport large amounts of private data as binary images. This research proposes a unique scheme that uses a cover pattern histogram-based decision tree for information concealment and extraction from binary images. This research aims to provide a data-hiding approach with a large capacity for data concealment, possible minor distortion, security, and difficulty discovering hidden data. This method uses high-frequency 3X3 pixel block patterns to obscure data. The two series of pattern's are identified based on sorted block pattern frequency. To construct a decision tree for embedding, these series patterns, key bits, and information bits work together as parameters. Information is encrypted using a secret key to ensure message security before being hidden. A decision tree decides the block suitability and bit embedding with or without flipping at the sender side. A histogram of 3X3 pixel block patterns gets generated for the received image containing concealed data, and two series are recognized similarly to the embedding procedure at the receiver side. A decision tree assesses whether an image block carries an information bit and decides whether the bit is "0" or "1". This decision tree extracts hidden data bits by analyzing series patterns and key bits. The secret key decodes retrieved concealed bits and reveal the original data. According to research, 50-80 % of hidden bits are transmitted without flipping the pixels, automatically reducing visual distortion. This scheme performs better than comparable methods and is applicable in steganography and watermarking.

show abstract