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.
Cite
CITATION STYLE
Brisbane, G., Safavi-Naini, R., & Ogunbona, P. (2002). An algorithm for data hiding using median cut segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2532, pp. 89–96). Springer Verlag. https://doi.org/10.1007/3-540-36228-2_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
