Unsupervised feature selection for salient object detection

Authors:
Viswanath Gopalakrishnan;Yiqun Hu;Deepu Rajan
Affiliations:
School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore
Venue:
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part II
Year:
2010

Citing 9
Cited 0

A Model of Saliency-Based Visual Attention for Rapid Scene Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Unsupervised Feature Selection Using Feature Similarity

IEEE Transactions on Pattern Analysis and Machine Intelligence
Convex Optimization

Convex Optimization
Simultaneous Feature Selection and Clustering Using Mixture Models

IEEE Transactions on Pattern Analysis and Machine Intelligence
Gaze-based interaction for semi-automatic photo cropping

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
2006 Special Issue: Modeling attention to salient proto-objects

Neural Networks
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem

SIAM Review
Seam carving for content-aware image resizing

ACM SIGGRAPH 2007 papers
Salient region detection by modeling distributions of color and orientation

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Feature selection plays a crucial role in deciding the salient regions of an image as in any other pattern recognition problem. However the problem of identifying the relevant features that plays a fundamental role in saliency of an image has not received much attention so far. We introduce an unsupervised feature selection method to improve the accuracy of salient object detection. The noisy irrelevant features in the image are identified by maximizing the mixing rate of a Markov process running on a linear combination of various graphs, each representing a feature. The global optimum of this convex problem is achieved by maximizing the second smallest eigen value of the graph Laplacian via semi-definite programming. The enhanced image graph model, after the removal of irrelevant features, is shown to improve the salient object detection performance on a large image data base with annotated 'ground truth'.