Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/2477
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDurgam, U K-
dc.contributor.authorPaul, S-
dc.contributor.authorPati, U C-
dc.date.accessioned2016-03-29T13:33:23Z-
dc.date.available2016-03-29T13:33:23Z-
dc.date.issued2016-03-
dc.identifier.citationIEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS), Bhopal, India, 5-6 March 2016en_US
dc.identifier.urihttp://hdl.handle.net/2080/2477-
dc.descriptionCopyright belongs to proceeding publisheren_US
dc.description.abstractSub-pixel accuracy in registration of synthetic aperture radar (SAR) images is still a challenging task in remote sensing applications. Speeded Up Robust Feature (SURF) is one of the most popularly used method for feature detection and description of SAR images. But using SURF alone in registration cannot give accurate matching in corresponding features, as it contains many wrong correspondences called outliers. RANSAC (Random Sample Consensus) an outlier removal technique is nused to remove those outliers. Even then some outliers still exist which degrade the registration quality. In this paper, a novel algorithm is proposed to remove those remaining outliers by limiting the RMSE to less than 0.5 in registration process. Firstly, SURF based feature matching is performed between image pairs to get the corresponding features, then RANSAC is used to remove most of the outliers obtained from SURF feature matching. Then, the proposed method is applied to still refine the matched features obtained after RANSAC.en_US
dc.publisherIEEEen_US
dc.subjectSpeeded Up Robust featureen_US
dc.subjectAffine transformationen_US
dc.subjectRandom sample consensusen_US
dc.titleSURF Based Matching for SAR Image Registrationen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2016_SCEECS_Durgan_PID4068465.pdf1.97 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.