<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T11:16:33Z</responseDate>
  <request identifier="649" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:649</identifier>
        <datestamp>2024-03-06T11:06:52Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Efficient multi-step query processing for EMD-based similarity</dc:title>
          <dc:creator>Assent, Ira</dc:creator>
          <dc:creator>Seidl, Thomas</dc:creator>
          <dc:subject>Content-based retrieval</dc:subject>
          <dc:subject>indexing</dc:subject>
          <dc:subject>multimedia databases</dc:subject>
          <dc:subject>efficiency</dc:subject>
          <dc:subject>similarity</dc:subject>
          <dc:description>Similarity search in large multimedia databases requires ef-&#13;
ficient query processing based on suitable similarity models. Similarity&#13;
models consist of a feature extraction step as well as a distance defined&#13;
for these features, and they demand an efficient algorithm for retrieving&#13;
similar objects under this model. In this work, we focus on the Earth&#13;
Movers Distance (EMD), a recently introduced similarity model which&#13;
has been successfully employed in numerous applications and has been reported as well reflecting human perceptual similarity. As its computation&#13;
is complex, the direct application of the EMD to large, high-dimensional&#13;
databases is not feasible. To remedy this and allow users to benefit from&#13;
the high quality of the model even in larger settings, we developed various&#13;
lower bounds for the EMD to be used in index-supported multistep&#13;
query processing algorithms. We prove that our algorithms are complete,&#13;
thus producing no false drops. We also show that it is highly efficient as&#13;
experiments on large image databases with high-dimensional features&#13;
demonstrate.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ira Assent and Thomas Seidl</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6171, Content-Based Retrieval (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.06171.6</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-6490</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06171.6</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
