A new method for data association in 3-d localization: One-point ransac with epipolar constraint
dc.contributor.advisor | Erdem, Arif Tanju | |
dc.contributor.author | Kiliç, Selçuk | |
dc.date.accessioned | 2020-12-06T14:17:23Z | |
dc.date.available | 2020-12-06T14:17:23Z | |
dc.date.submitted | 2014 | |
dc.date.issued | 2018-08-06 | |
dc.identifier.uri | https://acikbilim.yok.gov.tr/handle/20.500.12812/103638 | |
dc.description.abstract | Konum belirleme ve SLAM problemleri robotik yaynlarnda yuksek ilgi toplams vedegisik ortamlarda, bir insansz ajann basar ile calsabilmesi icin onemi kaydedilmistir.Bu problemler icin bulunan cozumlerin basarl olanlar genellikle Genisletilmis KalmanFiltreleri ve Parcack Filtreleri gibi gurultu ltreleri temellidir. Bu problemler belirtilenltrelerin kullanm ile temel olarak veri eslestirme problemine indirgenir. Bukonu uzerine de son yllardaki robotik yaynlarnda yuksek ilgi toplanms ve cesitlicozumler onerilmistir.Bu tez raporunda ilk olarak en cok calslms veri eslestirmeyontemleri, ornegin Joint Compatibility, Sequential Compatibility Nearest Neighbor,Joint Maximum Likelihood, one point RANSAC ve epipolar uygunluk yontemleri incelenmistir. _Ikinci bolumde ise RANSAC ve epipolar geometri tabanl yeni bir yontemolan One-Point RANSAC with Epipolar Constraint (OPRF) sunulmustur. Bu metodunepipolar uygunluk yontemi ile performans ve tutarllk acsndan karslastrmasonuclar da eklenmistir. | |
dc.description.abstract | The problem of Localization or Simultaneous Localization and Mapping has receiveda great deal of attention within the robotics literature, and the importance of thesolutions to this problem has been well documented for successful operation of autonomousagents in a number of environments. Of the numerous solutions that havebeen developed for solving the problems, many of the most successful approachescontinue to either rely on, or stem from noise ltering techniques, especially the ExtendedKalman Filter method or Particle Filtering methods. Localization problemsare downgraded to a data association problem after using mentioned lters. This topichas also received a great deal of attention in the robotics literature in recent years,and various solutions have been proposed. In the thesis, rst mostly studied methods,such as Joint Compatibility, Sequential Compatibility Nearest Neighbor, JointMaximum Likelihood, one point RANSAC and epipolar consistency, are studied. Asthe second part of the thesis a new method is presented. One-Point RANSAC withEpipolar Constraint (OPRF) is based on RANSAC and epipolar geometry. Later theperformance and consistency of the method will be compared to epipolar consistencysolution. | en_US |
dc.language | English | |
dc.language.iso | en | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.rights | Attribution 4.0 United States | tr_TR |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject | Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol | tr_TR |
dc.subject | Computer Engineering and Computer Science and Control | en_US |
dc.title | A new method for data association in 3-d localization: One-point ransac with epipolar constraint | |
dc.title.alternative | Üç boyutlu konumlandırma problemleri için yeni bir veri eşleştirme çözüm yöntemi: One-poınt ransac wıth epıpolar constraınt | |
dc.type | masterThesis | |
dc.date.updated | 2018-08-06 | |
dc.contributor.department | Bilgisayar Bilimleri ve Mühendisliği Anabilim Dalı | |
dc.identifier.yokid | 10048799 | |
dc.publisher.institute | Fen Bilimleri Enstitüsü | |
dc.publisher.university | ÖZYEĞİN ÜNİVERSİTESİ | |
dc.identifier.thesisid | 371124 | |
dc.description.pages | 42 | |
dc.publisher.discipline | Diğer |