Skip to main content
placeholder image

An algorithm for data hiding using median cut segmentation

Conference Paper


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.

Publication Date


  • 2002

Citation


  • 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). doi:10.1007/3-540-36228-2_12

Scopus Eid


  • 2-s2.0-84949935902

Start Page


  • 89

End Page


  • 96

Volume


  • 2532

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.

Publication Date


  • 2002

Citation


  • 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). doi:10.1007/3-540-36228-2_12

Scopus Eid


  • 2-s2.0-84949935902

Start Page


  • 89

End Page


  • 96

Volume


  • 2532