Roffo, G. , Melzi, S., Castellani, U. and Vinciarelli, A. (2017) Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach. In: IEEE International Conference on Computer Vision (ICCV 2017), Venice, Italy, 22-29 Oct 2017, pp. 1407-1415. ISBN 9781538610329 (doi: 10.1109/ICCV.2017.156)
|
Text
149366.pdf - Accepted Version 1MB |
Abstract
Feature selection is playing an increasingly significant role with respect to many computer vision applications spanning from object recognition to visual object tracking. However, most of the recent solutions in feature selection are not robust across different and heterogeneous set of data. In this paper, we address this issue proposing a robust probabilistic latent graph-based feature selection algorithm that performs the ranking step while considering all the possible subsets of features, as paths on a graph, bypassing the combinatorial problem analytically. An appealing characteristic of the approach is that it aims to discover an abstraction behind low-level sensory data, that is, relevancy. Relevancy is modelled as a latent variable in a PLSA-inspired generative process that allows the investigation of the importance of a feature when injected into an arbitrary set of cues. The proposed method has been tested on ten diverse benchmarks, and compared against eleven state of the art feature selection methods. Results show that the proposed approach attains the highest performance levels across many different scenarios and difficulties, thereby confirming its strong robustness while setting a new state of the art in feature selection domain.
| Item Type: | Conference Proceedings |
|---|---|
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Roffo, Dr Giorgio and Vinciarelli, Professor Alessandro |
| Authors: | Roffo, G., Melzi, S., Castellani, U., and Vinciarelli, A. |
| College/School: | College of Science and Engineering > School of Computing Science |
| ISSN: | 2380-7504 |
| ISBN: | 9781538610329 |
| Copyright Holders: | Copyright © 2017 IEEE |
| Publisher Policy: | Reproduced in accordance with the copyright policy of the publisher |
| Related URLs: |
University Staff: Request a correction | Enlighten Editors: Update this record
Altmetric
Altmetric