A novel edge based image steganography with \(2^k\) correction and Huffman encoding

DOI10.1016/J.IPL.2015.09.016zbMath1400.94172OpenAlexW1923663304MaRDI QIDQ894446

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

Related Items (3)

Visually meaningful image encryption based on universal embedding model ⋮ Using M-ary decomposition and virtual bits for visually meaningful image encryption ⋮ Improved reference image encryption methods based on \(2^k\) correction in the integer wavelet domain

Cites Work

• Hiding data in images by simple LSB substitution
• A Method for the Construction of Minimum-Redundancy Codes
• Unnamed Item

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