东华大学学报（英文版）2007，Vol.24Issue(2)：280-283,4.
Predicting and Classifying User Identification Code System Based on Support Vector Machines
Predicting and Classifying User Identification Code System Based on Support Vector Machines
1
作者信息
- 1. Graduate School of Computer Science and Information Technology, National Taichung Institute of Technology, Taichung Taiwan 40401, China;Department of Logistics Engineering and Management, National Taichung Institute of Technology, Taichung Taiwan 40401, China;Department of Logistics Engineering and Management, National Taichung Institute of Technology, Taichung Taiwan 40401, China;Department of Logistics Engineering and Management, National Taichung Institute of Technology, Taichung Taiwan 40401, China
- 折叠
摘要
Abstract
In digital fingerprinting, preventing piracy of images by colluders is an important and tedious issue. Each image will be embedded with a unique User IDentification (U ID) code that is the fingerprint for tracking the authorized user. The proposed hiding scheme makes use of a random number generator to scramble two copies of a UID,which will then be hidden in the randomly selected medium frequency coefficients of the host image. The linear support vector machine (SVM) will be used to train classifications by calculating the normalized correlation (NC) for the 2-class UID codes. The trained classifications will be the models used for identifying unreadable UID codes.Experimental results showed that the success of predicting the unreadable UID codes can be increased by applying SVM. The proposed scheme can be used to provide protections to intellectual property rights of digital images and to keep track of users to prevent collaborative piracies.关键词
watermark/Support Vector Machines ( SVMs)/User IDentification (UID) code/collusionKey words
watermark/Support Vector Machines ( SVMs)/User IDentification (UID) code/collusion分类
信息技术与安全科学引用本文复制引用
..Predicting and Classifying User Identification Code System Based on Support Vector Machines[J].东华大学学报（英文版）,2007,24(2):280-283,4.
