Abstract

We propose an algorithm for salient object detection (SOD) based on multi-scale graph ranking and iterative local–global object refinement. Starting from a set of multi-scale image decompositions using superpixels, we propose an objective function which is optimized on a multi-layer graph structure to diffuse saliency from image borders to salient objects. This step aims at roughly estimating the location and extent of salient objects in the image. We then enhance the object saliency through an iterative process employing random forests and local boundary refinement using color, texture and edge information. We also use a feature weighting scheme to ensure optimal object/background discrimination. Our algorithm yields very accurate saliency maps for SOD while maintaining a reasonable computational time. Experiments on several standard datasets have shown that our approach outperforms several recent methods dealing with SOD.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.