A novel graph-based optimization framework for salient object detection. (April 2017) - Zhang, Jinxia
Abstract: In traditional graph-based optimization framework for salient object detection, an image is over-segmented into superpixels and mapped to one single graph. The saliency value of each superpixel is then computed based on the similarity between connected nodes and the saliency related queries. When applying the traditional graph-based optimization framework to the salient object detection problem in natural scene images, we observe at least two limitations: only one graph is employed to describe the information contained in an image and no cognitive property about visual saliency is explicitly modeled in the optimization framework. In this work, we propose a novel graph-based optimization framework for salient object detection. Firstly, we employ multiple graphs in our optimization framework. A natural scene image is usually complex, employing multiple graphs from different image properties can better describe the complex information contained in the image. Secondly, we model one popular cognitive property about visual saliency (visual rarity) in our graph-based optimization framework, making this framework more suitable for saliency detection problem. Specifically, we add a regularization term to constrain the saliency value of each superpixel according to visual rarity in our optimization framework. Our experimental results on four benchmark databases with comparisons to fifteen representative methods demonstrate that our graph-based optimization framework is effective and computationally efficient. Abstract : Highlights: A novel graph-based optimization framework for salient object detection is proposed in the paper. Multiple graphs are employed in our optimization framework to better describe a natural scene image. Visual rarity is modeled as a regularization term in our framework to better detect saliency. Experimental results on four datasets with fifteen methods prove the effectiveness of our method.