资源论文Robust Saliency Detection via Regularized Random Walks Ranking

Robust Saliency Detection via Regularized Random Walks Ranking

2019-12-17 | |  72 |   40 |   0

Abstract

In the field of saliency detection, many graph-based  algorithms heavily depend on the accuracy of the  pre-processed superpixel segmentation, which leads to  significant sacrifice of detail information from the input  image. In this paper, we propose a novel bottom-up  saliency detection approach that takes advantage of both  region-based features and image details. To provide more  accurate saliency estimations, we first optimize the image  boundary selection by the proposed erroneous boundary  removal. By taking the image details and region-based  estimations into account, we then propose the regularized  random walks ranking to formulate pixel-wised saliency  maps from the superpixel-based background and  foreground saliency estimations. Experiment results on  two public datasets indicate the significantly improved  accuracy and robustness of the proposed algorithm in  comparison with 12 state-of-the-art saliency detection  approaches.

上一篇:Reconstructing the World* in Six Days *(As Captured by the Yahoo 100 Million Image Dataset)

下一篇:Is object localization for free? – Weakly-supervised learning with convolutional neural networks

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...