Abstract
We extend the method proposed by Seppanen et al. in [1] by replacing the k-means algorithm with the median cut algorithm. The median cut algorithm has superior data hiding qualities due to its prismic nature even though the palette is sub-optimal. In addition, considerable savings on computation time are made. The presence of the median cut algorithm in image processing packages implies that this algorithm becomes a simple and integrable tool for steganographic communication.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tapio Seppanen, Kaisu Makela, Anja Keskinarkaus: Hiding information in color images using small color palettes. Information Security, Third International Workshop (2000) 69–81
Fabien A. P. Petitcolas, Ross J. Anderson, Markus G. Kuhn: Information hiding-a survey. Proceedings of the IEEE (1999), vol. 87, no. 7 1062–1078
Gustavus J. Simmons: The prisoners’ problem and the subliminal channel. Advances in Cryptology (1984), Proceedings of CRYPTO 83, 51–67
M. Kutter, S. Bhattacharjee, T. Ebrahimi: Towards second generation watermarking schemes. Proceedings of the 6th International Conference on Image Processing (1999), vol. 3, 320–323
Gareth Brisbane, Rei Safavi-Naini, Philip Ogunbona: Region-based watermarking by distribution adjustment. Information Security, Third International Workshop (2000) 54–68
Athanasios Nikolaidis, Ioannis Pitas: Region-based image watermarking. IEEE Transactions on Image Processing (2001) 1726–1740
Paul Heckbert: Color image quantization for frame buffer display. Computer Graphics (1982) 297–303
Joshua R. Smith, Barrett O. Comiskey: Modulation and information hiding in images. Workshop on Information Hiding (1996), Isaac Newton Institute, University of Cambridge, vol. 1174
R. G. van Schyndel, A. Z. Tirkel, C. F. Osborne: A Digital Watermark. Proceedings of the 1994 International Conference on Image Processing (1994) 86–90
J. H. Conway, N. J. A. Sloane: Voronoi regions of lattices, second moments of polytopes, and quantization. IEEE Transactions of Information Theory (1982), vol. IT–28, no. 2, 211–226
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brisbane, G., Safavi-Naini, R., Ogunbona, P. (2002). An Algorithm for Data Hiding Using Median Cut Segmentation. In: Chen, YC., Chang, LW., Hsu, CT. (eds) Advances in Multimedia Information Processing — PCM 2002. PCM 2002. Lecture Notes in Computer Science, vol 2532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36228-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-36228-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00262-8
Online ISBN: 978-3-540-36228-9
eBook Packages: Springer Book Archive