%0 Journal Article %J Signal Processing, IEEE Transactions on %D 2005 %T Data hiding in curves with application to fingerprinting maps %A Gou,Hongmei %A M. Wu %K (mathematics); %K algorithm; %K alignment-minimization %K B-spline %K CONTROL %K curve %K data %K detection; %K edge %K embedding; %K encapsulation; %K fingerprint %K geospatial %K hiding %K identification; %K image %K iterative %K method; %K methods; %K minimisation; %K point; %K protection; %K registration; %K sequence; %K spectrum %K splines %K spread %K watermarking; %X This paper presents a new data hiding method for curves. The proposed algorithm parameterizes a curve using the B-spline model and adds a spread spectrum sequence to the coordinates of the B-spline control points. In order to achieve robust fingerprint detection, an iterative alignment-minimization algorithm is proposed to perform curve registration and to deal with the nonuniqueness of B-spline control points. Through experiments, we demonstrate the robustness of the proposed data-hiding algorithm against various attacks, such as collusion, cropping, geometric transformations, vector/raster-raster/vector conversions, printing-and-scanning, and some of their combinations. We also show the feasibility of our method for fingerprinting topographic maps as well as writings and drawings. %B Signal Processing, IEEE Transactions on %V 53 %P 3988 - 4005 %8 2005/10// %@ 1053-587X %G eng %N 10 %R 10.1109/TSP.2005.855411 %0 Conference Paper %B Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on %D 2005 %T Improving collusion resistance of error correcting code based multimedia fingerprinting %A He,Shan %A M. Wu %K based %K code %K codes; %K coding; %K collusion %K correcting %K correction %K data; %K detection; %K digital %K ECC; %K embedding; %K error %K fingerprint %K fingerprinting %K fingerprinting; %K multimedia %K of %K permuted %K resistance; %K Security %K signatures; %K subsegment %K systems; %X Digital fingerprinting protects multimedia content from illegal redistribution by uniquely marking copies of the content distributed to each user. Collusion is a powerful attack whereby several differently fingerprinted copies of the same content are combined together to attenuate or remove the fingerprints. Focusing on the error correction code (ECC) based fingerprinting, we explore in this paper new avenues that can substantially improve its collusion resistance, and in the mean time retain its advantages in detection complexity and fast distribution. Our analysis suggests a great need of jointly considering the coding, embedding, and detection issues, and inspires the proposed technique of permuted subsegment embedding that is able to substantially improve the collusion resistance of ECC based fingerprinting. %B Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on %V 2 %P ii/1029 - ii/1032 Vol. 2 - ii/1029 - ii/1032 Vol. 2 %8 2005/03// %G eng %R 10.1109/ICASSP.2005.1415583 %0 Journal Article %J Signal Processing, IEEE Transactions on %D 2003 %T Anti-collusion fingerprinting for multimedia %A Trappe,W. %A M. Wu %A Wang,Z.J. %A Liu,K. J.R %K (mathematics); %K additive %K algorithm; %K and %K anti-collusion %K attack; %K averaging %K binary %K code %K codes; %K codevectors; %K coding; %K colluders %K collusion; %K combinatorial %K communication; %K compression; %K correlation; %K cost-effective %K data %K data; %K design %K DETECTION %K detection; %K digital %K embedding; %K fingerprinting; %K Gaussian %K identification; %K image %K images; %K keying; %K logical %K mathematics; %K Modulation %K modulation; %K multimedia %K multimedia; %K of %K on-off %K operation; %K orthogonal %K processes; %K real %K redistribution; %K Security %K signal %K signals; %K theory; %K tree-structured %K TREES %K watermarking; %X Digital fingerprinting is a technique for identifying users who use multimedia content for unintended purposes, such as redistribution. These fingerprints are typically embedded into the content using watermarking techniques that are designed to be robust to a variety of attacks. A cost-effective attack against such digital fingerprints is collusion, where several differently marked copies of the same content are combined to disrupt the underlying fingerprints. We investigate the problem of designing fingerprints that can withstand collusion and allow for the identification of colluders. We begin by introducing the collusion problem for additive embedding. We then study the effect that averaging collusion has on orthogonal modulation. We introduce a tree-structured detection algorithm for identifying the fingerprints associated with K colluders that requires O(Klog(n/K)) correlations for a group of n users. We next develop a fingerprinting scheme based on code modulation that does not require as many basis signals as orthogonal modulation. We propose a new class of codes, called anti-collusion codes (ACCs), which have the property that the composition of any subset of K or fewer codevectors is unique. Using this property, we can therefore identify groups of K or fewer colluders. We present a construction of binary-valued ACC under the logical AND operation that uses the theory of combinatorial designs and is suitable for both the on-off keying and antipodal form of binary code modulation. In order to accommodate n users, our code construction requires only O( radic;n) orthogonal signals for a given number of colluders. We introduce three different detection strategies that can be used with our ACC for identifying a suspect set of colluders. We demonstrate the performance of our ACC for fingerprinting multimedia and identifying colluders through experiments using Gaussian signals and real images. %B Signal Processing, IEEE Transactions on %V 51 %P 1069 - 1087 %8 2003/04// %@ 1053-587X %G eng %N 4 %R 10.1109/TSP.2003.809378 %0 Journal Article %J Image Processing, IEEE Transactions on %D 2003 %T Data hiding in image and video .I. Fundamental issues and solutions %A M. Wu %A Liu,Bede %K adaptive %K analysis; %K bits; %K colour %K condition; %K constant %K CONTROL %K data %K embedded %K EMBEDDING %K embedding; %K encapsulation; %K extractable %K hiding; %K image %K Modulation %K modulation; %K multilevel %K multiplexing %K multiplexing; %K NOISE %K nonstationary %K processing; %K rate; %K reviews; %K shuffling; %K signal %K signals; %K simulation; %K solution; %K techniques; %K variable %K video %K visual %X We address a number of fundamental issues of data hiding in image and video and propose general solutions to them. We begin with a review of two major types of embedding, based on which we propose a new multilevel embedding framework to allow the amount of extractable data to be adaptive according to the actual noise condition. We then study the issues of hiding multiple bits through a comparison of various modulation and multiplexing techniques. Finally, the nonstationary nature of visual signals leads to highly uneven distribution of embedding capacity and causes difficulty in data hiding. We propose an adaptive solution switching between using constant embedding rate with shuffling and using variable embedding rate with embedded control bits. We verify the effectiveness of our proposed solutions through analysis and simulation. %B Image Processing, IEEE Transactions on %V 12 %P 685 - 695 %8 2003/06// %@ 1057-7149 %G eng %N 6 %R 10.1109/TIP.2003.810588 %0 Journal Article %J Image Processing, IEEE Transactions on %D 2003 %T Data hiding in image and video .II. Designs and applications %A M. Wu %A Yu,H. %A Liu,Bede %K access %K annotation; %K authentication; %K capacity; %K conditions; %K content-based %K CONTROL %K control; %K copy %K data %K distortions; %K EMBEDDING %K embedding; %K encapsulation; %K extraction; %K frame %K hiding; %K image %K information; %K jitter; %K message %K multilevel %K NOISE %K noise; %K payload %K processing; %K robust %K signal %K uneven %K user %K video %X For pt. I see ibid., vol.12, no.6, p.685-95 (2003). This paper applies the solutions to the fundamental issues addressed in Part I to specific design problems of embedding data in image and video. We apply multilevel embedding to allow the amount of embedded information that can be reliably extracted to be adaptive with respect to the actual noise conditions. When extending the multilevel embedding to video, we propose strategies for handling uneven embedding capacity from region to region within a frame as well as from frame to frame. We also embed control information to facilitate the accurate extraction of the user data payload and to combat such distortions as frame jitter. The proposed algorithm can be used for a variety of applications such as copy control, access control, robust annotation, and content-based authentication. %B Image Processing, IEEE Transactions on %V 12 %P 696 - 705 %8 2003/06// %@ 1057-7149 %G eng %N 6 %R 10.1109/TIP.2003.810589 %0 Journal Article %J Circuits and Systems for Video Technology, IEEE Transactions on %D 2003 %T Joint security and robustness enhancement for quantization based data embedding %A Wu,M. %K (signal); %K authentication; %K binary %K compensation; %K data %K data; %K DETECTION %K digital %K distortion %K distortion; %K embedding; %K encapsulation; %K enhancement; %K error %K features; %K hiding; %K lookup %K lookup; %K LUT; %K message %K multimedia %K nontrivial %K probability; %K quantisation %K quantization %K quantized %K Robustness %K run %K Security %K statistics; %K systems; %K table %K table; %K watermarking; %X The paper studies joint security and robustness enhancement of quantization-based data embedding for multimedia authentication applications. We present an analysis showing that through a nontrivial run lookup table (LUT) that maps quantized multimedia features randomly to binary data, the probability of detection error can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion-compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding. %B Circuits and Systems for Video Technology, IEEE Transactions on %V 13 %P 831 - 841 %8 2003/08// %@ 1051-8215 %G eng %N 8 %R 10.1109/TCSVT.2003.815951 %0 Conference Paper %B Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on %D 2003 %T Joint security robustness enhancement for quantization embedding %A Wu,M. %K applications; %K Authentication %K authentication; %K binary %K communication; %K data %K data; %K embedding; %K error %K joint %K lookup %K lookup; %K message %K multimedia %K probability; %K security; %K statistics; %K table %K table; %K watermarking; %X This paper studies joint security and robustness enhancement of quantization based data embedding for multimedia authentication applications. We present analysis showing that through a lookup table (LUT) of nontrivial run that maps quantized multimedia features randomly to binary data, the detection error probability can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding. %B Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on %V 2 %P II - 483-6 vol.3 - II - 483-6 vol.3 %8 2003/09// %G eng %R 10.1109/ICIP.2003.1246722 %0 Conference Paper %B Image Processing. 2002. Proceedings. 2002 International Conference on %D 2002 %T Anti-collusion codes: multi-user and multimedia perspectives %A Trappe,W. %A M. Wu %A Liu,K. J.R %K and %K anti-collusion %K authentication; %K binary %K code %K codes; %K coding; %K combinatorial %K computing; %K content; %K data %K designs; %K digital %K embedding; %K encapsulation; %K fingerprinting; %K image %K images; %K logical %K mathematics; %K message %K Modulation %K modulation; %K multimedia %K operation; %K performance; %K watermarking; %X Digital fingerprinting is an effective method to identify users who might try to redistribute multimedia content, such as images and video. These fingerprints are typically embedded into the content using watermarking techniques that are designed to be robust to a variety of attacks. A cheap and effective attack against such digital fingerprints is collusion, where several differently marked copies of the same content are averaged or combined to disrupt the underlying fingerprint. We present a construction of collusion-resistant fingerprints based upon anti-collusion codes (ACC) and binary code modulation. ACC have the property that the composition of any subset of K or fewer codevectors is unique. Using this property, we build fingerprints that allow for the identification of groups of K or less colluders. We present a construction of binary-valued ACC under the logical AND operation using the theory of combinatorial designs. Our code construction requires only Oscr;( radic;n) orthogonal signals to accommodate n users. We demonstrate the performance of our ACC for fingerprinting multimedia by identifying colluders through experiments using real images. %B Image Processing. 2002. Proceedings. 2002 International Conference on %V 2 %P II-149 - II-152 vol.2 - II-149 - II-152 vol.2 %8 2002/// %G eng %R 10.1109/ICIP.2002.1039909