Visual Salience Learning via Low Rank Matrix Recovery

Abstract

AbstractDetection of salient object regions is useful for many vision tasks. Recently, a variety of saliency detection models have been proposed. They often behave differently over an individual image, and these saliency detection results often complement each other. To make full use of the advantages of the existing saliency detection methods, in this paper, we propose a salience learning model which combines various saliency detection methods such that the aggregation result outperforms each individual one. In our model, we first obtain several saliency maps by different saliency detection methods. The background regions of each saliency map usually lie in a low-dimensional subspace as most of them tend to have lower salience values, while the object regions that deviating from this subspace can be considered as sparse noises. So, an individual saliency map can be represented as a low rank matrix plus a sparse matrix. We aim at learning a unified sparse matrix that represents the salient regions using these obtained individual saliency maps. The sparse matrix can be inferred by conducting low rank matrix recovery using the robust principal component analysis technique. Experiments show that our model consistently outperforms each individual saliency detection approach and state-of-the-art methods.KeywordsSalient ObjectSalient RegionSaliency DetectionSaliency ModelRobust Principal Component AnalysisThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.