In order to protect copyright of digital images,a new robust digital image watermarking algorithm based on chaotic system and QR factorization was proposed.The host images were firstly divided into blocks with same si...In order to protect copyright of digital images,a new robust digital image watermarking algorithm based on chaotic system and QR factorization was proposed.The host images were firstly divided into blocks with same size,then QR factorization was performed on each block.Pseudorandom circular chain(PCC) generated by logistic mapping(LM) was applied to select the embedding blocks for enhancing the security of the scheme.The first column coefficients in Q matrix of chosen blocks were modified to embed watermarks without causing noticeable artifacts.Watermark extraction procedure was performed without the original cover image.The experimental results demonstrate that the watermarked images have good visual quality and this scheme is better than the existing techniques,especially when the image is attacked by cropping,noise pollution and so on.Analysis and discussion on robustness and security issues were also presented.展开更多
An adaptive digital image watermark algorithm with strong robustness based on gray-scale morphology is proposed in this paper.The embedded strategies include:The algorithm seeks and extracts adaptively the image stron...An adaptive digital image watermark algorithm with strong robustness based on gray-scale morphology is proposed in this paper.The embedded strategies include:The algorithm seeks and extracts adaptively the image strong texture regions.The algorithm maps the image strong texture region to the wavelet tree structures, and embeds adaptively watermark into the wavelet coefficients corresponding to the image's strong texture regions.According to the visual masking features, the algorithm adjusts adaptively the watermark-embedding intensity.Experimental results show the algorithm is robust to compression, filtering, noise as well as strong shear attacks.The algorithm is blind watermark scheme.The image strong texture region extraction method based on morphology in this algorithm is simple and effective and adaptive to various images.展开更多
A lossless digital watermarking scheme,which was zero- perturbation on the content and graphics for the digital image maps,is proposed.During the simulation,the scheme has been utilized to model the copyright protecti...A lossless digital watermarking scheme,which was zero- perturbation on the content and graphics for the digital image maps,is proposed.During the simulation,the scheme has been utilized to model the copyright protection program as a commerce application.Compared to the traditional digital watermarking schemes,our scheme operates in redundancy areas of maps and is scalable to topology changes.Experimental results show that,with respect to the geometric attacks and image transformed,the performance of our scheme is better than the classical algorithms based space or frequency domain with much lower complexity..展开更多
基金Project(2007AA01Z241-2) supported by the National High-tech Research and Development Program of ChinaProject(2006XM002) supported by Beijing Jiaotong University Science Foundation,ChinaProject(0910KYZY55) supported by the Fundamental Research Funds for the Central University in China
文摘In order to protect copyright of digital images,a new robust digital image watermarking algorithm based on chaotic system and QR factorization was proposed.The host images were firstly divided into blocks with same size,then QR factorization was performed on each block.Pseudorandom circular chain(PCC) generated by logistic mapping(LM) was applied to select the embedding blocks for enhancing the security of the scheme.The first column coefficients in Q matrix of chosen blocks were modified to embed watermarks without causing noticeable artifacts.Watermark extraction procedure was performed without the original cover image.The experimental results demonstrate that the watermarked images have good visual quality and this scheme is better than the existing techniques,especially when the image is attacked by cropping,noise pollution and so on.Analysis and discussion on robustness and security issues were also presented.
基金Supported by the Technology Key Project of Shanxi Province (2007K04-13)the Application Development and Research Project of Xi’an (YF07017)
文摘An adaptive digital image watermark algorithm with strong robustness based on gray-scale morphology is proposed in this paper.The embedded strategies include:The algorithm seeks and extracts adaptively the image strong texture regions.The algorithm maps the image strong texture region to the wavelet tree structures, and embeds adaptively watermark into the wavelet coefficients corresponding to the image's strong texture regions.According to the visual masking features, the algorithm adjusts adaptively the watermark-embedding intensity.Experimental results show the algorithm is robust to compression, filtering, noise as well as strong shear attacks.The algorithm is blind watermark scheme.The image strong texture region extraction method based on morphology in this algorithm is simple and effective and adaptive to various images.
基金supported in part by National Science Fund for Distinguished Young Scholars under Grant No.61202455Research Funds for the Central Universities under Grant No.HEUCF100612Research Funds for the Doctoral Program of Higher Education of China under Grant No.20112304120025
文摘A lossless digital watermarking scheme,which was zero- perturbation on the content and graphics for the digital image maps,is proposed.During the simulation,the scheme has been utilized to model the copyright protection program as a commerce application.Compared to the traditional digital watermarking schemes,our scheme operates in redundancy areas of maps and is scalable to topology changes.Experimental results show that,with respect to the geometric attacks and image transformed,the performance of our scheme is better than the classical algorithms based space or frequency domain with much lower complexity..
