An approach to adaptive steganography based on matrix embedding

dc.contributor.author Arjun, Santosh
dc.contributor.author Negi, Atul
dc.contributor.author Kranthi, Chaithanya
dc.contributor.author Keerthi, Divya
dc.date.accessioned 2022-03-27T05:53:37Z
dc.date.available 2022-03-27T05:53:37Z
dc.date.issued 2007-12-01
dc.description.abstract Steganography, ("covered writing" in Greek) is the science of communicating in a hidden manner. The main requirement for a steganographic scheme is visual imperceptibility and statistical undetectability. Steganographic techniques which exhibit these two qualities have lesser embedding capacity. So as to achieve statistical undetectability with higher embedding efficiency, matrix embedding is preferred. But the research done so far suggests use of matrix embedding for improving embedding efficiency for a given approach, but this comes' at the cost of decrease in embedding capacity. In this paper so as to alleviate this problem we propose an approach based on matrix embedding. This approach gives higher embedding capacity while giving higher embedding efficiency. We make use of Weber-Fechner law to make the proposed method visually imperceptible. We think that this approach highlights the need for new methods, especially based on matrix embedding. ©2007 IEEE.
dc.identifier.citation IEEE Region 10 Annual International Conference, Proceedings/TENCON
dc.identifier.uri 10.1109/TENCON.2007.4429120
dc.identifier.uri http://ieeexplore.ieee.org/document/4429120/
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/8645
dc.title An approach to adaptive steganography based on matrix embedding
dc.type Conference Proceeding. Conference Paper
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: