Abstract
In this paper, we propose and solve numerically a general non-smooth, non-local variational model to tackle the saliency detection problem in natural images. In order to overcome the typical drawback of the non-local methods in image processing, which mainly is the inherent computational complexity of non-local calculus, as the non-local derivatives are computed w.r.t every point of the domain, we propose a different scenario. We present a novel convex energy minimization problem in the feature space, which is efficiently solved by means of a non-local primal-dual method. Several implementations and discussions are presented taking care of the computing platforms, CPU and GPU, achieving up to 33 fps and 62 fps respectively for 300 $$\times$$ 400 image resolution, making the method eligible for real time applications.
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 callDisclaimer: 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.
