.png){kind=icon}
返回
A prior regularized multi-layer graph ranking model for image saliency computation
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2018.06.072.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Bottom-up saliency detection has been widely studied in many applications, such as image retrieval, object recognition, image compression and so on. Saliency detection via manifold ranking (MR) can identify the most salient and important area from an image efficiently. One limitation of the MR model is that it fails to consider the prior information in its ranking process. To overcome this limitation, we propose a prior regularized multi-layer graph ranking model (RegMR), which uses the prior calculating by boundary connectivity. We employ the foreground possibility in the first stage and background possibility in the second stage based on a multi-layer graph. We compare our model with fifteen state-of-the-art methods. Experiments show that our model performs well than all other methods on four public databases on PR-curves, F-measure and so on. (c) 2018 Elsevier B.V. All rights reserved.
Keyword:
Graph ranking
Boundary connectivity
Background possibility
Foreground possibility
Multiple layer
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
Principal Component 2-D Long Short-Term Memory for Font Recognition on Single Chinese Characters
PREAI
分享收藏分享收藏
查看更多内容