A novel edge based image steganography with 2ᵏ correction and Huffman encoding

DOI10.1016/J.IPL.2015.09.016zbMATH Open1400.94172OpenAlexW1923663304MaRDI QIDQ894446FDOQ894446

Authors: Shuliang Sun 

Publication date: 1 December 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.016

Recommendations

• A steganography algorithm based on image edge detection
• New LSB-based colour image steganography method to enhance the efficiency in payload capacity, security and integrity check
• A steganographic method for images by pixel-value differencing
• An image-hiding method with high hiding capacity based on best-block matching and \(k\)-means clustering
• Strong image steganography based on last significant bit substitution

zbMATH Keywords

cryptographyCanny edge detector\(2^k\) correctioncoherent bit lengthHuffman table

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

Cites Work

• Hiding data in images by simple LSB substitution
• A Method for the Construction of Minimum-Redundancy Codes
• Title not available (Why is that?)

Cited In (6)

• Using M-ary decomposition and virtual bits for visually meaningful image encryption
• Graph crypto-stego system for securing graph data using association schemes
• A steganography algorithm based on image edge detection
• Graph Crypto-Stego system for securing graph data using association schemes
• Improved reference image encryption methods based on \(2^k\) correction in the integer wavelet domain
• Visually meaningful image encryption based on universal embedding model

This page was built for publication: A novel edge based image steganography with \(2^k\) correction and Huffman encoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894446)