@article {18267,
	title = {Robust and secure image hashing},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {1},
	year = {2006},
	month = {2006/06//},
	pages = {215 - 230},
	abstract = {Image hash functions find extensive applications in content authentication, database search, and watermarking. This paper develops a novel algorithm for generating an image hash based on Fourier transform features and controlled randomization. We formulate the robustness of image hashing as a hypothesis testing problem and evaluate the performance under various image processing operations. We show that the proposed hash function is resilient to content-preserving modifications, such as moderate geometric and filtering distortions. We introduce a general framework to study and evaluate the security of image hashing systems. Under this new framework, we model the hash values as random variables and quantify its uncertainty in terms of differential entropy. Using this security framework, we analyze the security of the proposed schemes and several existing representative methods for image hashing. We then examine the security versus robustness tradeoff and show that the proposed hashing methods can provide excellent security and robustness.},
	keywords = {content-preserving, cryptography;, differential, distortions;, entropy;, Filtering, Fourier, functions;, hash, hashing;, image, modifications;, processing;, secure, theory;, transform;, transforms;},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2006.873601},
	author = {Swaminathan,A. and Mao,Yinian and M. Wu}
}
@conference {13196,
	title = {Efficient mean-shift tracking via a new similarity measure},
	booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on},
	volume = {1},
	year = {2005},
	month = {2005/06//},
	pages = {176 - 183 vol. 1 - 176 - 183 vol. 1},
	abstract = {The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color histograms or kernel density estimates of the model and target image. The most typically used similarity measures are the Bhattacharyya coefficient or the Kullback-Leibler divergence. In practice, these approaches face three difficulties. First, the spatial information of the target is lost when the color histogram is employed, which precludes the application of more elaborate motion models. Second, the classical similarity measures are not very discriminative. Third, the sample-based classical similarity measures require a calculation that is quadratic in the number of samples, making real-time performance difficult. To deal with these difficulties we propose a new, simple-to-compute and more discriminative similarity measure in spatial-feature spaces. The new similarity measure allows the mean shift algorithm to track more general motion models in an integrated way. To reduce the complexity of the computation to linear order we employ the recently proposed improved fast Gauss transform. This leads to a very efficient and robust nonparametric spatial-feature tracking algorithm. The algorithm is tested on several image sequences and shown to achieve robust and reliable frame-rate tracking.},
	keywords = {algorithm;, analysis;, Bhattacharyya, coefficient;, Color, colour, density, divergence;, estimates;, extraction;, fast, feature, frame-rate, Gauss, Gaussian, histograms;, image, Kernel, Kullback-Leibler, matching;, Mean-shift, measures;, nonparametric, processes;, sample-based, sequences;, similarity, spaces;, spatial-feature, tracking, tracking;, transform;},
	doi = {10.1109/CVPR.2005.139},
	author = {Yang,Changjiang and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {18225,
	title = {Image hashing resilient to geometric and filtering operations},
	booktitle = {Multimedia Signal Processing, 2004 IEEE 6th Workshop on},
	year = {2004},
	month = {2004/10/01/sept},
	pages = {355 - 358},
	abstract = {Image hash functions provide compact representations of images, which is useful for search and authentication applications. In this work, we have identified a general three step framework and proposed a new image hashing scheme that achieves a better overall performance than the existing approaches under various kinds of image processing distortions. By exploiting the properties of discrete polar Fourier transform and incorporating cryptographic keys, the proposed image hash is resilient to geometric and filtering operations, and is secure against guessing and forgery attacks.},
	keywords = {compact, cryptographic, cryptography;, discrete, distortion;, Filtering, Fourier, function;, geometric, hash, image, key, key;, operation;, polar, PROCESSING, public, representation;, theory;, transform;, transforms;},
	doi = {10.1109/MMSP.2004.1436566},
	author = {Swaminathan,A. and Mao,Yinian and M. Wu}
}
@article {13235,
	title = {Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {25},
	year = {2003},
	month = {2003/11//},
	pages = {1499 - 1504},
	abstract = {Many vision algorithms depend on the estimation of a probability density function from observations. Kernel density estimation techniques are quite general and powerful methods for this problem, but have a significant disadvantage in that they are computationally intensive. In this paper, we explore the use of kernel density estimation with the fast Gauss transform (FGT) for problems in vision. The FGT allows the summation of a mixture of ill Gaussians at N evaluation points in O(M+N) time, as opposed to O(MN) time for a naive evaluation and can be used to considerably speed up kernel density estimation. We present applications of the technique to problems from image segmentation and tracking and show that the algorithm allows application of advanced statistical techniques to solve practical vision problems in real-time with today{\textquoteright}s computers.},
	keywords = {algorithms;, Color, Computer, density, estimation;, fast, function;, Gauss, image, Kernel, modeling;, segmentation;, tracking;, transform;, transforms;, VISION, vision;},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2003.1240123},
	author = {Elgammal,A. and Duraiswami, Ramani and Davis, Larry S.}
}
