The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Novos métodos para marca d'água de imagens digitais baseados nas características de quantização vetorial (VQ) são propostos. Em contraste com os algoritmos convencionais de incorporação de marcas d'água para incorporar apenas uma marca d'água por vez na fonte original, apresentamos um algoritmo para incorporar múltiplas marcas d'água para proteção de direitos autorais. Os processos de incorporação e extração são eficientes para implementação com técnicas convencionais de VQ e podem ser realizados em paralelo para reduzir o tempo de processamento. Após a incorporação, o incorporador geraria uma imagem de reconstrução com marca d'água e várias chaves secretas associadas às marcas d'água incorporadas. Essas chaves secretas são então registradas em nome de terceiros para preservar a propriedade da fonte original, a fim de evitar que os invasores insiram marcas d'água falsificadas. Os resultados da simulação mostram que, sob nenhum ataque, as marcas d'água incorporadas poderiam ser extraídas perfeitamente. Se houver alguns ataques intencionais em nossa simulação, todas as marcas d'água poderão sobreviver para proteger os direitos autorais. Portanto, podemos afirmar a robustez, utilidade e facilidade de implementação do nosso algoritmo.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Hsiang-Cheh HUANG, Feng-Hsing WANG, Jeng-Shyang PAN, "A VQ-Based Robust Multi-Watermarking Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 7, pp. 1719-1726, July 2002, doi: .
Abstract: New methods for digital image watermarking based on the characteristics of vector quantization (VQ) are proposed. In contrast with conventional watermark embedding algorithms to embed only one watermark at a time into the original source, we present one algorithm to embed multiple watermarks for copyright protection. The embedding and extraction processes are efficient for implementing with conventional VQ techniques, and they can be accomplished in parallel to shorten the processing time. After embedding, embedder would output one watermarked reconstruction image and several secret keys associated with the embedded watermarks. These secret keys are then registered to the third party to preserve the ownership of the original source in order to prevent the attackers from inserting counterfeit watermarks. Simulation results show that under no attacks, the embedded watermarks could be perfectly extracted. If there are some intentional attacks in our simulation, all the watermarks could survive to protect the copyrights. Therefore, we are able to claim the robustness, usefulness, and ease of implementation of our algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_7_1719/_p
Copiar
@ARTICLE{e85-a_7_1719,
author={Hsiang-Cheh HUANG, Feng-Hsing WANG, Jeng-Shyang PAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A VQ-Based Robust Multi-Watermarking Algorithm},
year={2002},
volume={E85-A},
number={7},
pages={1719-1726},
abstract={New methods for digital image watermarking based on the characteristics of vector quantization (VQ) are proposed. In contrast with conventional watermark embedding algorithms to embed only one watermark at a time into the original source, we present one algorithm to embed multiple watermarks for copyright protection. The embedding and extraction processes are efficient for implementing with conventional VQ techniques, and they can be accomplished in parallel to shorten the processing time. After embedding, embedder would output one watermarked reconstruction image and several secret keys associated with the embedded watermarks. These secret keys are then registered to the third party to preserve the ownership of the original source in order to prevent the attackers from inserting counterfeit watermarks. Simulation results show that under no attacks, the embedded watermarks could be perfectly extracted. If there are some intentional attacks in our simulation, all the watermarks could survive to protect the copyrights. Therefore, we are able to claim the robustness, usefulness, and ease of implementation of our algorithm.},
keywords={},
doi={},
ISSN={},
month={July},}
Copiar
TY - JOUR
TI - A VQ-Based Robust Multi-Watermarking Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1719
EP - 1726
AU - Hsiang-Cheh HUANG
AU - Feng-Hsing WANG
AU - Jeng-Shyang PAN
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2002
AB - New methods for digital image watermarking based on the characteristics of vector quantization (VQ) are proposed. In contrast with conventional watermark embedding algorithms to embed only one watermark at a time into the original source, we present one algorithm to embed multiple watermarks for copyright protection. The embedding and extraction processes are efficient for implementing with conventional VQ techniques, and they can be accomplished in parallel to shorten the processing time. After embedding, embedder would output one watermarked reconstruction image and several secret keys associated with the embedded watermarks. These secret keys are then registered to the third party to preserve the ownership of the original source in order to prevent the attackers from inserting counterfeit watermarks. Simulation results show that under no attacks, the embedded watermarks could be perfectly extracted. If there are some intentional attacks in our simulation, all the watermarks could survive to protect the copyrights. Therefore, we are able to claim the robustness, usefulness, and ease of implementation of our algorithm.
ER -