A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low freq...A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.展开更多
Contraposing the need of the robust digital watermark for the copyright protection field, a new digital watermarking algorithm in the non-subsampled contourlet transform （NSCT） domain is proposed. The largest energy...Contraposing the need of the robust digital watermark for the copyright protection field, a new digital watermarking algorithm in the non-subsampled contourlet transform （NSCT） domain is proposed. The largest energy sub-band after NSCT is selected to embed watermark. The watermark is embedded into scaleinvariant feature transform （SIFT） regions. During embedding, the initial region is divided into some cirque sub-regions with the same area, and each watermark bit is embedded into one sub-region. Extensive simulation results and comparisons show that the algorithm gets a good trade-off of invisibility, robustness and capacity, thus obtaining good quality of the image while being able to effectively resist common image processing, and geometric and combo attacks, and normalized similarity is almost all reached.展开更多
基金supported by the National Natural Science Foundation of China (6117212711071002)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education (20113401110006)the Innovative Research Team of 211 Project in Anhui University (KJTD007A)
文摘A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.
基金supported by the National Natural Science Foundation of China(61379010)the Natural Science Basic Research Plan in Shaanxi Province of China(2015JM6293)
文摘Contraposing the need of the robust digital watermark for the copyright protection field, a new digital watermarking algorithm in the non-subsampled contourlet transform （NSCT） domain is proposed. The largest energy sub-band after NSCT is selected to embed watermark. The watermark is embedded into scaleinvariant feature transform （SIFT） regions. During embedding, the initial region is divided into some cirque sub-regions with the same area, and each watermark bit is embedded into one sub-region. Extensive simulation results and comparisons show that the algorithm gets a good trade-off of invisibility, robustness and capacity, thus obtaining good quality of the image while being able to effectively resist common image processing, and geometric and combo attacks, and normalized similarity is almost all reached.
