<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
	<record>
		<datafield tag="980" ind1=" " ind2=" ">
			<subfield code="a">CONF</subfield>
		</datafield>
		<datafield tag="970" ind1=" " ind2=" ">
			<subfield code="a">Tommasi_CLEF2007_2007/IDIAP</subfield>
		</datafield>
		<datafield tag="245" ind1=" " ind2=" ">
			<subfield code="a">CLEF2007 Image Annotation Task: an SVM-based Cue Integration Approach</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Tommasi, Tatiana</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Orabona, Francesco</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Caputo, Barbara</subfield>
		</datafield>
		<datafield tag="856" ind1="4" ind2="0">
			<subfield code="i">EXTERNAL</subfield>
			<subfield code="u">http://publications.idiap.ch/attachments/papers/2008/Tommasi_CLEF2007_2007.pdf</subfield>
			<subfield code="x">PUBLIC</subfield>
		</datafield>
		<datafield tag="711" ind1="2" ind2=" ">
			<subfield code="a">Proceedings of ImageCLEF 2007 -LNCS</subfield>
		</datafield>
		<datafield tag="260" ind1=" " ind2=" ">
			<subfield code="c">2007</subfield>
		</datafield>
		<datafield tag="520" ind1=" " ind2=" ">
			<subfield code="a">This paper presents the algorithms and results of our participation to the medical
image annotation task of ImageCLEFmed 2007. We proposed, as a general strategy,
a multi-cue approach where images are represented both by global and local descrip-
tors, so to capture diÂ®erent types of information. These cues are combined during the
classiÂ¯cation step following two alternative SVM-based strategies. The Â¯rst algorithm,
called Discriminative Accumulation Scheme (DAS,',','),
 trains an SVM for each feature
type, and considers as output of each classiÂ¯er the distance from the separating hyper-
plane. The Â¯nal decision is taken on a linear combination of these distances: in this
way cues are accumulated, thus even when they both are misleaded the Â¯nal result can
be correct. The second algorithm uses a new Mercer kernel that can accept as input
diÂ®erent feature types while keeping them separated. In this way, cues are selected
and weighted, for each class, in a statistically optimal fashion. We call this approach
Multi Cue Kernel (MCK). We submitted several runs, testing the performance of the
single-cue SVM and of the two cue integration methods. Our team was called BLOOM
(BLanceÂ°Or-tOMed.im2) from the name of our sponsors. The DAS algorithm obtained
a score of 29.9, which ranked Â¯fth among all submissions. We submitted two versions
of the MCK algorithm, one using the one-vs-all multiclass extension of SVMs and
the other using the one-vs-one extension. They scored respectively 26.85 and 27.54,
ranking Â¯rst and second among all submissions.</subfield>
		</datafield>
	</record>
</collection>