<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-19T12:59:34Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/139159" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/139159</identifier><datestamp>2022-01-15T03:02:08Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Roy, Nicholas</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Peraire-Bueno, James A.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Aeronautics and Astronautics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-01-14T14:53:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-01-14T14:53:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021-06</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2021-06-16T13:26:57.960Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1721.1/139159</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">In this thesis, we set out to find an algorithm that uses only geometric primitives to represent an input pointcloud. In addition to the problems faced in general primitive fitting, non-discriminable data presents additional data association challenges. We propose to address these challenges by estimating the existence rather than parameters of geometric primitives, and explore various options to do so. We first explore a sampling-based Markov-Chain Monte-Carlo approach together with a ray likelihood model. We then explore a neural network approach and finish by presenting a method to make the Chamfer distance differentiable with respect to primitive existence.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">S.M.</dim:field>
   <dim:field mdschema="dc" element="publisher">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights">In Copyright - Educational Use Permitted</dim:field>
   <dim:field mdschema="dc" element="rights">Copyright MIT</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://rightsstatements.org/page/InC-EDU/1.0/</dim:field>
   <dim:field mdschema="dc" element="title">Inferring the Existence of Geometric Primitives to Represent Non-Discriminable Data</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="mit" element="thesis" qualifier="degree">Master</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Master of Science in Aeronautics and Astronautics</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="f433c377-2eec-4607-9d4c-d27c2e4a6f55">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Inferring the Existence of Geometric Primitives to Represent Non-Discriminable Data&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2021-06&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Peraire-Bueno, James A.&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://rightsstatements.org/page/InC-EDU/1.0/&lt;/License>
   	&lt;Abstract>In this thesis, we set out to find an algorithm that uses only geometric primitives to represent an input pointcloud. In addition to the problems faced in general primitive fitting, non-discriminable data presents additional data association challenges. We propose to address these challenges by estimating the existence rather than parameters of geometric primitives, and explore various options to do so. We first explore a sampling-based Markov-Chain Monte-Carlo approach together with a ray likelihood model. We then explore a neural network approach and finish by presenting a method to make the Chamfer distance differentiable with respect to primitive existence.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>