This paper presents a new digital image blind watermarking algorithm based on combination of discrete wavelet transform （DWT） and singular value decomposition （SVD）. First of all, we make wavelet decomposition for...This paper presents a new digital image blind watermarking algorithm based on combination of discrete wavelet transform （DWT） and singular value decomposition （SVD）. First of all, we make wavelet decomposition for the original image and divide the acquired low frequency sub-band into blocks. Then we make singular value decomposition for each block and embed the watermark information in the largest singular value by quantitative method. The watermark can be extracted without the original image. The experimental results show that the algorithm has a good imperceptibility and robustness.展开更多
A novel Parallel-Based Lifting Algorithm （PBLA） for Discrete Wavelet Transform （DWT）, exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the cri...A novel Parallel-Based Lifting Algorithm （PBLA） for Discrete Wavelet Transform （DWT）, exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the critical path latency of computation, and to reduce the complexity of hardware implementation as well. The detailed derivation on the proposed algorithm, as well as the resulting Very Large Scale Integration （VLSI） architecture, is introduced, taking the 9/7 DWT as an example but without loss of generality. In comparison with the Conventional Lifting Algorithm Based Implementation （CLABI）, the critical path latency of the proposed architecture is reduced by more than half from （4Tm ＋ 8Ta）to Tm ＋ 4Ta, and is competitive to that of Convolution-Based Implementation （CBI）, but the new implementation will save significantly in hardware. The experimental results demonstrate that the proposed architecture has good performance in both increasing working frequency and reducing area.展开更多
We propose a novel texture clustering method. A classical type of(approximate) shift invariant discrete wavelet transform(DWT),dual tree DWT,is used to decompose texture images. Multiple signatures are generated from ...We propose a novel texture clustering method. A classical type of(approximate) shift invariant discrete wavelet transform(DWT),dual tree DWT,is used to decompose texture images. Multiple signatures are generated from the obtained high-frequency bands. A locality preserving approach is applied subsequently to project data from high-dimensional space to low-dimensional space. Shift invariant DWT can represent image texture information efficiently in combination with a histogram signature,and the local geometrical structure of the dataset is preserved well during clustering. Experimental results show that the proposed method remarkably outperforms traditional ones.展开更多
基金Science and Technology Agency of Henan Province(No.132102210516)
文摘This paper presents a new digital image blind watermarking algorithm based on combination of discrete wavelet transform （DWT） and singular value decomposition （SVD）. First of all, we make wavelet decomposition for the original image and divide the acquired low frequency sub-band into blocks. Then we make singular value decomposition for each block and embed the watermark information in the largest singular value by quantitative method. The watermark can be extracted without the original image. The experimental results show that the algorithm has a good imperceptibility and robustness.
基金Supported by the National 863 project (No.2002AA133010).
文摘A novel Parallel-Based Lifting Algorithm （PBLA） for Discrete Wavelet Transform （DWT）, exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the critical path latency of computation, and to reduce the complexity of hardware implementation as well. The detailed derivation on the proposed algorithm, as well as the resulting Very Large Scale Integration （VLSI） architecture, is introduced, taking the 9/7 DWT as an example but without loss of generality. In comparison with the Conventional Lifting Algorithm Based Implementation （CLABI）, the critical path latency of the proposed architecture is reduced by more than half from （4Tm ＋ 8Ta）to Tm ＋ 4Ta, and is competitive to that of Convolution-Based Implementation （CBI）, but the new implementation will save significantly in hardware. The experimental results demonstrate that the proposed architecture has good performance in both increasing working frequency and reducing area.
基金supported by the Hi-Tech Research and Development Program (863) of China (Nos. 2007AA01Z311 and 2007AA04Z1A5)the National Basic Research Program (973) of China (No. 2009CB32 0804)+1 种基金the National Research Foundation for the Doctoral Program of Higher Education of China (No. 20060335114)the Science and Technology Program of Zhejiang Province, China (No. 2007C21006)
文摘We propose a novel texture clustering method. A classical type of(approximate) shift invariant discrete wavelet transform(DWT),dual tree DWT,is used to decompose texture images. Multiple signatures are generated from the obtained high-frequency bands. A locality preserving approach is applied subsequently to project data from high-dimensional space to low-dimensional space. Shift invariant DWT can represent image texture information efficiently in combination with a histogram signature,and the local geometrical structure of the dataset is preserved well during clustering. Experimental results show that the proposed method remarkably outperforms traditional ones.
