Name
Abstract | ||
|---|---|---|
Many state-of-the-art saliency detection algorithms rely on the boundary prior, but these algorithms simply suppose the boundaries around an image as background regions. Here we propose a fast and effective algorithm for salient object detection. First, a novel method is proposed to approximately locate the foreground object by using the convex hull from Harris corner. On this basis, we divide the saliency values of different regions into two parts and generate the corresponding cue maps (foreground and background), which are combined into a convex hull prior map. Then a new prior based on distance to the convex hull center is proposed to replace the center prior. Finally, the convex hull prior map and the convex hull center-biased map are combined to be the saliency map, which is then optimized to get the final result. Compared with eighteen existing algorithms and tested on several datasets, the present algorithm performs well in terms of precision and recall. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2911996.2912008 | ICMR |
Keywords | Field | DocType |
Foreground object, Harris corner, Convex hull, Saliency map | Computer vision,Saliency map,Salient object detection,Pattern recognition,Computer science,Salience (neuroscience),Precision and recall,Convex hull,Artificial intelligence | Conference |
Citations | PageRank | References |
1 | 0.37 | 30 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hengliang Zhu | 1 | 85 | 13.49 |
| Bin Sheng | 2 | 368 | 61.19 |
| xiao lin | 3 | 6 | 2.91 |
| Yangyang Hao | 4 | 3 | 1.11 |
| Lizhuang Ma | 5 | 498 | 100.70 |