@article {18233,
	title = {Joint coding and embedding techniques for MultimediaFingerprinting},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {1},
	year = {2006},
	month = {2006/06//},
	pages = {231 - 247},
	abstract = {Digital fingerprinting protects multimedia content from illegal redistribution by uniquely marking every copy of the content distributed to each user. The collusion attack is a powerful attack where several different fingerprinted copies of the same content are combined together to attenuate or even remove the fingerprints. One major category of collusion-resistant fingerprinting employs an explicit step of coding. Most existing works on coded fingerprinting mainly focus on the code-level issues and treat the embedding issues through abstract assumptions without examining the overall performance. In this paper, we jointly consider the coding and embedding issues for coded fingerprinting systems and examine their performance in terms of collusion resistance, detection computational complexity, and distribution efficiency. Our studies show that coded fingerprinting has efficient detection but rather low collusion resistance. Taking advantage of joint coding and embedding, we propose a permuted subsegment embedding technique and a group-based joint coding and embedding technique to improve the collusion resistance of coded fingerprinting while maintaining its efficient detection. Experimental results show that the number of colluders that the proposed methods can resist is more than three times as many as that of the conventional coded fingerprinting approaches.},
	keywords = {coding-embedding, coding;, collusion-resistant, complexity;, computational, data;, DETECTION, embedded, EMBEDDING, fingerprinting;, group-based, image, joint, multimedia, of, Security, subsegment, systems;, technique;, techniques;},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2006.873597},
	author = {He,Shan and M. Wu}
}
@conference {14026,
	title = {The manifolds of spatial hearing},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {3},
	year = {2005},
	month = {2005/03//},
	pages = {iii/285 - iii/288 Vol. 3 - iii/285 - iii/288 Vol. 3},
	abstract = {We present exploratory studies on learning the non-linear manifold structure, in head related impulse responses (HRIRs). We use the recently popular locally linear embedding technique. The lower dimensional manifold encodes the perceptual information in the HRIRs, namely the direction of the sound source. Based on this, we propose a new method for HRIR interpolation. We also propose that the distance between two HRIRs of an individual be taken as the geodesic distance on the learned manifold.},
	keywords = {acoustics;, dimensional, direction, distance;, EMBEDDING, encoding;, geodesic, Head, hearing, hearing;, HRIR, impulse, information, interpolation;, learned, linear, localization;, locally, low, manifold, manifold;, manifolds;, nonlinear, perceptual, related, response;, responses;, sound, source, spatial, structure;, technique;, transient},
	doi = {10.1109/ICASSP.2005.1415702},
	author = {Duraiswami, Ramani and Raykar,V.C.}
}
@conference {13213,
	title = {Background modeling and subtraction by codebook construction},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/10//},
	pages = {3061 - 3064 Vol. 5 - 3061 - 3064 Vol. 5},
	abstract = {We present a new fast algorithm for background modeling and subtraction. Sample background values at each pixel are quantized into codebooks which represent a compressed form of background model for a long image sequence. This allows us to capture structural background variation due to periodic-like motion over a long period of time under limited memory. Our method can handle scenes containing moving backgrounds or illumination variations (shadows and highlights), and it achieves robust detection for compressed videos. We compared our method with other multimode modeling techniques.},
	keywords = {(signal);, analysis;, background, codebook, coding;, colour, compression;, construction;, data, image, modeling, modeling;, MOTION, multimode, quantisation, representation;, sequence;, sequences;, subtraction;, technique;, video},
	doi = {10.1109/ICIP.2004.1421759},
	author = {Kim,Kyungnam and Chalidabhongse,T.H. and Harwood,D. and Davis, Larry S.}
}
@conference {13239,
	title = {Mean-shift analysis using quasiNewton methods},
	booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/09//},
	pages = {II - 447-50 vol.3 - II - 447-50 vol.3},
	abstract = {Mean-shift analysis is a general nonparametric clustering technique based on density estimation for the analysis of complex feature spaces. The algorithm consists of a simple iterative procedure that shifts each of the feature points to the nearest stationary point along the gradient directions of the estimated density function. It has been successfully applied to many applications such as segmentation and tracking. However, despite its promising performance, there are applications for which the algorithm converges too slowly to be practical. We propose and implement an improved version of the mean-shift algorithm using quasiNewton methods to achieve higher convergence rates. Another benefit of our algorithm is its ability to achieve clustering even for very complex and irregular feature-space topography. Experimental results demonstrate the efficiency and effectiveness of our algorithm.},
	keywords = {analysis;, classification;, clustering, clustering;, Convergence, density, estimation;, feature-space, image, irregular, iterative, Mean-shift, method;, methods;, Newton, nonparametric, pattern, procedure;, quasiNewton, rates;, segmentation;, technique;, topography;},
	doi = {10.1109/ICIP.2003.1246713},
	author = {Yang,C. and Duraiswami, Ramani and DeMenthon,D. and Davis, Larry S.}
}
@article {15399,
	title = {Perturbation technique for LLG dynamics in uniformly magnetized bodies subject to RF fields},
	journal = {Magnetics, IEEE Transactions on},
	volume = {38},
	year = {2002},
	month = {2002/09//},
	pages = {2403 - 2405},
	abstract = {The problem of magnetization dynamics of a uniformly magnetized uniaxial particle or film, under elliptically polarized applied field, is considered. In the special case of circularly polarized applied field and particles (films) with a symmetry axis, pure time-harmonic magnetization modes exist that can be computed analytically. Deviations from these highly symmetric conditions are treated as perturbation of the symmetric case. The perturbation technique leads to the exactly solvable system of linear differential equations for the perturbations which enables one to compute higher order magnetization harmonic. The analytical solutions are obtained and then compared with numerical results.},
	keywords = {analytical, anisotropy, anisotropy;, applied, bodies;, circularly, component;, constant-in-time, constant;, damping, demagnetisation;, demagnetizing, differential, dynamics;, effective, elliptically, equation;, equations;, exactly, factors;, field;, film;, films;, Frequency, gyromagnetic, harmonic;, higher, Landau-Lifshitz-Gilbert, large, linear, magnetic, magnetisation;, magnetization, magnetization;, magnetized, modes;, MOTION, order, partial, particle;, particles;, perturbation, polarized, radio, ratio;, RF, saturation, solution;, solvable, system;, technique;, techniques;, thin, time-harmonic, uniaxial, uniformly},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2002.803596},
	author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C.}
}
