Point cloud registration using quantile assignment
buir.advisor | Pınar, Mustafa Ç. | |
buir.advisor | Karaşan, Oya | |
dc.contributor.author | Oğuz, Ecenur | |
dc.date.accessioned | 2023-07-26T12:39:30Z | |
dc.date.available | 2023-07-26T12:39:30Z | |
dc.date.copyright | 2023-07 | |
dc.date.issued | 2023-07 | |
dc.date.submitted | 2023-07-20 | |
dc.description | Cataloged from PDF version of article. | |
dc.description | Thesis (Master's): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2023. | |
dc.description | Includes bibliographical references (leaves 53-60). | |
dc.description.abstract | Point cloud registration is a fundamental problem in computer vision with a wide range of applications. The problem mainly consists of three parts: feature estimation, correspondence matching and transformation estimation. We introduced the Quan-tile Assignment problem and proposed a solution algorithm to be used in a point cloud registration framework for establishing the correspondence set between the source and the target point clouds. We analyzed different common feature descriptors and transformation estimation methods to combine with our Quantile Assignment algorithm. The performance of these approaches together with our algorithm are tested with controlled experiments on a dataset we constructed using well-known 3D models. We detected the most suitable methods to combine with our approach and proposed a new end-to-end pairwise point cloud registration framework. Finally, we tested our framework on both indoor and outdoor benchmark datasets and compared our results with state-of-the-art point cloud registration methods in the literature. | |
dc.description.provenance | Made available in DSpace on 2023-07-26T12:39:30Z (GMT). No. of bitstreams: 1 B162259.pdf: 4621841 bytes, checksum: e64768773218699544470a9f2d81993e (MD5) Previous issue date: 2023-07 | en |
dc.description.statementofresponsibility | by Ecenur Oğuz | |
dc.embargo.release | 2024-01-15 | |
dc.format.extent | xiii, 66 leaves : illustrations, charts ; 30 cm. | |
dc.identifier.itemid | B162259 | |
dc.identifier.uri | https://hdl.handle.net/11693/112441 | |
dc.language.iso | English | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.subject | Point cloud registration | |
dc.subject | Fast Point Feature Histograms (FPFH) descriptor | |
dc.subject | Quantile assignment | |
dc.subject | Iterative closest point algorithm | |
dc.subject | Bipartite graph matching | |
dc.subject | Hungarian algorithm | |
dc.subject | Hopcroft-Karp algorithm | |
dc.title | Point cloud registration using quantile assignment | |
dc.title.alternative | Niceliksel atama yöntemi ile nokta bulutu eşleştirme probleminin çözülmesi | |
dc.type | Thesis | |
thesis.degree.discipline | Industrial Engineering | |
thesis.degree.grantor | Bilkent University | |
thesis.degree.level | Master's | |
thesis.degree.name | MS (Master of Science) |