lecturer: li hui
lecture time: june 7th 4:00 pm
lecture place: room 417 information building
dpr-tree an efficient indexing method for multimedia knn search
knn search is an important task in many modern multimedia applications. although there is a long stream of research on high-dimensional multimedia indexing,aiming to efficiently organize multimedia data to facilitate knn search, most of them are focused on how to reduce the io operations to improve the overall knn search performance. in fact, in many scenarios, io operations are only a minor factor of knn search overhead. the efficiency of the existing indexing approaches does not always suffice.
in this talk, i will address the multimedia indexing problem from the perspective of computation cost reduction. we devised a multimedia index structure named dpr-tree, and applied a novel knn search
approach to reduce the overhead of distance computation and speed up the knn query processing. we conducted an extensive experimental study on a large real-life multimedia dataset called msra-mm 2.0, obtained from the commercial bing image search engine. our results show that the dpr-tree based high-dimensional multimedia knn search is significantly faster than other indexing methods without incurring accuracy loss.
