TY - CONF
T1 - Monitoring distributed collections using the Audit Control Environment (ACE)
T2 - Proceedings of the 2010 Roadmap for Digital Preservation Interoperability Framework Workshop
Y1 - 2010
A1 - Smorul,Michael
A1 - Song,Sangchul
A1 - JaJa, Joseph F.
KW - digital
KW - preservation
AB - 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.
JA - Proceedings of the 2010 Roadmap for Digital Preservation Interoperability Framework Workshop
T3 - US-DPIF '10
PB - ACM
CY - New York, NY, USA
SN - 978-1-4503-0109-1
UR - http://doi.acm.org/10.1145/2039274.2039287
M3 - 10.1145/2039274.2039287
ER -
TY - CONF
T1 - Algorithmic and architectural design methodology for particle filters in hardware
T2 - Computer Design: VLSI in Computers and Processors, 2005. ICCD 2005. Proceedings. 2005 IEEE International Conference on
Y1 - 2005
A1 - Sankaranarayanan,A. C
A1 - Chellapa, Rama
A1 - Srivastava, A.
KW - (numerical
KW - algorithmic
KW - architectural
KW - architectures;
KW - bearing
KW - complexity;
KW - computational
KW - design
KW - digital
KW - evolution;
KW - Filtering
KW - filtering;
KW - filters;
KW - implementation;
KW - methodology;
KW - methods);
KW - nonGaussian
KW - nonlinear
KW - only
KW - Parallel
KW - particle
KW - pipeline
KW - pipelined
KW - problem;
KW - processing;
KW - state
KW - tracking
KW - VLSI
KW - VLSI;
AB - 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.
JA - Computer Design: VLSI in Computers and Processors, 2005. ICCD 2005. Proceedings. 2005 IEEE International Conference on
M3 - 10.1109/ICCD.2005.20
ER -
TY - CONF
T1 - Improving collusion resistance of error correcting code based multimedia fingerprinting
T2 - Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on
Y1 - 2005
A1 - He,Shan
A1 - M. Wu
KW - based
KW - code
KW - codes;
KW - coding;
KW - collusion
KW - correcting
KW - correction
KW - data;
KW - detection;
KW - digital
KW - ECC;
KW - embedding;
KW - error
KW - fingerprint
KW - fingerprinting
KW - fingerprinting;
KW - multimedia
KW - of
KW - permuted
KW - resistance;
KW - Security
KW - signatures;
KW - subsegment
KW - systems;
AB - 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.
JA - Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on
VL - 2
M3 - 10.1109/ICASSP.2005.1415583
ER -
TY - JOUR
T1 - An interactive and team approach to multimedia design curriculum
JF - Signal Processing Magazine, IEEE
Y1 - 2005
A1 - M. Wu
A1 - Liu,K. J.R
KW - approach;
KW - communication;
KW - courses;
KW - curriculum
KW - curriculum;
KW - design
KW - development;
KW - digital
KW - education;
KW - educational
KW - interactive
KW - learning;
KW - multimedia
KW - multimedia;
KW - processing;
KW - signal
KW - team
AB - 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.
VL - 22
SN - 1053-5888
CP - 6
M3 - 10.1109/MSP.2005.1550186
ER -
TY - CONF
T1 - Mitigating risk of data loss in preservation environments
T2 - Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on
Y1 - 2005
A1 - Moore,R.W.
A1 - JaJa, Joseph F.
A1 - Chadduck,R.
KW - archives;
KW - authentication;
KW - authenticity;
KW - computing;
KW - data
KW - databases;
KW - digital
KW - distributed
KW - environment;
KW - Grid
KW - integrity;
KW - management;
KW - message
KW - objects;
KW - persistent
KW - preservation
KW - record
KW - risk
KW - storage
AB - 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.
JA - Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on
M3 - 10.1109/MSST.2005.20
ER -
TY - CONF
T1 - Pedestrian classification from moving platforms using cyclic motion pattern
T2 - Image Processing, 2005. ICIP 2005. IEEE International Conference on
Y1 - 2005
A1 - Yang Ran
A1 - Qinfen Zheng
A1 - Weiss, I.
A1 - Davis, Larry S.
A1 - Abd-Almageed, Wael
A1 - Liang Zhao
KW - analysis;
KW - angle;
KW - body
KW - classification;
KW - compact
KW - cyclic
KW - DETECTION
KW - detection;
KW - digital
KW - Feedback
KW - Gait
KW - human
KW - image
KW - information;
KW - locked
KW - loop
KW - loop;
KW - loops;
KW - module;
KW - MOTION
KW - object
KW - oscillations;
KW - pattern;
KW - pedestrian
KW - phase
KW - Pixel
KW - principle
KW - representation;
KW - sequence;
KW - sequences;
KW - SHAPE
KW - system;
AB - 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.
JA - Image Processing, 2005. ICIP 2005. IEEE International Conference on
VL - 2
M3 - 10.1109/ICIP.2005.1530190
ER -
TY - CONF
T1 - Security of feature extraction in image hashing
T2 - Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on
Y1 - 2005
A1 - Swaminathan,A.
A1 - Mao,Yinian
A1 - M. Wu
KW - cryptography;
KW - differential
KW - digital
KW - entropy;
KW - extraction;
KW - feature
KW - functions;
KW - hash
KW - hashing;
KW - image
KW - metric;
KW - processing;
KW - randomness;
KW - robustness;
KW - Security
KW - signature;
KW - signatures;
AB - 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.
JA - Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on
VL - 2
M3 - 10.1109/ICASSP.2005.1415586
ER -
TY - CONF
T1 - 3D model refinement using surface-parallax
T2 - Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on
Y1 - 2004
A1 - Agrawala, Ashok K.
A1 - Chellapa, Rama
KW - 3D
KW - adaptive
KW - arbitrary
KW - camera
KW - coarse
KW - compensation;
KW - Computer
KW - DEM;
KW - depth
KW - digital
KW - ELEVATION
KW - environments;
KW - epipolar
KW - estimation;
KW - field;
KW - image
KW - incomplete
KW - INTENSITY
KW - map;
KW - model
KW - MOTION
KW - parallax;
KW - plane-parallax
KW - reconstruction;
KW - recovery;
KW - refinement;
KW - sequence;
KW - sequences;
KW - surface
KW - surfaces;
KW - urban
KW - vision;
KW - windowing;
AB - 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.
JA - Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on
VL - 3
M3 - 10.1109/ICASSP.2004.1326537
ER -
TY - JOUR
T1 - Collusion-resistant fingerprinting for multimedia
JF - Signal Processing Magazine, IEEE
Y1 - 2004
A1 - M. Wu
A1 - Trappe,W.
A1 - Wang,Z.J.
A1 - Liu,K. J.R
KW - attacks;
KW - colluder
KW - collusion
KW - collusion-resistant
KW - content;
KW - correlated
KW - data;
KW - digital
KW - fingerprinting;
KW - identification;
KW - multimedia
KW - multiuser
KW - of
KW - orthogonal
KW - policies;
KW - rights
KW - Security
KW - systems;
KW - techniques;
KW - tracing;
KW - watermarking
KW - watermarking;
AB - 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'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.
VL - 21
SN - 1053-5888
CP - 2
M3 - 10.1109/MSP.2004.1276103
ER -
TY - JOUR
T1 - Data hiding in binary image for authentication and annotation
JF - Multimedia, IEEE Transactions on
Y1 - 2004
A1 - M. Wu
A1 - Liu,Bede
KW - annotation;
KW - authentication;
KW - binary
KW - coding;
KW - data
KW - digital
KW - digitized
KW - document
KW - EMBEDDING
KW - encapsulation;
KW - extraction;
KW - feature
KW - hiding;
KW - image
KW - image;
KW - method;
KW - signature;
KW - unauthorized
KW - user;
KW - watermarking;
AB - 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.
VL - 6
SN - 1520-9210
CP - 4
M3 - 10.1109/TMM.2004.830814
ER -
TY - CONF
T1 - Data hiding in curves for collusion-resistant digital fingerprinting
T2 - Image Processing, 2004. ICIP '04. 2004 International Conference on
Y1 - 2004
A1 - Gou,Hongmei
A1 - M. Wu
KW - (mathematics);
KW - B-spline
KW - coding;
KW - collusion-resistant
KW - CONTROL
KW - data
KW - devices;
KW - digital
KW - document
KW - encapsulation;
KW - extraction;
KW - feature
KW - fingerprinting;
KW - hiding;
KW - image
KW - INPUT
KW - maps;
KW - model;
KW - pen-based
KW - points;
KW - printing-and-scanning
KW - processing;
KW - robustness;
KW - sequence;
KW - spectrum
KW - splines
KW - spread
KW - topographic
KW - watermarking;
AB - 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.
JA - Image Processing, 2004. ICIP '04. 2004 International Conference on
VL - 1
M3 - 10.1109/ICIP.2004.1418687
ER -
TY - CONF
T1 - Robust ego-motion estimation and 3D model refinement using depth based parallax model
T2 - Image Processing, 2004. ICIP '04. 2004 International Conference on
Y1 - 2004
A1 - Agrawala, Ashok K.
A1 - Chellapa, Rama
KW - 3D
KW - algorithm;
KW - analysis;
KW - and
KW - based
KW - camera;
KW - coarse
KW - compensation;
KW - DEM;
KW - depth
KW - digital
KW - ego-motion
KW - eigen-value
KW - eigenfunctions;
KW - eigenvalues
KW - ELEVATION
KW - epipolar
KW - estimation;
KW - extraction;
KW - feature
KW - field;
KW - iteration
KW - iterative
KW - map;
KW - method;
KW - methods;
KW - model
KW - model;
KW - MOTION
KW - parallax
KW - partial
KW - range-finding;
KW - refinement;
KW - refining;
KW - surface
AB - 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.
JA - Image Processing, 2004. ICIP '04. 2004 International Conference on
VL - 4
M3 - 10.1109/ICIP.2004.1421606
ER -
TY - JOUR
T1 - Anti-collusion fingerprinting for multimedia
JF - Signal Processing, IEEE Transactions on
Y1 - 2003
A1 - Trappe,W.
A1 - M. Wu
A1 - Wang,Z.J.
A1 - Liu,K. J.R
KW - (mathematics);
KW - additive
KW - algorithm;
KW - and
KW - anti-collusion
KW - attack;
KW - averaging
KW - binary
KW - code
KW - codes;
KW - codevectors;
KW - coding;
KW - colluders
KW - collusion;
KW - combinatorial
KW - communication;
KW - compression;
KW - correlation;
KW - cost-effective
KW - data
KW - data;
KW - design
KW - DETECTION
KW - detection;
KW - digital
KW - embedding;
KW - fingerprinting;
KW - Gaussian
KW - identification;
KW - image
KW - images;
KW - keying;
KW - logical
KW - mathematics;
KW - Modulation
KW - modulation;
KW - multimedia
KW - multimedia;
KW - of
KW - on-off
KW - operation;
KW - orthogonal
KW - processes;
KW - real
KW - redistribution;
KW - Security
KW - signal
KW - signals;
KW - theory;
KW - tree-structured
KW - TREES
KW - watermarking;
AB - 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.
VL - 51
SN - 1053-587X
CP - 4
M3 - 10.1109/TSP.2003.809378
ER -
TY - CONF
T1 - Anti-collusion of group-oriented fingerprinting
T2 - Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on
Y1 - 2003
A1 - Wang,Z.J.
A1 - M. Wu
A1 - Trappe,W.
A1 - Liu,K. J.R
KW - anticollusion
KW - attacks;
KW - collusion
KW - communication;
KW - data;
KW - digital
KW - distributed
KW - distribution;
KW - fingerprinting;
KW - fingerprints;
KW - Gaussian
KW - group-oriented
KW - Internet;
KW - method;
KW - modulation;
KW - multimedia
KW - orthogonal
KW - security;
KW - Telecommunication
KW - watermarking;
AB - 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.
JA - Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on
VL - 2
M3 - 10.1109/ICME.2003.1221592
ER -
TY - CONF
T1 - Efficiency improvements for signature schemes with tight security reductions
T2 - Proceedings of the 10th ACM conference on Computer and communications security
Y1 - 2003
A1 - Katz, Jonathan
A1 - Wang,Nan
KW - digital
KW - SIGNATURES
AB - 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.
JA - Proceedings of the 10th ACM conference on Computer and communications security
T3 - CCS '03
PB - ACM
CY - New York, NY, USA
SN - 1-58113-738-9
UR - http://doi.acm.org/10.1145/948109.948132
M3 - 10.1145/948109.948132
ER -
TY - JOUR
T1 - Joint security and robustness enhancement for quantization based data embedding
JF - Circuits and Systems for Video Technology, IEEE Transactions on
Y1 - 2003
A1 - Wu,M.
KW - (signal);
KW - authentication;
KW - binary
KW - compensation;
KW - data
KW - data;
KW - DETECTION
KW - digital
KW - distortion
KW - distortion;
KW - embedding;
KW - encapsulation;
KW - enhancement;
KW - error
KW - features;
KW - hiding;
KW - lookup
KW - lookup;
KW - LUT;
KW - message
KW - multimedia
KW - nontrivial
KW - probability;
KW - quantisation
KW - quantization
KW - quantized
KW - Robustness
KW - run
KW - Security
KW - statistics;
KW - systems;
KW - table
KW - table;
KW - watermarking;
AB - 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.
VL - 13
SN - 1051-8215
CP - 8
M3 - 10.1109/TCSVT.2003.815951
ER -
TY - CONF
T1 - Nonlinear collusion attacks on independent fingerprints for multimedia
T2 - Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on
Y1 - 2003
A1 - Zhao,Hong
A1 - M. Wu
A1 - Wang,Z.J.
A1 - Liu,K. J.R
KW - attacks;
KW - average
KW - bounded
KW - collusion
KW - computing;
KW - content
KW - copies;
KW - digital
KW - distribution;
KW - fingerprinted
KW - fingerprinting;
KW - fingerprints;
KW - Gaussian
KW - independent
KW - multimedia
KW - nonlinear
KW - perceptual
KW - quality;
KW - robustness;
KW - watermarking;
AB - 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.
JA - Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on
VL - 5
M3 - 10.1109/ICASSP.2003.1200058
ER -
TY - CONF
T1 - Performance of detection statistics under collusion attacks on independent multimedia fingerprints
T2 - Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on
Y1 - 2003
A1 - Zhao,Hong
A1 - M. Wu
A1 - Wang,Z.J.
A1 - Liu,K. J.R
KW - analysis;
KW - attacks;
KW - based
KW - collusion
KW - content;
KW - DETECTION
KW - digital
KW - fingerprint
KW - fingerprinting;
KW - fingerprints;
KW - Gaussian
KW - identification;
KW - independent
KW - multimedia
KW - performance;
KW - preprocessing
KW - processes;
KW - redistribution;
KW - security;
KW - statistical
KW - statistics;
KW - systems;
KW - techniques;
KW - Telecommunication
KW - unauthorized
AB - 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.
JA - Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on
VL - 1
M3 - 10.1109/ICME.2003.1220890
ER -
TY - CONF
T1 - Resistance of orthogonal Gaussian fingerprints to collusion attacks
T2 - Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on
Y1 - 2003
A1 - Wang,Z.J.
A1 - M. Wu
A1 - Zhao,Hong
A1 - Liu,K. J.R
A1 - Trappe,W.
KW - approach;
KW - attacks;
KW - capability;
KW - collusion
KW - data
KW - data;
KW - digital
KW - distributed
KW - embedded
KW - fingerprinting;
KW - fingerprints;
KW - Gaussian
KW - likelihood-based
KW - modulation;
KW - multimedia
KW - of
KW - orthogonal
KW - probability;
KW - processes;
KW - protection;
KW - Security
KW - systems;
KW - tracing
AB - 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 Kmax are derived. We then show that the detectors are robust to different attacks. We further study different sets of performance criteria.
JA - Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on
VL - 1
M3 - 10.1109/ICME.2003.1220993
ER -
TY - CONF
T1 - Anti-collusion codes: multi-user and multimedia perspectives
T2 - Image Processing. 2002. Proceedings. 2002 International Conference on
Y1 - 2002
A1 - Trappe,W.
A1 - M. Wu
A1 - Liu,K. J.R
KW - and
KW - anti-collusion
KW - authentication;
KW - binary
KW - code
KW - codes;
KW - coding;
KW - combinatorial
KW - computing;
KW - content;
KW - data
KW - designs;
KW - digital
KW - embedding;
KW - encapsulation;
KW - fingerprinting;
KW - image
KW - images;
KW - logical
KW - mathematics;
KW - message
KW - Modulation
KW - modulation;
KW - multimedia
KW - operation;
KW - performance;
KW - watermarking;
AB - 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.
JA - Image Processing. 2002. Proceedings. 2002 International Conference on
VL - 2
M3 - 10.1109/ICIP.2002.1039909
ER -
TY - CONF
T1 - Analysis of attacks on SDMI audio watermarks
T2 - Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on
Y1 - 2001
A1 - M. Wu
A1 - Craver,S.
A1 - Felten,E.W.
A1 - Liu,B.
KW - attacks;watermark
KW - audio
KW - coding;copy
KW - digital
KW - encapsulation;
KW - Initiative;attack
KW - Music
KW - protection;data
KW - SDMI
KW - setup;robustness;security;successful
KW - watermarks;Secure
KW - weaknesses;audio
AB - 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
JA - Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on
VL - 3
M3 - 10.1109/ICASSP.2001.941183
ER -
TY - CONF
T1 - Video access control via multi-level data hiding
T2 - Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on
Y1 - 2000
A1 - M. Wu
A1 - Yu,Hong Heather
KW - access
KW - adaptive
KW - algorithms;hidden
KW - bits;high
KW - conditions;robustness;robustness-capacity
KW - control;adaptive
KW - data
KW - data;video
KW - design;user
KW - digital
KW - embedding;noise
KW - encapsulation;multimedia
KW - hiding
KW - hiding;multi-level
KW - information;data
KW - processing;
KW - QUALITY
KW - signal
KW - systems;authorisation;data
KW - systems;video
KW - technique;control
KW - tradeoff;system
KW - user
KW - video;multi-level
AB - 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
JA - Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on
VL - 1
M3 - 10.1109/ICME.2000.869620
ER -
TY - JOUR
T1 - VLSI implementation of a tree searched vector quantizer
JF - Signal Processing, IEEE Transactions on
Y1 - 1993
A1 - Kolagotla,R. K.
A1 - Yu,S.-S.
A1 - JaJa, Joseph F.
KW - (mathematics);
KW - 2
KW - 20
KW - chips;
KW - coding;
KW - compression;
KW - data
KW - design;
KW - digital
KW - image
KW - implementation;
KW - MHz;
KW - micron;
KW - PROCESSING
KW - quantisation;
KW - quantizer;
KW - searched
KW - signal
KW - tree
KW - TREES
KW - vector
KW - VLSI
KW - VLSI;
AB - 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 N-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
VL - 41
SN - 1053-587X
CP - 2
M3 - 10.1109/78.193225
ER -
TY - JOUR
T1 - VLSI architectures for multidimensional transforms
JF - Computers, IEEE Transactions on
Y1 - 1991
A1 - Chakrabarti,C.
A1 - JaJa, Joseph F.
KW - architecture;
KW - architectures;
KW - arithmetic;
KW - complexity;
KW - computational
KW - Computer
KW - digital
KW - fixed-precision
KW - linear
KW - multidimensional
KW - separable
KW - transforms;
KW - VLSI
AB - The authors propose a family of VLSI architectures with area-time tradeoffs for computing (N times;N times; . . . times;N) d-dimensional linear separable transforms. For fixed-precision arithmetic with b bits, the architectures have an area A=O(Nd+2a) and computation time T=O(dNd/2-ab ), and achieve the AT2 bound of AT2=O(n2b 2) for constant d, where n=Nd and O lt;a les;d/2
VL - 40
SN - 0018-9340
CP - 9
M3 - 10.1109/12.83648
ER -