A Robust LS-SVM Regression

In this work, we present for the first time in our perception an efficient digital watermarking scheme for mpeg audio layer 3 files that operates directly in the compressed data domain, while manipulating the time and subband/channel domain. In addition, it does not need the original signal to detect the watermark. Our scheme was implemented taking special care for the efficient usage of the two limited resources of computer systems: time and space. It offers to the industrial user the capability of watermark embedding and detection in time immediately comparable to the real music time of the original audio file that depends on the mpeg compression, while the end user/audience does not face any artifacts or delays hearing the watermarked audio file. Furthermore, it overcomes the disadvantage of algorithms operating in the PCM- Data domain to be vulnerable to compression/recompression attacks, as it places the watermark in the scale factors domain and not in the digitized sound audio data. The strength of our scheme, that allows it to be used with success in both authentication and copyright protection, relies on the fact that it gives to the users the enhanced capability their ownership of the audio file not to be accomplished simply by detecting the bit pattern that comprises the watermark itself, but by showing that the legal owner knows a hard to compute property of the watermark. Keywords—Audio watermarking, mpeg audio layer 3, hard instance generation, NP-completeness.

[1]  P. Holland,et al.  Robust regression using iteratively reweighted least-squares , 1977 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Gene H. Golub,et al.  Matrix computations , 1983 .

[4]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[5]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[6]  Walter Bender,et al.  Techniques for Data Hiding , 1996, IBM Syst. J..

[7]  Ahmed H. Tewfik,et al.  Digital watermarks for audio signals , 1996, 1996 8th European Signal Processing Conference (EUSIPCO 1996).

[8]  Ioannis Pitas,et al.  Robust audio watermarking in the time domain , 1998, 9th European Signal Processing Conference (EUSIPCO 1998).

[9]  Gunnar Rätsch,et al.  Input space versus feature space in kernel-based methods , 1999, IEEE Trans. Neural Networks.

[10]  Michael Arnold,et al.  MP3 robust Audio Watermarking , 1999 .

[11]  Johan A. K. Suykens,et al.  Sparse approximation using least squares support vector machines , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[12]  Johan A. K. Suykens,et al.  Sparse least squares Support Vector Machine classifiers , 2000, ESANN.

[13]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[14]  Yuh-Jye Lee,et al.  RSVM: Reduced Support Vector Machines , 2001, SDM.

[15]  G. Baudat,et al.  Kernel-based methods and function approximation , 2001, IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222).

[16]  Yannis C. Stamatiou,et al.  A compressed-domain watermarking algorithm for mpeg audio layer 3 , 2001, MM&Sec '01.

[17]  Jongwon Seok,et al.  A Novel Audio Watermarking Algorithm for Copyright Protection of Digital Audio , 2002 .

[18]  Johan A. K. Suykens,et al.  Weighted least squares support vector machines: robustness and sparse approximation , 2002, Neurocomputing.

[19]  Johan A. K. Suykens,et al.  Least Squares Support Vector Machines , 2002 .

[20]  William H. Press,et al.  Numerical recipes in C , 2002 .

[21]  G. Horváth,et al.  A generalised LS-SVM , 2003 .

[22]  G. Horváth,et al.  A WEIGHTED GENERALIZED LS-SVM , 2003 .

[23]  Liu Xiao,et al.  A Sparse Least Squares Support Vector Machine Classifier , 2007 .