Name
Abstract | ||
|---|---|---|
In this paper, we propose a novel approach to detect visual saliency based on spread pattern and manifold ranking. We firstly construct a close-loop graph model with image superpixels as nodes. The saliency of each node is defined by its relevance to given queries according to graph-based manifold ranking technique. Unlike existing methods which choose a few background and foreground queries in a two-stage scheme, we propose to treat each node as a potential foreground query by assigning to it an initial ranking score based on its spread pattern property. The new concept spread pattern represents how the ranking score of one node is propagated to the whole graph. An accurate query map is generated accordingly, which is then used to produce the final saliency map with manifold ranking. Our method is computationally efficient and outperforms the state-of-the-art methods. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-45646-0_29 | Communications in Computer and Information Science |
Keywords | Field | DocType |
saliency detection,graph model,spread pattern,manifold ranking | Data mining,Graph,Saliency map,Ranking,Ranking SVM,Pattern recognition,Salience (neuroscience),Ranking (information retrieval),Artificial intelligence,Manifold ranking,Mathematics,Graph model | Conference |
Volume | ISSN | Citations |
483 | 1865-0929 | 1 |
PageRank | References | Authors |
0.35 | 13 | 5 |