Show simple item record

dc.contributor.authorSrinivasan, Balaji Vasan
dc.contributor.authorDuraiswami, Ramani
dc.date.accessioned2011-10-17T03:28:19Z
dc.date.available2011-10-17T03:28:19Z
dc.date.issued2011-10-12
dc.identifier.urihttp://hdl.handle.net/1903/12132
dc.description.abstractRenyi entropy refers to a generalized class of entropies that have been used in several applications. In this work, we derive a non-parametric distance between distributions based on the quadratic Renyi entropy. The distributions are estimated via Parzen density estimates. The quadratic complexity of the distance evaluation is mitigated with GPU-based parallelization. This results in an efficiently evaluated non-parametric entropic distance - the kernelized Renyi distance or the KRD. We adapt the KRD into a similarity measure and show its application to speaker recognition. We further extend KRD to measure dissimilarities between distributions and illustrate its applications to statistical subset selection and dictionary learning for object recognition and pose estimation.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesUM Computer Science Department;CS-TR-4994
dc.titleKernelized Renyi distance for subset selection and similarity scoringen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record