@conference {12471,
	title = {Automatic target recognition based on simultaneous sparse representation},
	booktitle = {Image Processing (ICIP), 2010 17th IEEE International Conference on},
	year = {2010},
	month = {2010/09//},
	pages = {1377 - 1380},
	abstract = {In this paper, an automatic target recognition algorithm is presented based on a framework for learning dictionaries for simultaneous sparse signal representation and feature extraction. The dictionary learning algorithm is based on class supervised simultaneous orthogonal matching pursuit while a matching pursuit-based similarity measure is used for classification. We show how the proposed framework can be helpful for efficient utilization of data, with the possibility of developing real-time, robust target classification. We verify the efficacy of the proposed algorithm using confusion matrices on the well known Comanche forward-looking infrared data set consisting of ten different military targets at different orientations.},
	keywords = {(artificial, algorithm;feature, based, classification;iterative, classification;learning, Comanche, data, dictionary;matching, extraction;image, forward-looking, infrared, intelligence);military, learning, MATCHING, matrix;dictionary, measure;military, methods;learning, orthogonal, pursuit, pursuit;confusion, recognition;class, recognition;target, representation;feature, representation;sparse, set;automatic, signal, similarity, simultaneous, sparse, supervised, systems;object, target, target;simultaneous, tracking;},
	doi = {10.1109/ICIP.2010.5652306},
	author = {Patel, Vishal M. and Nasrabadi,N.M. and Chellapa, Rama}
}
@article {18161,
	title = {Adaptive Detection for Group-Based Multimedia Fingerprinting},
	journal = {Signal Processing Letters, IEEE},
	volume = {14},
	year = {2007},
	month = {2007/12//},
	pages = {964 - 967},
	abstract = {Grouping strategy has been proposed recently to leverage the prior knowledge on collusion pattern to improve collusion resistance in multimedia fingerprinting. However, the improvement is not consistent, as reduced performance of the existing group-based fingerprinting schemes than the non-grouped ones is observed when the grouping does not match the true collusion pattern well. In this letter, we propose a new adaptive detection method, where the threshold for the group detection can be adjusted automatically according to the detection statistics that reflect the underlying collusion pattern. Experimental results show that the proposed adaptive detection outperforms nonadaptive detection and provides consistent performance improvement over non-grouped orthogonal fingerprinting schemes under various collusion scenarios.},
	keywords = {adaptive, computing;security, data;, detection;collusion, detection;group-based, fingerprinting;copy, fingerprinting;grouping, multimedia, of, orthogonal, pattern;detection, protection;multimedia, statistics;group, strategy;nongrouped},
	isbn = {1070-9908},
	doi = {10.1109/LSP.2007.907992},
	author = {He,Shan and M. Wu}
}
@article {18159,
	title = {A Scalable Multiuser Framework for Video Over OFDM Networks: Fairness and Efficiency},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {16},
	year = {2006},
	month = {2006/10//},
	pages = {1217 - 1231},
	abstract = {In this paper, we propose a framework to transmit multiple scalable video programs over downlink multiuser orthogonal frequency division multiplex (OFDM) networks in real time. The framework explores the scalability of the video codec and multidimensional diversity of multiuser OFDM systems to achieve the optimal service objectives subject to constraints on delay and limited system resources. We consider two essential service objectives, namely, the fairness and efficiency. Fairness concerns the video quality deviation among users who subscribe the same quality of service, and efficiency relates to how to attain the highest overall video quality using the available system resources. We formulate the fairness problem as minimizing the maximal end-to-end distortion received among all users and the efficiency problem as minimizing total end-to-end distortion of all users. Fast suboptimal algorithms are proposed to solve the above two optimization problems. The simulation results demonstrated that the proposed fairness algorithm outperforms a time division multiple (TDM) algorithm by 0.5 3 dB in terms of the worst received video quality among all users. In addition, the proposed framework can achieve a desired tradeoff between fairness and efficiency. For achieving the same average video quality among all users, the proposed framework can provide fairer video quality with 1 1.8 dB lower PSNR deviation than a TDM algorithm},
	keywords = {algorithm;video, codec;video, coding;video, communication;, deviation;downlink, deviation;OFDM, distortion;multidimensional, diversity;multiple, division, end-to-end, framework;time, Frequency, modulation;diversity, multiple, multiplex, multiuser, network;efficiency, networks;video, objectives;optimization, of, OFDM, orthogonal, over, problem;fairness, problem;maximal, problems;quality, programs;multiuser, PSNR, QUALITY, reception;image, resolution;optimisation;quality, scalable, service, service;scalable, service;video, systems;optimal, video},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2006.883513},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@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}
}
@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 {18169,
	title = {Anti-collusion of group-oriented fingerprinting},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/07//},
	pages = {II - 217-20 vol.2 - II - 217-20 vol.2},
	abstract = {Digital fingerprinting of multimedia data involves embedding information in the content, and offers protection to the digital rights of the content by allowing illegitimate usage of the content to be identified by authorized parties. One potential threat to fingerprints is collusion, whereby a group of adversaries combine their individual copies in an attempt to remove the underlying fingerprints. Former studies indicate that collusion attacks based on a few dozen independent copies can confound a fingerprinting system that employs orthogonal modulation. However, since an adversary is more likely to collude with some users than other users, we propose a group-based fingerprinting scheme where users likely to collude with each other are assigned correlated fingerprints. We evaluate the performance of our group-based fingerprints by studying the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints. We compare the results to those of fingerprinting systems employing orthogonal modulation.},
	keywords = {anticollusion, attacks;, collusion, communication;, data;, digital, distributed, distribution;, fingerprinting;, fingerprints;, Gaussian, group-oriented, Internet;, method;, modulation;, multimedia, orthogonal, security;, Telecommunication, watermarking;},
	doi = {10.1109/ICME.2003.1221592},
	author = {Wang,Z.J. and M. Wu and Trappe,W. and Liu,K. J.R}
}
@conference {18266,
	title = {Resistance of orthogonal Gaussian fingerprints to collusion attacks},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {1},
	year = {2003},
	month = {2003/07//},
	pages = {I - 617-20 vol.1 - I - 617-20 vol.1},
	abstract = {Digital fingerprinting is a means to offer protection to digital data by which fingerprints embedded in the multimedia are capable of identifying unauthorized use of digital content. A powerful attack that can be employed to reduce this tracing capability is collusion. In this paper, we study the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints and orthogonal modulation. We propose a likelihood-based approach to estimate the number of colluders, and introduce the thresholding detector for colluder identification. We first analyze the collusion resistance of a system to the average attack by considering the probability of a false negative and the probability of a false positive when identifying colluders. Lower and upper bounds for the maximum number of colluders K<sub>max</sub> are derived. We then show that the detectors are robust to different attacks. We further study different sets of performance criteria.},
	keywords = {approach;, attacks;, capability;, collusion, data, data;, digital, distributed, embedded, fingerprinting;, fingerprints;, Gaussian, likelihood-based, modulation;, multimedia, of, orthogonal, probability;, processes;, protection;, Security, systems;, tracing},
	doi = {10.1109/ICME.2003.1220993},
	author = {Wang,Z.J. and M. Wu and Zhao,Hong and Liu,K. J.R and Trappe,W.}
}
@article {17727,
	title = {On the stability of sequential updates and downdates},
	journal = {Signal Processing, IEEE Transactions on},
	volume = {43},
	year = {1995},
	month = {1995/11//},
	pages = {2642 - 2648},
	abstract = {The updating and downdating of Cholesky decompositions has important applications in a number of areas. There is essentially one standard updating algorithm, based on plane rotations, which is backward stable. Three downdating algorithms have been treated in the literature: the LINPACK algorithm, the method of hyperbolic transformations, and Chambers{\textquoteright} (1971) algorithm. Although none of these algorithms is backward stable, the first and third satisfy a relational stability condition. It is shown that relational stability extends to a sequence of updates and downdates. In consequence, other things being equal, if the final decomposition in the sequence is well conditioned, it will be accurately computed, even though intermediate decompositions may be almost completely inaccurate. These results are also applied to the two-sided orthogonal decompositions, such as the URV decomposition},
	keywords = {algorithm;Cholesky, algorithm;downdating, algorithm;error, algorithm;URV, algorithms;hyperbolic, analysis;matrix, analysis;sequential, Chambers{\textquoteright}, condition;rounding, decomposition;backward, decomposition;numerical, decomposition;plane, decompositions;LINPACK, decompositions;updating, downdates;sequential, error, errors;sequences;, orthogonal, rotations;relational, stability, stability;roundoff, stable, transformations;matrix, updates;stability;two-sided},
	isbn = {1053-587X},
	doi = {10.1109/78.482114},
	author = {Stewart, G.W.}
}
