View in EDS

A global and local consistent ranking model for image saliency computation.

Saved in:
Bibliographic Details
Title: A global and local consistent ranking model for image saliency computation.
Authors: Xiao, Yun1, Wang, Liangmin2, Jiang, Bo1, Tu, Zhengzheng1, Tang, Jin1 ahu_tj@163.com
Source: Journal of Visual Communication & Image Representation. Jul2017, Vol. 46, p199-207. 9p.
Subjects: Image processing, Statistical methods in image analysis, Markov processes, Manifolds (Mathematics), Image databases
Abstract: Image saliency detection is an important issue in computer vision and has been widely used in many applications. In this paper, we propose a new global and local consistent ranking (GLR) model for image saliency computation. Firstly, we propose to use an absorbed Markov chain model to obtain a kind of global ranking for image superpixels, in which the absorbing nodes represent the virtual boundary superpixels and the transient nodes denote the general superpixels of image. Then, the absorbed time from each transient node to boundary absorbing nodes are computed. This absorbing time of transient node measures its global similarity with all absorbing nodes and thus provides a kind of global ranking for each transient node w.r.t. absorbing nodes. At last, we further exploit the local manifold structure and incorporate the local manifold smooth information into ranking process and thus propose a general global and local consistent ranking for saliency detection. Experimental results on several large benchmark databases show the effectiveness of the proposed GLR method. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Visual Communication & Image Representation is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Image saliency detection is an important issue in computer vision and has been widely used in many applications. In this paper, we propose a new global and local consistent ranking (GLR) model for image saliency computation. Firstly, we propose to use an absorbed Markov chain model to obtain a kind of global ranking for image superpixels, in which the absorbing nodes represent the virtual boundary superpixels and the transient nodes denote the general superpixels of image. Then, the absorbed time from each transient node to boundary absorbing nodes are computed. This absorbing time of transient node measures its global similarity with all absorbing nodes and thus provides a kind of global ranking for each transient node w.r.t. absorbing nodes. At last, we further exploit the local manifold structure and incorporate the local manifold smooth information into ranking process and thus propose a general global and local consistent ranking for saliency detection. Experimental results on several large benchmark databases show the effectiveness of the proposed GLR method. [ABSTRACT FROM AUTHOR]
ISSN:10473203
DOI:10.1016/j.jvcir.2017.04.001