Multivariate online kernel density estimation with Gaussian kernels
Pattern Recognition
Maximum likelihood estimation of Gaussian mixture models using stochastic search
Pattern Recognition
Hi-index | 0.00 |
Image search reranking has received great attention since it overcomes the drawback of "only textual features utilization" in nowadays web-scale image search engines. Most of existing methods focus on relevance reranking, that is reordering the returned results according to their relevance with the query. However, in many cases, users cannot precisely and exhaustively describe their requirements by several query words. Therefore, relevant results with more diversity are more easily meet the users' ambiguous purpose. To address this problem, in this paper, we proposed a DIR (DDrank-based Image search Rerank) algorithm, which can enrich the topic coverage while keeping the relevance with minimal impact. DIR is based on vertex reinforced random walk and further curbing neighbor items' growing rate. Therefore, DIR can automatically balance the relevance and diversity of the top ranked vertices in a principle way. Extensive experiments are performed in a popular image dataset, and the results demonstrate the superiority against other existing methods in the criterion of both AP and ADP.