Zobrazit v EDS

Matrix embedding in steganography with binary Reed–Muller codes.

Uloženo v:
Podrobná bibliografie
Název: Matrix embedding in steganography with binary Reed–Muller codes.
Autoři: Yang, Tingya, Chen, Houshou
Zdroj: IET Image Processing (Wiley-Blackwell); Jul2017, Vol. 11 Issue 7, p522-529, 8p
Témata: BLOCK codes, BINARY codes, LINEAR codes, TWO-dimensional bar codes, CRYPTOGRAPHY, DECODING algorithms
Abstrakt: This study presents a modified majority‐logic decoding algorithm of Reed–Muller (RM) codes for matrix embedding (ME) in steganography. An ME algorithm uses linear block code to improve the embedding efficiency in steganography. The optimal embedding algorithm in steganography is equivalent to the maximum likelihood decoding (MLD) algorithm in error‐correcting codes. The main disadvantage of ME is that the equivalent MLD algorithm of lengthy embedding codes requires highly complex embedding. This study used RM codes to embed data in binary host images. The authors propose a novel low‐complexity embedding algorithm that uses a modified majority‐logic algorithm to decode RM codes, in which a message‐passing algorithm (i.e. sum‐product, min‐sum, or bias propagation) is performed on the highest order of information bits in the RM codes. The experimental results indicate that integrating bias propagation into the proposed scheme achieves superior embedding efficiency (relative to when the sum‐product or min‐sum algorithm is used) and can even achieve the embedding bound of RM codes. [ABSTRACT FROM AUTHOR]
Copyright of IET Image Processing (Wiley-Blackwell) is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
Popis
Abstrakt:This study presents a modified majority‐logic decoding algorithm of Reed–Muller (RM) codes for matrix embedding (ME) in steganography. An ME algorithm uses linear block code to improve the embedding efficiency in steganography. The optimal embedding algorithm in steganography is equivalent to the maximum likelihood decoding (MLD) algorithm in error‐correcting codes. The main disadvantage of ME is that the equivalent MLD algorithm of lengthy embedding codes requires highly complex embedding. This study used RM codes to embed data in binary host images. The authors propose a novel low‐complexity embedding algorithm that uses a modified majority‐logic algorithm to decode RM codes, in which a message‐passing algorithm (i.e. sum‐product, min‐sum, or bias propagation) is performed on the highest order of information bits in the RM codes. The experimental results indicate that integrating bias propagation into the proposed scheme achieves superior embedding efficiency (relative to when the sum‐product or min‐sum algorithm is used) and can even achieve the embedding bound of RM codes. [ABSTRACT FROM AUTHOR]
ISSN:17519659
DOI:10.1049/iet-ipr.2016.0655