Abstract
It is well-known that least significant bit (LSB) matching is an excellent steganographic algorithm with advantages of high payload, good visual/statistical imperceptibility and extreme ease of implementation. However, some steganalyzers take advantage of the distortion of one-dimensional histogram of LSB matching and can, to some extent, perceive the covert message. Following Cachin's theory, this paper proposes an improvement on LSB matching by minimizing the distortion of first order statistics (i.e., one-dimensional histogram). The experiments confirm that the improvement makes the embedding procedure more secure than the conventional LSB matching.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
