Answers are grounded in this paper and cite their sources.
We consider image intrinsic structure in two aspects: foreground saliency computation and background saliency calculation. On the one hand, a segmented image is represented as a weighted undirected graph, and we calculate the foreground saliency by choosing some superpixels as ranking queries, where we apply a robust background measure to select those for accuracy. On the other hand, we compute the posterior probabilities to measure the background saliency and in terms of the probability, we construct a probability tree via multimerging on superpixels, and then apply the optimization strategy to the background saliency. We evaluate our proposed algorithm on two benchmark datasets and our algorithm yields the competitive results when compared with nine state-of-the-art algorithms in terms of five evaluation metrics.
No takes yet. Share an insight, caveat, or question.
Hong et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: