An image-hiding method with high hiding capacity based on best-block matching and \(k\)-means clustering

DOI10.1016/J.PATCOG.2006.07.015zbMath1118.68185OpenAlexW2070800460MaRDI QIDQ854199

Yao-De Tsai, Ran-Zan Wang

Publication date: 7 December 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.07.015

zbMATH Keywords

image hiding\(k\)-means clusteringleast significant bitdata hidingsteganography

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)

Related Items (2)

A two-codebook combination and three-phase block matching based image-hiding scheme with high embedding capacity ⋮ VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches

Cites Work

• Unnamed Item
• Unnamed Item
• A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function.
• Hiding data in images by simple LSB substitution
• Lossless compression and information hiding in images
• A novel SVD- and VQ-based image hiding scheme
• A virtual image cryptosystem based upon vector quantization
• Image hiding by optimal LSB substitution and genetic algorithm

This page was built for publication: An image-hiding method with high hiding capacity based on best-block matching and \(k\)-means clustering