Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10146094 | Pattern Recognition Letters | 2018 | 7 Pages |
Abstract
Graph-based approaches for saliency detection have attracted much attention and been exploited widely in recent years. In this paper, we present a new method to promote the performance of existing manifold ranking algorithms. Initially, we use background weight map to provide seeds for manifold ranking; Next, we extend the traditional manifold ranking to second-order formula and add a weight mask to its fitting term. Finally, for further improvement of the performance, we establish a third-order smoothness framework to optimize the saliency map. In the experiments, we compare two versions (manifold ranking with and without optimization) of our model with seven previous methods and test them on several benchmark datasets. Different kinds of strategies are also adopted for evaluation and the results demonstrate that our method achieves the state-of-the-art.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Dongjing Shan, Xiongwei Zhang, Chao Zhang,