Efficient Shape Indexing Using an Information Theoretic Representation

@incollection{citeulike:1849845, abstract = {Efficient retrieval often requires an indexing structure on the database in question. We present an indexing scheme for cases when the dissimilarity measure is the Kullback-Liebler (KL) divergence. Devising such a scheme is difficult because the KL-divergence is not a metric, failing to satisfy the triangle inequality or even .niteness in general. We de.ne an optimal represenative of a set of distributions to serve as the basis of such an indexing structure. This representative, dubbed the exponential information theoretic center, minimizes the worst case KLdivergence from it to the elements of its set. This, along with a lower bound on the KL-divergence from the query to the elements of a set, allows us to prune the search, increasing e.ciency while guarenteeing that we never discard the nearest neighbors. We present results of querying the Princeton Shape Database which show significant speed-ups over an exhaustive search and over an analogous approach using a more mundane representative.}, author = {Spellman, Eric and Vemuri, Baba}, citeulike-article-id = {1849845}, doi = {10.1007/11526346_18}, journal = {Image and Video Retrieval}, pages = {145--153}, posted-at = {2007-11-01 07:00:59}, priority = {0}, title = {Efficient Shape Indexing Using an Information Theoretic Representation}, url = {http://dx.doi.org/10.1007/11526346_18}, year = {2005} }

TY - CHAP ID - citeulike:1849845 L3 - citeulike-article-id:1849845 N2 - Efficient retrieval often requires an indexing structure on the database in question. We present an indexing scheme for cases when the dissimilarity measure is the Kullback-Liebler (KL) divergence. Devising such a scheme is difficult because the KL-divergence is not a metric, failing to satisfy the triangle inequality or even .niteness in general. We de.ne an optimal represenative of a set of distributions to serve as the basis of such an indexing structure. This representative, dubbed the exponential information theoretic center, minimizes the worst case KLdivergence from it to the elements of its set. This, along with a lower bound on the KL-divergence from the query to the elements of a set, allows us to prune the search, increasing e.ciency while guarenteeing that we never discard the nearest neighbors. We present results of querying the Princeton Shape Database which show significant speed-ups over an exhaustive search and over an analogous approach using a more mundane representative. JF - Image and Video Retrieval EP - 153 TI - Efficient Shape Indexing Using an Information Theoretic Representation SP - 145 AU - Spellman, Eric AU - Vemuri, Baba PY - 2005/// UR - http://dx.doi.org/10.1007/11526346_18 ER -