Publikation: Efficient Data Hiding with High Payload
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2011
Autor:innen
Zhang, Xinpeng
Qian, Zhenxing
Li, Fengyong
Feng, Guorui
Ren, Yanli
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
2011 Third International Conference on Multimedia Information Networking and Security. IEEE, 2011, pp. 318-321. ISBN 978-1-4577-1795-6. Available under: doi: 10.1109/MINES.2011.24
Zusammenfassung
Good rate-distortion performance is desired in data hiding, and the theoretical bounds are dependent on the range of allowable modifications made on cover samples. This work proposes a novel data-hiding scheme suitable for various modification ranges, and a family of data-hiding methods with different embedding rates and distortion levels can be generated. In the scheme, the secret digits are represented as a summation of vectors derived from cover samples in a shift manner. By introducing a trellis construction, the distortions of the possible sample-value sequences that can represent the secret data are calculated and only the sequence with the lowest distortion is selected as a new cover. It is shown the rate-distortion performance approaches the theoretical bounds with high embedding rate.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
2011 3rd International Conference on Multimedia Information Networking and Security (MINES), 4. Nov. 2011 - 6. Nov. 2011, Shanghai, China
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
ZHANG, Xinpeng, Zhenxing QIAN, Fengyong LI, Guorui FENG, Yanli REN, 2011. Efficient Data Hiding with High Payload. 2011 3rd International Conference on Multimedia Information Networking and Security (MINES). Shanghai, China, 4. Nov. 2011 - 6. Nov. 2011. In: 2011 Third International Conference on Multimedia Information Networking and Security. IEEE, 2011, pp. 318-321. ISBN 978-1-4577-1795-6. Available under: doi: 10.1109/MINES.2011.24BibTex
@inproceedings{Zhang2011-11Effic-22501,
year={2011},
doi={10.1109/MINES.2011.24},
title={Efficient Data Hiding with High Payload},
url={http://dx.doi.org/ 10.1109/MINES.2011.24},
isbn={978-1-4577-1795-6},
publisher={IEEE},
booktitle={2011 Third International Conference on Multimedia Information Networking and Security},
pages={318--321},
author={Zhang, Xinpeng and Qian, Zhenxing and Li, Fengyong and Feng, Guorui and Ren, Yanli}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/22501">
<dcterms:bibliographicCitation>Third International Conference on Multimedia Information Networking and Security (MINES), 2011 : 4 - 6 Nov. 2011, Shanghai, China ; proceedings ; [including workshop papers] / co-sponsored by Shanghai University ... - Piscataway, NJ : IEEE, 2011. - S. 318-321. - ISBN 978-1-4577-1795-6</dcterms:bibliographicCitation>
<dc:contributor>Li, Fengyong</dc:contributor>
<dc:rights>terms-of-use</dc:rights>
<dcterms:abstract xml:lang="eng">Good rate-distortion performance is desired in data hiding, and the theoretical bounds are dependent on the range of allowable modifications made on cover samples. This work proposes a novel data-hiding scheme suitable for various modification ranges, and a family of data-hiding methods with different embedding rates and distortion levels can be generated. In the scheme, the secret digits are represented as a summation of vectors derived from cover samples in a shift manner. By introducing a trellis construction, the distortions of the possible sample-value sequences that can represent the secret data are calculated and only the sequence with the lowest distortion is selected as a new cover. It is shown the rate-distortion performance approaches the theoretical bounds with high embedding rate.</dcterms:abstract>
<dc:creator>Li, Fengyong</dc:creator>
<dc:contributor>Feng, Guorui</dc:contributor>
<dc:creator>Qian, Zhenxing</dc:creator>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Ren, Yanli</dc:contributor>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:contributor>Qian, Zhenxing</dc:contributor>
<dc:creator>Ren, Yanli</dc:creator>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-05-08T14:39:57Z</dc:date>
<dc:language>eng</dc:language>
<dc:contributor>Zhang, Xinpeng</dc:contributor>
<dc:creator>Feng, Guorui</dc:creator>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-05-08T14:39:57Z</dcterms:available>
<dcterms:issued>2011-11</dcterms:issued>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22501"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dcterms:title>Efficient Data Hiding with High Payload</dcterms:title>
<dc:creator>Zhang, Xinpeng</dc:creator>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
</rdf:Description>
</rdf:RDF>
