Publications – Details
High Rate Data Hiding in ACELP Speech Codecs
- Authors:
- Bernd Geiser and Peter Vary
- Book Title:
- Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
- Venue:
- Las Vegas, NV, USA
- Organization:
- IEEE
- Date:
- Mar. 2008
- Pages:
- 4005–4008
- ISBN:
- 978-1-42441-483-3
- Language:
- English
Abstract
A new method for hiding digital data in the bitstream of an ACELP speech codec is proposed in this paper. The key element of our method is an alternative search strategy for the ACELP codebook which allows for joint data hiding and speech coding. The concept has been examplarily applied to the AMR speech codec (12.2 kbit/s mode) and it is shown that steganographic data can be reliably transmitted at a rate of up to 2 kbit/s both with a negligible effect on the subjective quality of the coded speech and with reasonable computational complexity. Apart from data hiding, it is further pointed out that our method can also be exploited to reduce the codec bit rate.
Audio Demo
|
1.8 M |
Explanation:
- Part 1 (0-10 sec):
AMR codec at 12.2 kbit/s - Part 2 (10-23 sec):
AMR codec at 12.2 kbit/s with 2kbit/s of hidden data - Part 3 (23-30 sec):
AMR codec at 12.2 kbit/s with 2kbit/s of hidden data, 1.65 kbit/s are used for bandwidth extension
Download of Publication
Copyright Notice
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
The following notice applies to all IEEE publications:
© IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.