On Fastest Optimal Parity Assignments in Palette Images

  • Phan Trung Huy
  • Nguyen Hai Thanh
  • Tran Manh Thang
  • Nguyen Tien Dat
Conference paper

DOI: 10.1007/978-3-642-28490-8_25

Volume 7197 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Huy P.T., Thanh N.H., Thang T.M., Dat N.T. (2012) On Fastest Optimal Parity Assignments in Palette Images. In: Pan JS., Chen SM., Nguyen N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science, vol 7197. Springer, Berlin, Heidelberg

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Phan Trung Huy
    • 1
  • Nguyen Hai Thanh
    • 2
  • Tran Manh Thang
    • 1
  • Nguyen Tien Dat
    • 1
  1. 1.Hanoi University of Science and TechnologyVietnam
  2. 2.Ministry of Education and TrainingVietnam