<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<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-09-22T07:02:20Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/32060" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/32060</identifier>
        <datestamp>2023-07-10</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:description>Made available in DSpace on 2012-06-27T21:31:00Z (GMT). No. of bitstreams: 2
Sadeghi_Mohammad_Amin.pdf: 12334753 bytes, checksum: 738a2c76fd1c4928e84a9747bcd9b451 (MD5)
license.txt: 4066 bytes, checksum: e11c5bd6828b3d05964feec70e3062c8 (MD5)</dc:description>
          <dc:description>Item marked as restricted to the 'Administrator' Group (id=1) by William Ingram (wingram2@illinois.edu) on 2012-06-27T21:32:46Z
Item is restricted until 2014-06-27T21:32:23Z</dc:description>
          <dc:description>Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:28Z
Item was in collections:
Graduate Theses and Dissertations at Illinois (ID: 204)
Dissertations and Theses - Computer Science (ID: 587)
No. of bitstreams: 2
Sadeghi_Mohammad_Amin.pdf: 12334753 bytes, checksum: 738a2c76fd1c4928e84a9747bcd9b451 (MD5)
license.txt: 4066 bytes, checksum: e11c5bd6828b3d05964feec70e3062c8 (MD5)</dc:description>
          <dc:description>Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:28Z</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/32060</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2012 Mohammad Amin Sadeghi and Ali Farhadi under Creative Commons</dc:rights>
          <dc:subject>Visual Phrase</dc:subject>
          <dc:subject>Phrasal Recognition</dc:subject>
          <dc:subject>Visual Composites</dc:subject>
          <dc:subject>Object Recognition</dc:subject>
          <dc:title>Recognition using visual phrases</dc:title>
          <dc:type>text</dc:type>
          <dc:contributor>Forsyth, David A.</dc:contributor>
          <dc:creator>Sadeghi, Mohammad Amin</dc:creator>
          <dc:date>2012-06-27T21:31:00Z</dc:date>
          <dc:date>2014-06-28T10:00:28Z</dc:date>
          <dc:date>2012-05</dc:date>
          <dc:date>2012-06-27T21:31:00Z</dc:date>
          <dc:date>2012-05</dc:date>
          <dc:description>In this thesis I introduce visual phrases, complex visual composites like ``a person riding a horse''.  Visual phrases often display significantly reduced
visual complexity compared to their component objects, because the appearance of those objects can change profoundly when they participate in relations. I introduce a dataset suitable for phrasal recognition that uses familiar PASCAL object categories, and demonstrate significant experimental gains resulting from exploiting visual phrases.
I show that a visual phrase detector significantly outperforms a baseline which detects component objects and reasons about relations, even though visual phrase training sets tend to be smaller than those for objects.  I argue that any multi-class detection system must decode detector outputs to produce final results; this is usually done with non-maximum suppression.  I describe a novel decoding procedure that can account accurately for local context without solving difficult inference problems.  I show this decoding procedure outperforms the state of the art.  Finally, I show that decoding a combination of phrasal and object detectors produces real improvements in detector results.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-04-25T20:23:32Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 1
Sadeghi_Mohammad_Amin.pdf: 12334753 bytes, checksum: 738a2c76fd1c4928e84a9747bcd9b451 (MD5)</dc:description>
          <degree>
            <department>Computer Science</department>
            <departmentCode>1434</departmentCode>
            <discipline>Computer Science</discipline>
            <disciplineCode>0112</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
            <program>PHD:Computer Science -UIUC</program>
            <programCode>10KS0112PHD</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
