Chapter

Intelligent Information and Database Systems

Volume 7197 of the series Lecture Notes in Computer Science pp 234-244

On Fastest Optimal Parity Assignments in Palette Images

  • Phan Trung HuyAffiliated withCarnegie Mellon UniversityHanoi University of Science and Technology
  • , Nguyen Hai ThanhAffiliated withCarnegie Mellon UniversityMinistry of Education and Training
  • , Tran Manh ThangAffiliated withCarnegie Mellon UniversityHanoi University of Science and Technology
  • , Nguyen Tien DatAffiliated withCarnegie Mellon UniversityHanoi University of Science and Technology

* Final gross prices may vary according to local VAT.

Get Access

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.

Keywords

palette image steganography rho-method fastest OPA enhanced CPT scheme