Over the last years, several authors have signaled that state of the art categorization methods fail to perform well when trained and tested on data from different databases. The general consensus in the literature is that this issue, known as domain adaptation and/or dataset bias, is due to a distribution mismatch between data collections. Methods addressing it go from max-margin classifiers to learning how to modify the features and obtain a more robust representation. The large majority of these works use BOW feature descriptors, and learning methods based on image-to-image distance functions. Following the seminal work of [6], in this paper we challenge these two assumptions. We experimentally show that using the NBNN classifier over existing domain adaptation databases achieves always very strong performances. We build on this result, and present an NBNN-based domain adaptation algorithm that learns iteratively a class metric while inducing, for each sample, a large margin separation among classes. To the best of our knowledge, this is the first work casting the domain adaptation problem within the NBNN framework. Experiments show that our method achieves the state of the art, both in the unsupervised and semi-supervised settings. © 2013 IEEE.

Frustratingly easy NBNN domain adaptation / Tommasi, Tatiana; Caputo, Barbara. - (2013), pp. 897-904. (Intervento presentato al convegno 2013 14th IEEE International Conference on Computer Vision, ICCV 2013 tenutosi a Sydney; Australia nel 2013) [10.1109/ICCV.2013.116].

Frustratingly easy NBNN domain adaptation

TOMMASI, TATIANA;CAPUTO, BARBARA
2013

Abstract

Over the last years, several authors have signaled that state of the art categorization methods fail to perform well when trained and tested on data from different databases. The general consensus in the literature is that this issue, known as domain adaptation and/or dataset bias, is due to a distribution mismatch between data collections. Methods addressing it go from max-margin classifiers to learning how to modify the features and obtain a more robust representation. The large majority of these works use BOW feature descriptors, and learning methods based on image-to-image distance functions. Following the seminal work of [6], in this paper we challenge these two assumptions. We experimentally show that using the NBNN classifier over existing domain adaptation databases achieves always very strong performances. We build on this result, and present an NBNN-based domain adaptation algorithm that learns iteratively a class metric while inducing, for each sample, a large margin separation among classes. To the best of our knowledge, this is the first work casting the domain adaptation problem within the NBNN framework. Experiments show that our method achieves the state of the art, both in the unsupervised and semi-supervised settings. © 2013 IEEE.
2013
2013 14th IEEE International Conference on Computer Vision, ICCV 2013
Domain Adaptation; Naive Bayes Nearest Neighbor
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Frustratingly easy NBNN domain adaptation / Tommasi, Tatiana; Caputo, Barbara. - (2013), pp. 897-904. (Intervento presentato al convegno 2013 14th IEEE International Conference on Computer Vision, ICCV 2013 tenutosi a Sydney; Australia nel 2013) [10.1109/ICCV.2013.116].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/915657
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 69
  • ???jsp.display-item.citation.isi??? 49
social impact