DEKE青年学术沙龙系列报告
发布时间: 2011-06-03 04:52:00 浏览次数: 供稿:未知
演讲人:参考下方
讲座时间:0000-00-00 00:00:00
讲座地点:--
讲座内容

演讲人: 李晖

讲座时间: 6月7日下午16点

讲座地点: 信息楼414室

讲座内容: DEKE青年学术沙龙系列报告三

"DEKE研讨会"从下周起正式更名为"DEKE青年学术沙龙",主要目的是促进重点实验室青年教师和研究生的学术交流。当然,我们也非常欢迎经验丰富的资深老师前来参与并分享经验。

题目: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.

演讲人简介