A suboptimal embedding algorithm with low complexity for binary data hiding

A novel suboptimal hiding algorithm for binary data based on weight approximation embedding, WAE, is proposed. Given a specified embedding rate, this algorithm exhibits an advantage of efficient binary embedding with reduced embedding complexity. The suboptimal WAE algorithm performs an embedding pr...

Full description

Saved in:
Bibliographic Details
Published in:2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) pp. 1789 - 1792
Main Authors: Jyun-Jie Wang, Houshou Chen
Format: Conference Proceeding
Language:English
Published: IEEE 01.03.2012
Subjects:
Algorithm design and analysis
Approximation algorithms
Complexity theory
Linear code
Maximum likelihood decoding
Parity check codes
Vectors
ISBN:1467300454, 9781467300452
ISSN:1520-6149
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A novel suboptimal hiding algorithm for binary data based on weight approximation embedding, WAE, is proposed. Given a specified embedding rate, this algorithm exhibits an advantage of efficient binary embedding with reduced embedding complexity. The suboptimal WAE algorithm performs an embedding procedure through a parity check matrix. The optimal embedding based on maximal likelihood algorithm aims to locate the coset leader to minimize the embedding distortion. On the contrary, the WAE algorithm looks for a target vector close to the coset leader in an efficiently iterative manner. Given an linear embedding code C(n, k), the embedding complexity using the optimal algorithm is O(2 k ), while the complexity in the suboptimal WAE is reduced to O(sk) where s is the average iterations.
ISBN:1467300454
9781467300452
ISSN:1520-6149
DOI:10.1109/ICASSP.2012.6288247