scispace - formally typeset
Search or ask a question
Author

De Li

Bio: De Li is an academic researcher from Yanbian University. The author has contributed to research in topics: Digital watermarking & Watermark. The author has an hindex of 6, co-authored 21 publications receiving 77 citations.

Papers
More filters
01 Jan 2012
TL;DR: A robust, secure forensic marking algorithm was implemented using processes for generating holograms of 2D barcodes containing copyright information and embedding the holograms in the discrete wavelet transform- (DWT-) discrete fractional random transform (DFRNT) domain to ensure simultaneous robustness and security.
Abstract: In this study, a robust, secure forensic marking algorithm was implemented using processes for generating holograms of 2D barcodes containing copyright information and embedding the holograms in the discrete wavelet transform- (DWT-) discrete fractional random transform (DFRNT) domain. In the proposed algorithm, the off-axis holograms of the 2D barcodes in which information is hidden are robust against attacks and are embedded in the transformed domains of the original images. The DFRNT enhances security by randomly mixing information so that it is embedded in unpredictable positions in certain frequency spaces. Therefore, DFRNT was combined with DWT and then used as a dual domain to ensure simultaneous robustness and security. Different holograms were produced with little signal interference by changing the coordinate values and separation angles, thereby ensuring security as well as enabling the embedding of multiple holograms in one image. The algorithm was also designed so that bit errors occurring during detection could be corrected by the self-error correction function of 2D barcodes. Its robustness was examined in several experiments, including compression, noise addition, and rotation experiments. The detection bit errors for all 2D barcodes used in the experiments were less than 3%. This confirms that the algorithm can accurately extract hidden information from detected 2D barcodes.

19 citations

Journal ArticleDOI
TL;DR: A new zero-watermarking algorithm for color image based on tensor mode expansion that is robust to noise attacks and common image processing attacks, and better performances compared with some existing algorithms are also achieved.
Abstract: Digital zero-watermarking technology is an effective measure to protect image copyright, and many algorithms have been proposed based on zero-watermark. However, most of the existing zero-watermarking algorithms are designed for grayscale images. In this paper, a new zero-watermarking algorithm for color image based on tensor mode expansion is proposed. In the proposed scheme, four images of R, G, B, and gray are firstly generated from the original image. Then, the four images are appropriately combined to construct two three-dimensional tensors, and tensor expansion is performed on the obtained tensors. By performing singular value decomposition (SVD) and discrete cosine transform (DCT) on the expanded data, a feature image containing the main information of the host image can be generated. Finally, the feature image is fused with the specified logo image to obtain a zero-watermark image. Experimental results show that the proposed algorithm is robust to noise attacks and common image processing attacks, and better performances compared with some existing algorithms are also achieved. In addition, since the proposed algorithm is based on color images, it can make full use of all aspects of color images.

19 citations

Journal ArticleDOI
M. Kim1, De Li1, S. Hong
31 Jan 2014
TL;DR: This paper proposes a robust digital image watermarking algorithm based on the multiple transform method, discrete wavelet transform (DWT) and discrete fractional random transform (DFRNT), which adopts a two-dimensional barcode for hiding information and applies the block code encoding to generate a watermark through them.
Abstract: Copyright protection of digital content has become one of important issues in digital content marketplace. Digital watermarking may be used as an effective method for identifying the copyright ownership of digital content against unauthorized use and distribution. In this paper, we propose a robust digital image watermarking algorithm based on the multiple transform method, discrete wavelet transform (DWT) and discrete fractional random transform (DFRNT). We adopt a two-dimensional (2D) barcode for hiding information and apply the block code encoding and generate a watermark through them. The generated watermark image is embedded into DWT-DFRNT using quantization technique in order to ensure robustness and imperceptibility of the watermark. Experimental results present that our proposed algorithm has improved the extraction performance by accurately extracting the hidden information in the 2D barcode from the detected watermark. Also, combining the dual transform method, DWT and DFRNT, has improved the imperceptibility and robustness of the watermark against basic image signal processing attacks.

15 citations

Journal ArticleDOI
TL;DR: To resist geometrical attacks, the video zero watermarking algorithm based on log-polar transform presented in this paper has high robustness to the noise, filtering, compression and other common attacks.
Abstract: To resist geometrical attacks, the video zero watermarking algorithm based on log-polar transform presented in this paper In our method, an original image transformed in log-polar coordinate after transformation of 2D DWT and 3D DCT In experiment, the proposed method was evaluated the performance of resistance against attacks such as noise attack, rotation attack, compression attack and frame attack The experiment results show that this algorithm can effectively resist against geometric attacks, and it has high robustness to the noise, filtering, compression and other common attacks The bit error rate of the proposed algorithm is less than 006 for all tested attacks

12 citations

Journal ArticleDOI
TL;DR: An effective and robust audio watermarking algorithm that employs both the discrete wavelet transform and the discrete cosine transform and is robust against a wide range of Stirmark attacks such as noise addition, compression, and filtering.
Abstract: Unauthorized copying and distribution of digital audio has been greatly facilitated by the wide availability of low-cost personal computers, portable devices, network access, and audio recording and editing software. One possible solution for copyright protection is audio watermarking. In this paper, we propose an effective and robust audio watermarking algorithm that employs both the discrete wavelet transform and the discrete cosine transform. The algorithm involves, first, pre-processing of the binary watermark image and then embedding it into the original audio by quantization of coefficients. Experiments on audio recordings of many different music styles confirm the robustness of the algorithm against a wide range of Stirmark attacks such as noise addition, compression, and filtering, as well as other common attacks.

8 citations


Cited by
More filters
01 Jan 1999
TL;DR: Several mechanisms for marking documents and several other mechanisms for decoding the marks after documents have been subjected to common types of distortion are described and compared.
Abstract: Each copy of a text document can be made different in a nearly invisible way by repositioning or modifying the appearance of different elements of text, i.e., lines, words, or characters. A unique copy can be registered with its recipient, so that subsequent unauthorized copies that are retrieved can be traced back to the original owner. In this paper we describe and compare several mechanisms for marking documents and several other mechanisms for decoding the marks after documents have been subjected to common types of distortion. The marks are intended to protect documents of limited value that are owned by individuals who would rather possess a legal than an illegal copy if they can be distinguished. We will describe attacks that remove the marks and countermeasures to those attacks. An architecture is described for distributing a large number of copies without burdening the publisher with creating and transmitting the unique documents. The architecture also allows the publisher to determine the identity of a recipient who has illegally redistributed the document, without compromising the privacy of individuals who are not operating illegally. Two experimental systems are described. One was used to distribute an issue of the IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, and the second was used to mark copies of company private memoranda.

329 citations

Book ChapterDOI
28 Nov 2012
TL;DR: The proposed method using image moment normalization and a correlation peak position modulation (CPPM) to recover geometric distortions is suitable for public watermarking applications, where the original image is not available for watermark extraction.
Abstract: In this paper, we propose a digital watermarking scheme that is robust against geometric distortions. The proposed method uses image moment normalization and a correlation peak position modulation (CPPM) to recover geometric distortions. This mechanism is invariant to affine transform attacks and suitable for public watermarking applications, where the original image is not available for watermark extraction. In addition, CPPM ensures that there is sufficient capacity to hide specific information. We verify the robustness of our approach to rotation, scaling, and Gaussian noise attacks. The watermark can be detected with zero BER, because disadvantages disappear when CPPM is combined with image moment normalization—only the advantages of the two methods remain.

64 citations

Journal ArticleDOI
TL;DR: This paper reviews robust video watermarking algorithms for copyright protection based on original videos and compressed videos, and discusses the challenges in the research and possible development directions for the future.
Abstract: With the development and popularization of the Internet and the rise of various live broadcast platforms, digital videos have penetrated into all aspects of people’s life. At the same time, all kinds of pirated videos are also flooding the Internet, which seriously infringe the rights and interests of video copyright owners and hinder the healthy development of the video industry. Therefore, robust video watermarking algorithms for copyright protection have emerged as these times require. In this paper, we review robust video watermarking algorithms for copyright protection based on original videos and compressed videos. Basic models and properties of video watermarking algorithms are described, and the evaluation indexes corresponding to each property are also introduced. To help researchers understand various existing robust watermarking algorithms quickly, some basic information and the quantitative estimation of several performances are analyzed and compared. Finally, we discuss the challenges in the research of robust video watermarking algorithms, and give possible development directions for the future.

42 citations

Journal ArticleDOI
TL;DR: A novel watermarking method based on a discrete cosine transform (DCT) which guarantees robustness and low computational complexity is proposed, which had the faster and the more robust performance than previous studies.
Abstract: In many studies related to watermarking, spatial-domain methods have a relatively low information-hiding capacity and limited robustness, and transform-domain methods are not applicable in real-time processes because of their considerably high computational time. In this paper, we propose a novel watermarking method based on a discrete cosine transform (DCT), which guarantees robustness and low computational complexity. First, we calculated the DCT coefficient of a specific location. Then, a variation value was calculated according to the embedding bits and quantization steps to modify the coefficient. Last, we embedded watermark bits by directly modifying the pixel values without full-frame DCT. Tests comparing invisibility, robustness, and computational time were conducted for determining the feasibility of the proposed method. The results showed that the proposed method had the faster and the more robust performance than previous studies.

31 citations