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.
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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.