@article {18191,
	title = {Data hiding in curves with application to fingerprinting maps},
	journal = {Signal Processing, IEEE Transactions on},
	volume = {53},
	year = {2005},
	month = {2005/10//},
	pages = {3988 - 4005},
	abstract = {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.},
	keywords = {(mathematics);, algorithm;, alignment-minimization, B-spline, CONTROL, curve, data, detection;, edge, embedding;, encapsulation;, fingerprint, geospatial, hiding, identification;, image, iterative, method;, methods;, minimisation;, point;, protection;, registration;, sequence;, spectrum, splines, spread, watermarking;},
	isbn = {1053-587X},
	doi = {10.1109/TSP.2005.855411},
	author = {Gou,Hongmei and M. Wu}
}
@article {18180,
	title = {Collusion-resistant fingerprinting for multimedia},
	journal = {Signal Processing Magazine, IEEE},
	volume = {21},
	year = {2004},
	month = {2004/03//},
	pages = {15 - 27},
	abstract = {Digital fingerprinting is a technology for enforcing digital rights policies whereby unique labels, known as digital fingerprints, are inserted into content prior to distribution. For multimedia content, fingerprints can be embedded using conventional watermarking techniques that are typically concerned with robustness against a variety of attacks mounted by an individual. These attacks, known as multiuser collusion attacks, provide a cost-effective method for attenuating each of the colluder{\textquoteright}s fingerprints and poses a real threat to protecting media data and enforcing usage policies. In this article, we review some major design methodologies for collusion-resistant fingerprinting of multimedia and highlight common and unique issues of different fingerprinting techniques. It also provides detailed discussions on the two major classes of fingerprinting strategies, namely, orthogonal fingerprinting and correlated fingerprinting.},
	keywords = {attacks;, colluder, collusion, collusion-resistant, content;, correlated, data;, digital, fingerprinting;, identification;, multimedia, multiuser, of, orthogonal, policies;, rights, Security, systems;, techniques;, tracing;, watermarking, watermarking;},
	isbn = {1053-5888},
	doi = {10.1109/MSP.2004.1276103},
	author = {M. Wu and Trappe,W. and Wang,Z.J. and Liu,K. J.R}
}
@conference {12704,
	title = {Fusion of gait and face for human identification},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/05//},
	pages = {V - 901-4 vol.5 - V - 901-4 vol.5},
	abstract = {Identification of humans from arbitrary view points is an important requirement for different tasks including perceptual interfaces for intelligent environments, covert security and access control etc. For optimal performance, the system must use as many cues as possible and combine them in meaningful ways. In this paper, we discuss fusion of face and gait cues for the single camera case. We present a view invariant gait recognition algorithm for gait recognition. We employ decision fusion to combine the results of our gait recognition algorithm and a face recognition algorithm based on sequential importance sampling. We consider two fusion scenarios: hierarchical and holistic. The first involves using the gait recognition algorithm as a filter to pass on a smaller set of candidates to the face recognition algorithm. The second involves combining the similarity scores obtained individually from the face and gait recognition algorithms. Simple rules like the SUM, MIN and PRODUCT are used for combining the scores. The results of fusion experiments are demonstrated on the NIST database which has outdoor gait and face data of 30 subjects.},
	keywords = {access, algorithm;, analysis;, combining, control;, covert, cues;, data, decision, Environment, Face, fusion;, Gait, hierarchical, holistic, human, identification;, importance, intelligent, interfaces;, invariant, perceptual, recognition, recognition;, rules;, sampling;, score, scores;, security;, sensor, sequential, similarity, view},
	doi = {10.1109/ICASSP.2004.1327257},
	author = {Kale, A. and Roy Chowdhury, A.K. and Chellapa, Rama}
}
@conference {12694,
	title = {A system identification approach for video-based face recognition},
	booktitle = {Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on},
	volume = {4},
	year = {2004},
	month = {2004/08//},
	pages = {175 - 178 Vol.4 - 175 - 178 Vol.4},
	abstract = {The paper poses video-to-video face recognition as a dynamical system identification and classification problem. We model a moving face as a linear dynamical system whose appearance changes with pose. An autoregressive and moving average (ARMA) model is used to represent such a system. The choice of ARMA model is based on its ability to take care of the change in appearance while modeling the dynamics of pose, expression etc. Recognition is performed using the concept of sub space angles to compute distances between probe and gallery video sequences. The results obtained are very promising given the extent of pose, expression and illumination variation in the video data used for experiments.},
	keywords = {and, autoregressive, average, dynamical, Face, gallery, identification;, image, linear, model;, moving, processes;, processing;, recognition;, sequences;, signal, system, system;, video, video-based},
	doi = {10.1109/ICPR.2004.1333732},
	author = {Aggarwal,G. and Chowdhury, A.K.R. and Chellapa, Rama}
}
@article {18167,
	title = {Anti-collusion fingerprinting for multimedia},
	journal = {Signal Processing, IEEE Transactions on},
	volume = {51},
	year = {2003},
	month = {2003/04//},
	pages = {1069 - 1087},
	abstract = {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.},
	keywords = {(mathematics);, additive, algorithm;, and, anti-collusion, attack;, averaging, binary, code, codes;, codevectors;, coding;, colluders, collusion;, combinatorial, communication;, compression;, correlation;, cost-effective, data, data;, design, DETECTION, detection;, digital, embedding;, fingerprinting;, Gaussian, identification;, image, images;, keying;, logical, mathematics;, Modulation, modulation;, multimedia, multimedia;, of, on-off, operation;, orthogonal, processes;, real, redistribution;, Security, signal, signals;, theory;, tree-structured, TREES, watermarking;},
	isbn = {1053-587X},
	doi = {10.1109/TSP.2003.809378},
	author = {Trappe,W. and M. Wu and Wang,Z.J. and Liu,K. J.R}
}
@conference {12734,
	title = {Combining multiple evidences for gait recognition},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003/04//},
	pages = {III - 33-6 vol.3 - III - 33-6 vol.3},
	abstract = {In this paper, we systematically analyze different components of human gait, for the purpose of human identification. We investigate dynamic features such as the swing of the hands/legs, the sway of the upper body and static features like height, in both frontal and side views. Both probabilistic and non-probabilistic techniques are used for matching the features. Various combination strategies may be used depending upon the gait features being combined. We discuss three simple rules: the Sum, Product and MIN rules that are relevant to our feature sets. Experiments using four different datasets demonstrate that fusion can be used as an effective strategy in recognition.},
	keywords = {analysis;, dynamic, evidences;, extraction;, feature, features;, frontal, Gait, height;, human, identification;, image, MIN, multiple, nonprobabilistic, probabilistic, Product, recognition;, rules;, sets;, side, static, Sum, sway;, swing;, techniques;, views;},
	doi = {10.1109/ICASSP.2003.1199100},
	author = {Cuntoor, N. and Kale, A. and Chellapa, Rama}
}
@conference {12304,
	title = {Cooperative peer groups in NICE},
	booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies},
	volume = {2},
	year = {2003},
	month = {2003///},
	pages = {1272 - 1282 vol.2 - 1272 - 1282 vol.2},
	abstract = {A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.},
	keywords = {algorithm;, cooperative, decentralized, distributed, identification;, individual, inference, inference;, information, Internet;, malicious, manner;, mechanisms;, networks;, NICE, node;, noncooperative, peer-to-peer, platform;, reputation, retrieval;, storage;, system;, trust, users, users;},
	doi = {10.1109/INFCOM.2003.1208963},
	author = {Lee,S. and Sherwood,R. and Bhattacharjee, Bobby}
}
@conference {18261,
	title = {Performance of detection statistics under collusion attacks on independent multimedia fingerprints},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {1},
	year = {2003},
	month = {2003/07//},
	pages = {I - 205-8 vol.1 - I - 205-8 vol.1},
	abstract = {Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Collusion attack is a cost effective attack against digital fingerprinting where several copies with the same content but different fingerprints are combined to remove the original fingerprints. In this paper, we consider average attack and several nonlinear collusion attacks on independent Gaussian based fingerprints, and study the detection performance of several commonly used detection statistics in the literature under collusion attacks. Observing that these detection statistics are not specifically designed for collusion scenarios and do not take into account the characteristics of the newly generated fingerprints under collusion attacks, we propose pre-processing techniques to improve the detection performance of the detection statistics under collusion attacks.},
	keywords = {analysis;, attacks;, based, collusion, content;, DETECTION, digital, fingerprint, fingerprinting;, fingerprints;, Gaussian, identification;, independent, multimedia, performance;, preprocessing, processes;, redistribution;, security;, statistical, statistics;, systems;, techniques;, Telecommunication, unauthorized},
	doi = {10.1109/ICME.2003.1220890},
	author = {Zhao,Hong and M. Wu and Wang,Z.J. and Liu,K. J.R}
}
