An Algorithm for Data Hiding Using Median Cut Segmentation

Authors:
Gareth Brisbane;Reihaneh Safavi-Naini;Philip Ogunbona
Affiliations:
-;-;-
Venue:
PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Year:
2002

Citing 5
Cited 0

Modulation and Information Hiding in Images

Proceedings of the First International Workshop on Information Hiding
Hiding Information in Color Images Using Small Color Palettes

ISW '00 Proceedings of the Third International Workshop on Information Security
Region-Based Watermarking by Distribution Adjustment

ISW '00 Proceedings of the Third International Workshop on Information Security
Color image quantization for frame buffer display

SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Region-based image watermarking

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

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.