Results 161 to 170 of about 6,101 (212)
Rev Assoc Med Bras (1992)Some of the next articles are maybe not open access.
Related searches:
Related searches:
On LSB, LSB OPAP, and LSB OOPAP Published Experimental Results Correctness
Iranian Journal of Science and Technology - Transactions of Electrical Engineering, 2022Recently published (Ansari et al. Iran J Sci Technol Trans Electr Eng 43: 55-65, 2019) experimental results on k least-significant bit (k-LSB) substitution, k-LSB optimal pixel adjustment process (OPAP), and proposed adaptive to an image data-hiding method, k-bit Optimal OPAP (k-LSB OOPAP), do not comply with known to date results.
Alexander Chefranov
exaly +2 more sources
A Generalization of LSB Matching
IEEE Signal Processing Letters, 2009Recently, a significant improvement of the well-known least significant bit (LSB) matching steganography has been proposed, reducing the changes to the cover image for the same amount of embedded secret data. When the embedding rate is 1, this method decreases the expected number of modification per pixel (ENMPP) from 0.5 to 0.375.
Xiaolong Li, Tieyong Zeng
exaly +2 more sources
IEEE Signal Processing Letters, 2006
This letter proposes a modification to the least-significant-bit (LSB) matching, a steganographic method for embedding message bits into a still image. In the LSB matching, the choice of whether to add or subtract one from the cover image pixel is random.
exaly +2 more sources
This letter proposes a modification to the least-significant-bit (LSB) matching, a steganographic method for embedding message bits into a still image. In the LSB matching, the choice of whether to add or subtract one from the cover image pixel is random.
exaly +2 more sources
2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2010
In this paper, we propose a steganalysis algorithm to detect spatial domain least significant bit (LSB) matching steganography, which is much harder than the detection of LSB replacement. We use features based on histogram of run length and histogram characteristic function to detect the LSB Matching.
Xiao Yi Yu, Aiming Wang
openaire +1 more source
In this paper, we propose a steganalysis algorithm to detect spatial domain least significant bit (LSB) matching steganography, which is much harder than the detection of LSB replacement. We use features based on histogram of run length and histogram characteristic function to detect the LSB Matching.
Xiao Yi Yu, Aiming Wang
openaire +1 more source
International Journal of Security and Privacy in Pervasive Computing, 2022
The integrity and confidentiality of transmitted data are the main requirements of any data security system. To achieve these goals, many techniques have been developed, including cryptography and steganography. Recently, DNA-based steganography has emerged as a very powerful and promising approach to ensure the safety of sensitive information ...
Abdelkader Khobzaoui +2 more
openaire +1 more source
The integrity and confidentiality of transmitted data are the main requirements of any data security system. To achieve these goals, many techniques have been developed, including cryptography and steganography. Recently, DNA-based steganography has emerged as a very powerful and promising approach to ensure the safety of sensitive information ...
Abdelkader Khobzaoui +2 more
openaire +1 more source
Limited distortion in LSB steganography
SPIE Proceedings, 2006It is well known that all information hiding methods that modify the least significant bits introduce distortions into the cover objects. Those distortions have been utilized by steganalysis algorithms to detect that the objects had been modified. It has been proposed that only coefficients whose modification does not introduce large distortions should
Younhee Kim, Zoran Duric, Dana Richards
openaire +1 more source
IEEE Transactions on Communications, 1995
Summary: An 8PSK scheme with the least significant bit (LSB) Golay coded is proposed, and its performance is analyzed. With hard decision decoding, the proposed scheme can achieve 1 dB asymptotic coding gain and also save \(26\%\) bandwidth, as compared with uncoded QPSK scheme.
Jian Liu +2 more
openaire +1 more source
Summary: An 8PSK scheme with the least significant bit (LSB) Golay coded is proposed, and its performance is analyzed. With hard decision decoding, the proposed scheme can achieve 1 dB asymptotic coding gain and also save \(26\%\) bandwidth, as compared with uncoded QPSK scheme.
Jian Liu +2 more
openaire +1 more source