UDC 681.3
© Bakhrushin A. P., 2009
The Application of the Convex Programming Model for the Optimization of the Watermark Search in Videodata
The main purpose of the search theory is the development of the effective methods for different object detection. In particular, the search may be performed with the aim of finding digital watermarks, which nowadays are widely used for multimedia data protection. For solving this problem the different mathematical methods may be applied, in particular, the methods of operations research. In this paper, the problem of search optimization of the digital watermarks, which are embedded into movies, is considered on the bases of convex programming model. The specific situation of the watermark search is discussed.
Keywords: convex programming, goal function, probability, digital watermark
References:
- Kolemaeva V. A. Matematicheskie metody issledovaniya operatsiy. M., 2008.
- Lin E. T., Delp E. J. Temporal synchronization in video Water-marking // IEEE Trans. on Signal Proc., 2004. V. 52. N. 10.
- Bahrushin A., Kim Kisseon, Lopatin and Tsoy R. Using Vilenkin-Chrestenson Func-tions for Generating Watermarks with Given Properties // Proceedings of the 2006 Interna-tional Conference on Image Processing, Computer Vision and Pattern Recognition. Las Vegas, Nevada, USA, 2006. June.
- Bahrushin A., Tsoy R., Lopatin K., Bahrushina G. Robust Video Watermarking Scheme Resilient to Collusion Attacks // Proceedings of the 2007 International Conference on Image Processing, Computer Vision and Pattern Recognition. Las Vegas, Nevada, USA, 2007. June.
- Bakhrushin A. P. Spektral`nyy analiz videokadrov na osnove sistemy im-pul`snykh funktsiy s tsel`yu sinkhronizatsii protsessov vnedreniya i poiska tsifrovykh vodyanykh znakov // Vestnik TOGU. 2008.
Download article (245.1 Kb)
