Asymmetric Learning and Dissimilarity Spaces for Content-Based RetrievalOpen Website

Published: 01 Jan 2006, Last Modified: 04 Nov 2023CIVR 2006Readers: Everyone
Abstract: This paper presents novel dissimilarity space specially designed for interactive multimedia retrieval. By providing queries made of positive and negative examples, the goal consists in learning the positive class distribution. This classification problem is known to be asymmetric, i.e. the negative class does not cluster in the original feature spaces. We introduce here the idea of Query-based Dissimilarity Space (QDS) which enables to cope with the asymmetrical setup by converting it in a more classical 2-class problem. The proposed approach is evaluated on both artificial data and real image database, and compared with state-of-the-art algorithms.
0 Replies

Loading