Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/9389
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gupta, Karunesh Kumar | - |
dc.date.accessioned | 2023-02-28T11:14:26Z | - |
dc.date.available | 2023-02-28T11:14:26Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/document/8423880 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9389 | - |
dc.description.abstract | Feature detection and feature matching have been essential parts of Computer Vision algorithms. Feature detection algorithms like Scale Invariant Feature Transform (SIFT) form the basis of every feature extraction algorithm proposed till date. Since SIFT was proposed, researchers are continuously exploring the possibilities with it. It is one of the most prominently used algorithm or feature matching because of its invariance to scale. One of the other widely used algorithm in Computer Vision is Speeded up Robust features (SURF). In this paper, SIFT and SURF algorithms are compared and analysed under different object and background conditions. The SIFT algorithm performs better than SURF under blur and illumination changes. It also holds true for two different images where one image is being subjected to such property changes. The SURF will always perform faster than SIFT. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | EEE | en_US |
dc.subject | SIFT | en_US |
dc.subject | SURF | en_US |
dc.subject | Features matching | en_US |
dc.subject | illumination | en_US |
dc.title | A Comparative Study of SIFT and SURF Algorithms under Different Object and Background Conditions | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Electrical and Electronics Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.