Efficient Data Hiding with High Payload

Kurzanzeige
dc.contributor.authorZhang, Xinpengdeu
dc.contributor.authorQian, Zhenxingdeu
dc.contributor.authorLi, Fengyongdeu
dc.contributor.authorFeng, Guoruideu
dc.contributor.authorRen, Yanlideu
dc.date.accessioned2013-05-08T14:39:57Zdeu
dc.date.available2013-05-08T14:39:57Zdeu
dc.date.issued2011-11
dc.description.abstractGood 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.eng
dc.description.versionpublished
dc.identifier.citationThird 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-6deu
dc.identifier.doi10.1109/MINES.2011.24
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/22501
dc.language.isoengdeu
dc.legacy.dateIssued2013-05-08deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subject.ddc004deu
dc.titleEfficient Data Hiding with High Payloadeng
dc.typeINPROCEEDINGSdeu
dspace.entity.typePublication
kops.citation.bibtex
@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}
}
kops.citation.iso690ZHANG, 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.24deu
kops.citation.iso690ZHANG, 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, Nov 4, 2011 - Nov 6, 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.24eng
kops.citation.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>
kops.conferencefield2011 3rd International Conference on Multimedia Information Networking and Security (MINES), 4. Nov. 2011 - 6. Nov. 2011, Shanghai, Chinadeu
kops.date.conferenceEnd2011-11-06
kops.date.conferenceStart2011-11-04
kops.identifier.nbnurn:nbn:de:bsz:352-225014deu
kops.location.conferenceShanghai, China
kops.sourcefield<i>2011 Third International Conference on Multimedia Information Networking and Security</i>. IEEE, 2011, pp. 318-321. ISBN 978-1-4577-1795-6. Available under: doi: 10.1109/MINES.2011.24deu
kops.sourcefield.plain2011 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.24deu
kops.sourcefield.plain2011 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.24eng
kops.submitter.emailingrid.baiker@uni-konstanz.dedeu
kops.title.conference2011 3rd International Conference on Multimedia Information Networking and Security (MINES)
kops.urlhttp://dx.doi.org/ 10.1109/MINES.2011.24deu
source.bibliographicInfo.fromPage318
source.bibliographicInfo.toPage321
source.identifier.isbn978-1-4577-1795-6
source.publisherIEEE
source.title2011 Third International Conference on Multimedia Information Networking and Security

Dateien

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
1.92 KB
Format:
Plain Text
Beschreibung:
license.txt
license.txtGröße: 1.92 KBDownloads: 0

Sammlungen

Informatik und Informationswissenschaft: Publikationen