Salient detection based on improved graph models

Yiming Zhang; Jing Han; Yi Zhang; Lianfa Bai

doi:10.1117/12.2281766

21 July 2017 Salient detection based on improved graph models

Yiming Zhang, Jing Han, Yi Zhang, Lianfa Bai

Proceedings Volume 10420, Ninth International Conference on Digital Image Processing (ICDIP 2017); 1042018 (2017) https://doi.org/10.1117/12.2281766
Event: Ninth International Conference on Digital Image Processing (ICDIP 2017), 2017, Hong Kong, China

Abstract

In this paper, we propose a novel approach to detect visual saliency based on improved graph models. The graph-based manifold ranking algorithm adopts k neighbor constraint and close-loop constraint to construct a graph model. In the first stage of the algorithm, k = 2 neighbor constraint reduces the differences between foreground nodes and boundary nodes and the saliency value of the nodes which are close to the center of the image tends to be larger. So some background nodes are selected as foreground queries in the second stage and some background will be highlighted. To eliminate such defect of the algorithm, we use a simple graph structure containing close-loop constraint in the first stage and update the graph structure by expanding close-loop constraint to calculate a new ranking matrix, which is then used to calculate the final saliency map. Experiments in the MSRA1000 database prove that our method outperforms the classical algorithm.

Citation Download Citation

Yiming Zhang, Jing Han, Yi Zhang, and Lianfa Bai "Salient detection based on improved graph models", Proc. SPIE 10420, Ninth International Conference on Digital Image Processing (ICDIP 2017), 1042018 (21 July 2017); https://doi.org/10.1117/12.2281766

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available