Manifold Ranking-Based Matrix Factorization for Saliency Detection

Citations Over TimeTop 1% of 2015 papers

Abstract

Saliency detection is used to identify the most important and informative area in a scene, and it is widely used in various vision tasks, including image quality assessment, image matching, and object recognition. Manifold ranking (MR) has been used to great effect for the saliency detection, since it not only incorporates the local spatial information but also utilizes the labeling information from background queries. However, MR completely ignores the feature information extracted from each superpixel. In this paper, we propose an MR-based matrix factorization (MRMF) method to overcome this limitation. MRMF models the ranking problem in the matrix factorization framework and embeds query sample labels in the coefficients. By incorporating spatial information and embedding labels, MRMF enforces similar saliency values on neighboring superpixels and ranks superpixels according to the learned coefficients. We prove that the MRMF has good generalizability, and develops an efficient optimization algorithm based on the Nesterov method. Experiments using popular benchmark data sets illustrate the promise of MRMF compared with the other state-of-the-art saliency detection methods.

Related Papers

• → Generalizing Generalizability in Information Systems Research(2003)1,544 cited
• → External Validity, Generalizability, and Knowledge Utilization(2004)251 cited
• → Applying Generalizability Theory using EduG(2011)108 cited
• → Reliability of observers' subjective impressions of families: A generalizability theory approach(2012)20 cited
• → Using Generalizability Theory for the Estimation of Reliability of a Patient Classification System(1994)1 cited