On fastest optimal parity assignments in palette images

  • Authors:
  • Phan Trung Huy;Nguyen Hai Thanh;Tran Manh Thang;Nguyen Tien Dat

  • Affiliations:
  • Hanoi University of Science and Technology, Vietnam;Ministry of Education and Training, Vietnam;Hanoi University of Science and Technology, Vietnam;Hanoi University of Science and Technology, Vietnam

  • Venue:
  • ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

By Optimal Parity Assignment (OPA) approach for hiding secret data in palette images, we consider the fastest Optimal Parity Assignment (FOPA) methods which are OPA and do not take any extra reordering procedures on color space of palettes. We show that our rho-method is a FOPA and it is easily implemented for controlling quality of stego-images. As consequences, two algorithms for hiding data in palette images are presented. The first algorithm is taken on the rho-forest obtained by rho-method on a palette and the second is only on the colors which are not isolated (by distance not far from the others) in the palette. To prevent from steganalysis, by controlling high quality of stego palette images, combinations of FOPA method with enhanced CPT schemes for binary images are introduced. Some experimental results are presented.