Minority codes with improved embedding efficiency for large payloads

  • Authors:
  • Hongmei Liu;Xinzhi Yao;Jiwu Huang

  • Affiliations:
  • Department of Electronics and Communication, Sun Yat-sen University, Guangzhou, People's Republic of China 510275;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong SAR, China;Department of Electronics and Communication, Sun Yat-sen University, Guangzhou, People's Republic of China 510275

  • Venue:
  • Multimedia Tools and Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Improving embedding efficiency is important for watermarking with large payloads. In this paper, we propose a coding scheme named Minority codes by observing the relationship between the populations and positions of the binary bits in a sequence whose length is an odd number. In such a sequence, there is always a bit value, whose population is minority. We observe that the positions of the minority bit in two complement sequences are the same. By using this property, we create Minority codes whose codebook is composed of a pair of complement sequences for each entry. Minority codes can be combined with watermarking algorithms to improve embedding efficiency, because we can always identify the codeword that causes fewer embedding changes according to the host image and the watermarking method. The performance of Minority codes is analyzed theoretically and supported experimentally. The complexity of Minority codes is quite low and suitable for large payloads.