Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16170
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rohil, Mukesh Kumar | - |
dc.date.accessioned | 2024-10-24T10:17:20Z | - |
dc.date.available | 2024-10-24T10:17:20Z | - |
dc.date.issued | 2024-01 | - |
dc.identifier.uri | https://link.springer.com/article/10.1007/s11042-023-17951-w | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16170 | - |
dc.description.abstract | Local features of an image provide a robust way of image matching if they are invariant to large variations in scale, viewpoint, illumination, rotation, and affine transformations. In this paper, we propose a novel feature descriptor based on circular and elliptical local sampling of image pixels to attain fast and robust results under varying imaging conditions. The proposed descriptor is tested on a standard benchmark dataset comprising of images with varying imaging conditions and compression quality. Results show that the proposed method generates sufficient or more number of stable and correct matches between an image pair (original image and distorted image) as compared to SIFT with a speedup of 1.6 on average basis. The paper also discusses the reason of choosing SIFT descriptor for comparison and its efficacy in different scenarios. The paper also reasons the robustness of hand crafted feature descriptors and why they hold an upper hand among many other deep learning methods. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Image pair | en_US |
dc.subject | SIFT | en_US |
dc.subject | Deep Learning (DL) | en_US |
dc.title | An elliptical sampling based fast and robust feature descriptor for image matching | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Computer Science and Information Systems |
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.