z-logo
open-access-imgOpen Access
CF‐based optimisation for saliency detection
Author(s) -
Niu Yuzhen,
Lin Wenqi,
Ke Xiao
Publication year - 2018
Publication title -
iet computer vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 37
eISSN - 1751-9640
pISSN - 1751-9632
DOI - 10.1049/iet-cvi.2017.0512
Subject(s) - cluster analysis , artificial intelligence , similarity (geometry) , histogram , computer science , pattern recognition (psychology) , ground truth , image (mathematics) , saliency map , kadir–brady saliency detector , computer vision , algorithm
In view of the observation that saliency maps generated by saliency detection algorithms usually show similarity imperfection against the ground truth, the authors propose an optimisation algorithm based on clustering and fitting (CF) for saliency detection. The algorithm uses a fitting model to represent the quantitative relationship between ground truth and algorithm‐generated saliency maps. The authors use the K ‐means method to cluster the images into k clusters according to the similarities among images. Image similarity is measured in terms of scene and colour by using the GIST and colour histogram features, after which the fitting model for each cluster is calculated. The saliency map of a new image is optimised by using one of the fitting models which correspond to the cluster to which the image belongs. Experimental results show that their CF‐based optimisation algorithm improves the performance of various single image saliency detection algorithms. Moreover, the improvement achieved by their algorithm when using both CF strategies is greater than the improvement achieved by the same algorithm when not using the clustering strategy. In addition, their proposed optimisation algorithm can also effectively optimise co‐saliency detection algorithms which already consider multiple similar images simultaneously to improve saliency of single images.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here