@conference {14989,
	title = {Monitoring distributed collections using the Audit Control Environment (ACE)},
	booktitle = {Proceedings of the 2010 Roadmap for Digital Preservation Interoperability Framework Workshop},
	series = {US-DPIF {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {13:1{\textendash}13:5 - 13:1{\textendash}13:5},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The Audit Control Environment (ACE) is a system which provides a scalable, auditable platform that actively monitors collections to ensure their integrity over the lifetime of an archive. It accomplishes this by using a small integrity token issued for each monitored item. This token is part of a larger externally auditable cryptographic system. We will describe how this system has been implemented for a set of applications designed to run in an archive or library environment. ACE has been used for almost two years by the Chronopolis Preservation Environment to monitor the integrity of collections replicated between the three independent archive partners. During this time, ACE has been expanded to better support the requirements of this distributed archive. We will describe how ACE has been used and expanded to support the Chronopolis preservation requirements. We conclude by discussing several future requirements for integrity monitoring that have been identified by users of ACE. These include securely monitoring remote data, monitoring offline data, and scaling monitoring activities in a way that does not impact the normal operational activity of an archive.},
	keywords = {digital, preservation},
	isbn = {978-1-4503-0109-1},
	doi = {10.1145/2039274.2039287},
	url = {http://doi.acm.org/10.1145/2039274.2039287},
	author = {Smorul,Michael and Song,Sangchul and JaJa, Joseph F.}
}
@conference {12648,
	title = {Algorithmic and architectural design methodology for particle filters in hardware},
	booktitle = {Computer Design: VLSI in Computers and Processors, 2005. ICCD 2005. Proceedings. 2005 IEEE International Conference on},
	year = {2005},
	month = {2005/10//},
	pages = {275 - 280},
	abstract = {In this paper, we present algorithmic and architectural methodology for building particle filters in hardware. Particle filtering is a new paradigm for filtering in presence of nonGaussian nonlinear state evolution and observation models. This technique has found wide-spread application in tracking, navigation, detection problems especially in a sensing environment. So far most particle filtering implementations are not lucrative for real time problems due to excessive computational complexity involved. In this paper, we re-derive the particle filtering theory to make it more amenable to simplified VLSI implementations. Furthermore, we present and analyze pipelined architectural methodology for designing these computational blocks. Finally, we present an application using the bearing only tracking problem and evaluate the proposed architecture and algorithmic methodology.},
	keywords = {(numerical, algorithmic, architectural, architectures;, bearing, complexity;, computational, design, digital, evolution;, Filtering, filtering;, filters;, implementation;, methodology;, methods);, nonGaussian, nonlinear, only, Parallel, particle, pipeline, pipelined, problem;, processing;, state, tracking, VLSI, VLSI;},
	doi = {10.1109/ICCD.2005.20},
	author = {Sankaranarayanan,A. C and Chellapa, Rama and Srivastava, A.}
}
@conference {18227,
	title = {Improving collusion resistance of error correcting code based multimedia fingerprinting},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/1029 - ii/1032 Vol. 2 - ii/1029 - ii/1032 Vol. 2},
	abstract = {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.},
	keywords = {based, code, codes;, coding;, collusion, correcting, correction, data;, detection;, digital, ECC;, embedding;, error, fingerprint, fingerprinting, fingerprinting;, multimedia, of, permuted, resistance;, Security, signatures;, subsegment, systems;},
	doi = {10.1109/ICASSP.2005.1415583},
	author = {He,Shan and M. Wu}
}
@article {18163,
	title = {An interactive and team approach to multimedia design curriculum},
	journal = {Signal Processing Magazine, IEEE},
	volume = {22},
	year = {2005},
	month = {2005/11//},
	pages = {14 - 19},
	abstract = {Over the past decade, increasingly powerful technologies have made it easier to compress, distribute, and store multimedia content. The merger of computing and communications has created a ubiquitous infrastructure that brings digital multimedia closer to the users and opens up tremendous educational and commercial opportunities in multimedia content creation, delivery, rendering, and archiving for millions of users worldwide. Multimedia has become a basic skill demanded by an increasing number of potential jobs for electrical engineering/computer science graduates. In this article, the authors intend to share their experiences and new ways of thinking about curriculum development. It is beneficial for colleagues in the multimedia signal processing areas for use in developing or revising the curriculum to fit the needs and resources of their own programs.},
	keywords = {approach;, communication;, courses;, curriculum, curriculum;, design, development;, digital, education;, educational, interactive, learning;, multimedia, multimedia;, processing;, signal, team},
	isbn = {1053-5888},
	doi = {10.1109/MSP.2005.1550186},
	author = {M. Wu and Liu,K. J.R}
}
@conference {14986,
	title = {Mitigating risk of data loss in preservation environments},
	booktitle = {Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on},
	year = {2005},
	month = {2005/04//},
	pages = {39 - 48},
	abstract = {Preservation environments manage digital records for time periods that are much longer than that of a single vendor product. A primary requirement is the preservation of the authenticity and integrity of the digital records while simultaneously minimizing the cost of long-term storage, as the data is migrated onto successive generations of technology. The emergence of low-cost storage hardware has made it possible to implement innovative software systems that minimize risk of data loss and preserve authenticity and integrity. This paper describes software mechanisms in use in current persistent archives and presents an example based upon the NARA research prototype persistent archive.},
	keywords = {archives;, authentication;, authenticity;, computing;, data, databases;, digital, distributed, environment;, Grid, integrity;, management;, message, objects;, persistent, preservation, record, risk, storage},
	doi = {10.1109/MSST.2005.20},
	author = {Moore,R.W. and JaJa, Joseph F. and Chadduck,R.}
}
@conference {13192,
	title = {Pedestrian classification from moving platforms using cyclic motion pattern},
	booktitle = {Image Processing, 2005. ICIP 2005. IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/09//},
	pages = {II - 854-7 - II - 854-7},
	abstract = {This paper describes an efficient pedestrian detection system for videos acquired from moving platforms. Given a detected and tracked object as a sequence of images within a bounding box, we describe the periodic signature of its motion pattern using a twin-pendulum model. Then a principle gait angle is extracted in every frame providing gait phase information. By estimating the periodicity from the phase data using a digital phase locked loop (dPLL), we quantify the cyclic pattern of the object, which helps us to continuously classify it as a pedestrian. Past approaches have used shape detectors applied to a single image or classifiers based on human body pixel oscillations, but ours is the first to integrate a global cyclic motion model and periodicity analysis. Novel contributions of this paper include: i) development of a compact shape representation of cyclic motion as a signature for a pedestrian, ii) estimation of gait period via a feedback loop module, and iii) implementation of a fast online pedestrian classification system which operates on videos acquired from moving platforms.},
	keywords = {analysis;, angle;, body, classification;, compact, cyclic, DETECTION, detection;, digital, Feedback, Gait, human, image, information;, locked, loop, loop;, loops;, module;, MOTION, object, oscillations;, pattern;, pedestrian, phase, Pixel, principle, representation;, sequence;, sequences;, SHAPE, system;},
	doi = {10.1109/ICIP.2005.1530190},
	author = {Yang Ran and Qinfen Zheng and Weiss, I. and Davis, Larry S. and Abd-Almageed, Wael and Liang Zhao}
}
@conference {18280,
	title = {Security of feature extraction in image hashing},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/1041 - ii/1044 Vol. 2 - ii/1041 - ii/1044 Vol. 2},
	abstract = {Security and robustness are two important requirements for image hash functions. We introduce "differential entropy" as a metric to quantify the amount of randomness in image hash functions and to study their security. We present a mathematical framework and derive expressions for the proposed security metric for various common image hashing schemes. Using the proposed security metric, we discuss the trade-offs between security and robustness in image hashing.},
	keywords = {cryptography;, differential, digital, entropy;, extraction;, feature, functions;, hash, hashing;, image, metric;, processing;, randomness;, robustness;, Security, signature;, signatures;},
	doi = {10.1109/ICASSP.2005.1415586},
	author = {Swaminathan,A. and Mao,Yinian and M. Wu}
}
@conference {12706,
	title = {3D model refinement using surface-parallax},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/05//},
	pages = {iii - 285-8 vol.3 - iii - 285-8 vol.3},
	abstract = {We present an approach to update and refine coarse 3D models of urban environments from a sequence of intensity images using surface parallax. This generalizes the plane-parallax recovery methods to surface-parallax using arbitrary surfaces. A coarse and potentially incomplete depth map of the scene obtained from a digital elevation map (DEM) is used as a reference surface which is refined and updated using this approach. The reference depth map is used to estimate the camera motion and the motion of the 3D points on the reference surface is compensated. The resulting parallax, which is an epipolar field, is estimated using an adaptive windowing technique and used to obtain the refined depth map.},
	keywords = {3D, adaptive, arbitrary, camera, coarse, compensation;, Computer, DEM;, depth, digital, ELEVATION, environments;, epipolar, estimation;, field;, image, incomplete, INTENSITY, map;, model, MOTION, parallax;, plane-parallax, reconstruction;, recovery;, refinement;, sequence;, sequences;, surface, surfaces;, urban, vision;, windowing;},
	doi = {10.1109/ICASSP.2004.1326537},
	author = {Agrawala, Ashok K. and Chellapa, Rama}
}
@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 {18187,
	title = {Data hiding in binary image for authentication and annotation},
	journal = {Multimedia, IEEE Transactions on},
	volume = {6},
	year = {2004},
	month = {2004/08//},
	pages = {528 - 538},
	abstract = {This paper proposes a new method to embed data in binary images, including scanned text, figures, and signatures. The method manipulates "flippable" pixels to enforce specific block-based relationship in order to embed a significant amount of data without causing noticeable artifacts. Shuffling is applied before embedding to equalize the uneven embedding capacity from region to region. The hidden data can be extracted without using the original image, and can also be accurately extracted after high quality printing and scanning with the help of a few registration marks. The proposed data embedding method can be used to detect unauthorized use of a digitized signature, and annotate or authenticate binary documents. The paper also presents analysis and discussions on robustness and security issues.},
	keywords = {annotation;, authentication;, binary, coding;, data, digital, digitized, document, EMBEDDING, encapsulation;, extraction;, feature, hiding;, image, image;, method;, signature;, unauthorized, user;, watermarking;},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2004.830814},
	author = {M. Wu and Liu,Bede}
}
@conference {18190,
	title = {Data hiding in curves for collusion-resistant digital fingerprinting},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {1},
	year = {2004},
	month = {2004/10//},
	pages = {51 - 54 Vol. 1 - 51 - 54 Vol. 1},
	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 in the coordinates of the B-spline control points. We demonstrate through experiments the robustness of the proposed data hiding algorithm against printing-and-scanning and collusions, and show its feasibility for collusion-resistant fingerprinting of topographic maps as well as writings/drawings from pen-based input devices.},
	keywords = {(mathematics);, B-spline, coding;, collusion-resistant, CONTROL, data, devices;, digital, document, encapsulation;, extraction;, feature, fingerprinting;, hiding;, image, INPUT, maps;, model;, pen-based, points;, printing-and-scanning, processing;, robustness;, sequence;, spectrum, splines, spread, topographic, watermarking;},
	doi = {10.1109/ICIP.2004.1418687},
	author = {Gou,Hongmei and M. Wu}
}
@conference {12687,
	title = {Robust ego-motion estimation and 3D model refinement using depth based parallax model},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {4},
	year = {2004},
	month = {2004/10//},
	pages = {2483 - 2486 Vol. 4 - 2483 - 2486 Vol. 4},
	abstract = {We present an iterative algorithm for robustly estimating the ego-motion and refining and updating a coarse, noisy and partial depth map using a depth based parallax model and brightness derivatives extracted from an image pair. Given a coarse, noisy and partial depth map acquired by a range-finder or obtained from a Digital Elevation Map (DFM), we first estimate the ego-motion by combining a global ego-motion constraint and a local brightness constancy constraint. Using the estimated camera motion and the available depth map estimate, motion of the 3D points is compensated. We utilize the fact that the resulting surface parallax field is an epipolar field and knowing its direction from the previous motion estimates, estimate its magnitude and use it to refine the depth map estimate. Instead of assuming a smooth parallax field or locally smooth depth models, we locally model the parallax magnitude using the depth map, formulate the problem as a generalized eigen-value analysis and obtain better results. In addition, confidence measures for depth estimates are provided which can be used to remove regions with potentially incorrect (and outliers in) depth estimates for robustly estimating ego-motion in the next iteration. Results on both synthetic and real examples are presented.},
	keywords = {3D, algorithm;, analysis;, and, based, camera;, coarse, compensation;, DEM;, depth, digital, ego-motion, eigen-value, eigenfunctions;, eigenvalues, ELEVATION, epipolar, estimation;, extraction;, feature, field;, iteration, iterative, map;, method;, methods;, model, model;, MOTION, parallax, partial, range-finding;, refinement;, refining;, surface},
	doi = {10.1109/ICIP.2004.1421606},
	author = {Agrawala, Ashok K. 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 {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 {15133,
	title = {Efficiency improvements for signature schemes with tight security reductions},
	booktitle = {Proceedings of the 10th ACM conference on Computer and communications security},
	series = {CCS {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {155 - 164},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Much recent work has focused on constructing efficient digital signature schemes whose security is tightly related to the hardness of some underlying cryptographic assumption. With this motivation in mind, we show here two approaches which improve both the computational efficiency and signature length of some recently-proposed schemes:Diffie-Hellman signatures. Goh and Jarecki [18] recently analyzed a signature scheme which has a tight security reduction to the computational Diffie-Hellman problem. Unfortunately, their scheme is less efficient in both computation and bandwidth than previous schemes relying on the (related) discrete logarithm assumption. We present a modification of their scheme in which signing is 33\% more efficient and signatures are 75\% shorter; the security of this scheme is tightly related to the decisional Diffie-Hellman problem.PSS. The probabilistic signature scheme (PSS) designed by Bellare and Rogaway [3] uses a random salt to enable a tight security reduction to, e.g., the RSA problem. Coron [12] subsequently showed that a shorter random salt can be used without impacting the security of the scheme. We show a variant of PSS which avoids the random salt altogether yet has an equally-tight security reduction. This furthermore yields a version of PSS-R (PSS with message recovery) with optimal message length. Our technique may also be used to improve the efficiency of a number of other schemes.},
	keywords = {digital, SIGNATURES},
	isbn = {1-58113-738-9},
	doi = {10.1145/948109.948132},
	url = {http://doi.acm.org/10.1145/948109.948132},
	author = {Katz, Jonathan and Wang,Nan}
}
@article {18234,
	title = {Joint security and robustness enhancement for quantization based data embedding},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {13},
	year = {2003},
	month = {2003/08//},
	pages = {831 - 841},
	abstract = {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.},
	keywords = {(signal);, authentication;, binary, compensation;, data, data;, DETECTION, digital, distortion, distortion;, embedding;, encapsulation;, enhancement;, error, features;, hiding;, lookup, lookup;, LUT;, message, multimedia, nontrivial, probability;, quantisation, quantization, quantized, Robustness, run, Security, statistics;, systems;, table, table;, watermarking;},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2003.815951},
	author = {Wu,M.}
}
@conference {18258,
	title = {Nonlinear collusion attacks on independent fingerprints for multimedia},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {5},
	year = {2003},
	month = {2003/04//},
	pages = {V - 664-7 vol.5 - V - 664-7 vol.5},
	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 investigate average and nonlinear collusion attacks of independent Gaussian fingerprints and study both their effectiveness and the perceptual quality. We also propose the bounded Gaussian fingerprints to improve the perceptual quality of the fingerprinted copies. We further discuss the tradeoff between the robustness against collusion attacks and the perceptual quality of a fingerprinting system.},
	keywords = {attacks;, average, bounded, collusion, computing;, content, copies;, digital, distribution;, fingerprinted, fingerprinting;, fingerprints;, Gaussian, independent, multimedia, nonlinear, perceptual, quality;, robustness;, watermarking;},
	doi = {10.1109/ICASSP.2003.1200058},
	author = {Zhao,Hong and M. Wu and Wang,Z.J. and Liu,K. J.R}
}
@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}
}
@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.}
}
@conference {18166,
	title = {Anti-collusion codes: multi-user and multimedia perspectives},
	booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on},
	volume = {2},
	year = {2002},
	month = {2002///},
	pages = {II-149 - II-152 vol.2 - II-149 - II-152 vol.2},
	abstract = {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.},
	keywords = {and, anti-collusion, authentication;, binary, code, codes;, coding;, combinatorial, computing;, content;, data, designs;, digital, embedding;, encapsulation;, fingerprinting;, image, images;, logical, mathematics;, message, Modulation, modulation;, multimedia, operation;, performance;, watermarking;},
	doi = {10.1109/ICIP.2002.1039909},
	author = {Trappe,W. and M. Wu and Liu,K. J.R}
}
@conference {18164,
	title = {Analysis of attacks on SDMI audio watermarks},
	booktitle = {Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP {\textquoteright}01). 2001 IEEE International Conference on},
	volume = {3},
	year = {2001},
	month = {2001///},
	pages = {1369 -1372 vol.3 - 1369 -1372 vol.3},
	abstract = {This paper explains and analyzes the successful attacks submitted by the authors on four audio watermark proposals during a 3-week SDMI public challenge. Our analysis points out some weaknesses in the watermark techniques currently under SDMI consideration and suggests directions for further improvement. The paper also discusses the framework and strategies for analyzing the robustness and security of watermarking systems as well as the difficulty, uniqueness, and unrealistic expectations of the attack setup},
	keywords = {attacks;watermark, audio, coding;copy, digital, encapsulation;, Initiative;attack, Music, protection;data, SDMI, setup;robustness;security;successful, watermarks;Secure, weaknesses;audio},
	doi = {10.1109/ICASSP.2001.941183},
	author = {M. Wu and Craver,S. and Felten,E.W. and Liu,B.}
}
@conference {18288,
	title = {Video access control via multi-level data hiding},
	booktitle = {Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on},
	volume = {1},
	year = {2000},
	month = {2000///},
	pages = {381 -384 vol.1 - 381 -384 vol.1},
	abstract = {The paper proposes novel data hiding algorithms and system design for high quality digital video. Instead of targeting on a single degree of robustness, which results in overestimation and/or underestimation of the noise conditions, we apply multi-level embedding to digital video to achieve more than one level of robustness-capacity tradeoff. In addition, an adaptive technique is proposed to determine how many bits are embedded in each part of the video. Besides user data, control information such as synchronization and the number of hidden user bits are embedded as well. The algorithm can be used for applications such as access control},
	keywords = {access, adaptive, algorithms;hidden, bits;high, conditions;robustness;robustness-capacity, control;adaptive, data, data;video, design;user, digital, embedding;noise, encapsulation;multimedia, hiding, hiding;multi-level, information;data, processing;, QUALITY, signal, systems;authorisation;data, systems;video, technique;control, tradeoff;system, user, video;multi-level},
	doi = {10.1109/ICME.2000.869620},
	author = {M. Wu and Yu,Hong Heather}
}
@article {15049,
	title = {VLSI implementation of a tree searched vector quantizer},
	journal = {Signal Processing, IEEE Transactions on},
	volume = {41},
	year = {1993},
	month = {1993/02//},
	pages = {901 - 905},
	abstract = {The VLSI design and implementation of a tree-searched vector quantizer is presented. The number of processors needed is equal to the depth of the tree. All processors are identical, and data flow between processors is regular. No global control signals are needed. The processors have been fabricated using 2 mu;m <e1>N</e1>-well process on a 7.9 times;9.2 mm die. Each processor chip contains 25000 transistors and has 84 pins. The processors have been thoroughly tested at a clock frequency of 20 MHz},
	keywords = {(mathematics);, 2, 20, chips;, coding;, compression;, data, design;, digital, image, implementation;, MHz;, micron;, PROCESSING, quantisation;, quantizer;, searched, signal, tree, TREES, vector, VLSI, VLSI;},
	isbn = {1053-587X},
	doi = {10.1109/78.193225},
	author = {Kolagotla,R. K. and Yu,S.-S. and JaJa, Joseph F.}
}
@article {15047,
	title = {VLSI architectures for multidimensional transforms},
	journal = {Computers, IEEE Transactions on},
	volume = {40},
	year = {1991},
	month = {1991/09//},
	pages = {1053 - 1057},
	abstract = {The authors propose a family of VLSI architectures with area-time tradeoffs for computing (<e1>N</e1> times;<e1>N</e1> times; . . . times;<e1>N</e1>) <e1>d</e1>-dimensional linear separable transforms. For fixed-precision arithmetic with <e1>b</e1> bits, the architectures have an area <e1>A</e1>=<e1>O</e1>(<e1>N</e1><sup>d+2a</sup>) and computation time <e1>T</e1>=<e1>O</e1>(<e1>dN</e1><sup>d/2-a</sup><e1>b </e1>), and achieve the <e1>AT</e1><sup>2</sup> bound of <e1>AT</e1><sup>2</sup>=<e1>O</e1>(<e1>n</e1><sup>2</sup><e1>b</e1> <sup>2</sup>) for constant <e1>d</e1>, where <e1>n</e1>=<e1>N</e1><sup>d </sup> and <e1>O</e1> lt;<e1>a</e1> les;<e1>d</e1>/2},
	keywords = {architecture;, architectures;, arithmetic;, complexity;, computational, Computer, digital, fixed-precision, linear, multidimensional, separable, transforms;, VLSI},
	isbn = {0018-9340},
	doi = {10.1109/12.83648},
	author = {Chakrabarti,C. and JaJa, Joseph F.}
}
