Real-Time Salient Object Detection With a Minimum Spanning Tree

Wei-Chih Tu, Shengfeng He, Qingxiong Yang, Shao-Yi Chien; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 2334-2342

Abstract


In this paper, we present a real-time salient object detection system based on the minimum spanning tree. Due to the fact that background regions are typically connected to the image boundaries, salient objects can be extracted by computing the distances to the boundaries. However, measuring the image boundary connectivity efficiently is a challenging problem. Existing methods either rely on superpixel representation to reduce the processing units or approximate the distance transform. Instead, we propose an exact and iteration free solution on a minimum spanning tree. The minimum spanning tree representation of an image inherently reveals the object geometry information in a scene. Meanwhile, it largely reduces the search space of shortest paths, resulting an efficient and high quality distance transform algorithm. We further introduce a boundary dissimilarity measure to compliment the shortage of distance transform for salient object detection. Extensive evaluations show that the proposed algorithm achieves the leading performance compared to the state-of-the-art methods in terms of efficiency and accuracy.

Related Material


[pdf]
[bibtex]
@InProceedings{Tu_2016_CVPR,
author = {Tu, Wei-Chih and He, Shengfeng and Yang, Qingxiong and Chien, Shao-Yi},
title = {Real-Time Salient Object Detection With a Minimum Spanning Tree},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2016}
}