• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wang Jian, Lin Fuzong. Digital Audio Watermarking Based on Support Vector Machine (SVM)[J]. Journal of Computer Research and Development, 2005, 42(9): 1605-1611.
Citation: Wang Jian, Lin Fuzong. Digital Audio Watermarking Based on Support Vector Machine (SVM)[J]. Journal of Computer Research and Development, 2005, 42(9): 1605-1611.

Digital Audio Watermarking Based on Support Vector Machine (SVM)

More Information
  • Published Date: September 14, 2005
  • A novel digital audio watermarking technique based on SVM(support vector machine) is proposed in this paper. The main idea of the method is that the retrieval of embedded watermark can be considered as a two-class problem, and SVM can be used to learn the characteristics of the embedded watermark in audio. Because the SVM possesses the learning and adaptive capabilities, it almost exactly recovers the watermark from the watermarked audio. The extensive experimental results show that the embedded watermark is robust against audio signal processing, such as MPEG audio coding, cropping, filtering, resampling and requantizing. The watermarking method does not require the use of the original signal for watermarking detection.
  • Related Articles

    [1]LiuPeixia, JiangHaitao, ZhuDaming. Complexity and Algorithm for Minimum Breakpoint Median from PQ-trees[J]. Journal of Computer Research and Development, 2016, 53(3): 644-650. DOI: 10.7544/issn1000-1239.2016.20148258
    [2]Xu Yuming, Zhu Ningbo, Ouyang Aijia, and Li Kenli. A Double-Helix Structure Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems[J]. Journal of Computer Research and Development, 2014, 51(6): 1240-1252.
    [3]Li Kenli, Luo Xing, Wu Fan, Zhou Xu, and Huang Xin. An Algorithm in Tile Assembly Model for Maximum Clique Problem[J]. Journal of Computer Research and Development, 2013, 50(3): 666-675.
    [4]Zhou Xu, Li Kenli, Yue Guangxue, Yang Zhibang. A Volume Molecular Solution for the Maximum Matching Problem on DNA-Based Computing[J]. Journal of Computer Research and Development, 2011, 48(11): 2147-2154.
    [5]Wang Bin, Guo Qing, Li Zhongbo, Yang Xiaochun. Index Structures for Supporting Block Edit Distance[J]. Journal of Computer Research and Development, 2010, 47(1): 191-199.
    [6]Li Kenli, Liu Jie, Yang Lei, Liu Wenbin. An O(1.414\+n) Volume Molecular Solutions for the Exact Cover Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2008, 45(10): 1782-1788.
    [7]Jiang He, Zhang Xianchao, Che Haoyang, Chen Guoliang. A Multi-Commodity Flow Linear Programming with Polynomial Constraints for Black and White Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1796-1800.
    [8]Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
    [9]Zhao Baohua, Guo Xionghui, QianLan, and Qu Yugui. On the Problem of How to Place the Observers in Passive Testing[J]. Journal of Computer Research and Development, 2005, 42(10): 1815-1819.
    [10]Zhou Huaqi, Lu Mingming, and Zhu Hong. A Preemptive Scheduling Problem with Different Interrupted Time Cost on Identical Parallel Machines[J]. Journal of Computer Research and Development, 2005, 42(3).

Catalog

    Article views (848) PDF downloads (724) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return