Ranking consistency for image matching and object retrieval

The goal of object retrieval is to rank a set of images by the similarity of their contents to those of a query image. However, it is difficult to measure image content similarity due to visual changes caused by varying viewpoint and environment. In this paper, we propose a simple, efficient method to more effectively measure content similarity from image measurements. Our method is based on the ranking information available from existing retrieval systems. We observe that images within the set which, when used as queries, yield similar ranking lists are likely to be relevant to each other and vice versa. In our method, ranking consistency is used as a verification method to efficiently refine an existing ranking list, in much the same fashion that spatial verification is employed. The efficiency of our method is achieved by a list-wise min-Hash scheme, which allows rapid calculation of an approximate similarity ranking. Experimental results demonstrate the effectiveness of the proposed framework and its applications.     

一种改进List-wise的科技论文推荐方法研究

近些年,科研社交网站中的科技论文数量呈现出爆炸式增长的趋势,用户很难发现符合自己要求的科技论文,而科技论文推荐正是解决这个问题的有效方法之一 。但是现有科技论文推荐方法大多专注于评分预测的准确性,忽视了推荐科技论文之间的排序问题,并且现有的科技论文推荐方法没有充分利用科研社交网站中的社会化信息。为此,提出了一种改进List-wise的科技论文推荐方法,系统的分析了科研社交网站中的好友关系,科技论文的标题、和标签等社会化信息,并将其融入到List-wise方法中。为了验证提出方法的有效性,抓取了科研社交网站CiteULike上的数据进行了验证,实验结果表明,与其它传统的推荐方法相比,该方法取得了较好的实验结果,具有良好的可扩展性。