Pixel Club: Nearest-Neighbor Searching Under Uncertainty, and Matching a Noisy Curves to a Maps

דובר:
אלון אפרת (אונ' אריזונה)
תאריך:
יום שני, 30.7.2012, 11:30
מקום:
חדר 337, בניין טאוב למדעי המחשב

Nearest-neighbor queries, which ask for returning the nearest neighbor of a query point in a set of points, are important and widely studied in many fields because of a wide range of applications. In many of these applications, such as sensor databases, location based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest neighbor queries in a probabilistic framework in which the location of each input point and/or query point is specified as a probability density function and the goal is to return the point that minimizes the expected distance, which we refer to as the expected nearest neighbor (ENN). We present methods for computing an exact ENN or an ו- approximate ENN, for a given error parameter 0 < ו < 1, under different distance functions. These methods build an index of near-linear size and answer ENN queries in poly- logarithmic or sublinear time, depending on the underlying function. As far as we know, these are the first nontrivial methods for answering exact or ו-approximate ENN queries with provable performance guarantees.

joint work with Pankaj Agarwal, Swaminathan Sankararaman and Wuzhou Zhang

בחזרה לאינדקס האירועים