location: Current position: Home >> Scientific Research >> Paper Publications

Graph-Regularized Saliency Detection With Convex-Hull-Based Center Prior

Hits:

Indexed by:期刊论文

Date of Publication:2013-07-01

Journal:IEEE SIGNAL PROCESSING LETTERS

Included Journals:SCIE、EI、Scopus

Volume:20

Issue:7

Page Number:637-640

ISSN No.:1070-9908

Key Words:Center prior; contrast prior; salient object detection; smoothness prior

Abstract:Object level saliency detection is useful for many content-based computer vision tasks. In this letter, we present a novel bottom-up salient object detection approach by exploiting contrast, center and smoothness priors. First, we compute an initial saliency map using contrast and center priors. Unlike most existing center prior based methods, we apply the convex hull of interest points to estimate the center of the salient object rather than directly use the image center. This strategy makes the saliency result more robust to the location of objects. Second, we refine the initial saliency map through minimizing a continuous pairwise saliency energy function with graph regularization which encourages adjacent pixels or segments to take the similar saliency value (i.e., smoothness prior). The smoothness prior enables the proposed method to uniformly highlight the salient object and simultaneously suppress the background effectively. Extensive experiments on a large dataset demonstrate that the proposed method performs favorably against the state-of-the-art methods in terms of accuracy and efficiency.

Pre One:浅谈校内导师在保障在职工程硕士论文质量中的作用

Next One:Saliency Detection via Graph-Based Manifold Ranking