TY - JOUR
T1 - Learning Complementary Saliency Priors for Foreground Object Segmentation in Complex Scenes
AU - Tian, Yonghong
AU - Li, Jia
AU - Yu, Shui
AU - Huang, Tiejun
N1 - Publisher Copyright:
© 2014, Springer Science+Business Media New York.
PY - 2014/1
Y1 - 2014/1
N2 - Object segmentation is widely recognized as one of the most challenging problems in computer vision. One major problem of existing methods is that most of them are vulnerable to the cluttered background. Moreover, human intervention is often required to specify foreground/background priors, which restricts the usage of object segmentation in real-world scenario. To address these problems, we propose a novel approach to learn complementary saliency priors for foreground object segmentation in complex scenes. Different from existing saliency-based segmentation approaches, we propose to learn two complementary saliency maps that reveal the most reliable foreground and background regions. Given such priors, foreground object segmentation is formulated as a binary pixel labelling problem that can be efficiently solved using graph cuts. As such, the confident saliency priors can be utilized to extract the most salient objects and reduce the distraction of cluttered background. Extensive experiments show that our approach outperforms 16 state-of-the-art methods remarkably on three public image benchmarks.
AB - Object segmentation is widely recognized as one of the most challenging problems in computer vision. One major problem of existing methods is that most of them are vulnerable to the cluttered background. Moreover, human intervention is often required to specify foreground/background priors, which restricts the usage of object segmentation in real-world scenario. To address these problems, we propose a novel approach to learn complementary saliency priors for foreground object segmentation in complex scenes. Different from existing saliency-based segmentation approaches, we propose to learn two complementary saliency maps that reveal the most reliable foreground and background regions. Given such priors, foreground object segmentation is formulated as a binary pixel labelling problem that can be efficiently solved using graph cuts. As such, the confident saliency priors can be utilized to extract the most salient objects and reduce the distraction of cluttered background. Extensive experiments show that our approach outperforms 16 state-of-the-art methods remarkably on three public image benchmarks.
KW - Complementary saliency map
KW - Foreground object segmentation
KW - Graph cuts
KW - Visual saliency
UR - https://www.scopus.com/pages/publications/84908044637
U2 - 10.1007/s11263-014-0737-1
DO - 10.1007/s11263-014-0737-1
M3 - 文章
AN - SCOPUS:84908044637
SN - 0920-5691
VL - 111
SP - 153
EP - 170
JO - International Journal of Computer Vision
JF - International Journal of Computer Vision
IS - 2
ER -