Implementation of SIFT in C



Scale-invariant feature transform (or SIFT) is an algorithm in computer vision to detect and describe local features in images. For any object in an image, interesting points on the object can be extracted to provide a “feature description” of the object. The algorithm was published by David Lowe in 1999[1].This paper gives a review and describes how SIFT extract the image features that have many properties that make them suitable for matching differing images of an object or scene. The features are invariant to image scaling and rotation, and partially invariant to change in illumination and 3D camera view point [2]. They are well localized in both the spatial and frequency domains, reducing the probability of disruption by occlusion, clutter, or noise. Large numbers of features can be extracted from typical images with efficient algorithms.


[1]. Lowe, David G. (1999). “Object recognition from local scale-invariant features”. Proceedings of the International Conference on Computer Vision 2. pp. 1150–1157.

[2]. “Method and apparatus for identifying scale invariant features in an image and use of same for locating an object in an image”, David Lowe’s patent for the SIFT algorithm, March 23, 2004.

MATLAB Implementation of segmentation-based disparity averaging

MATLAB implementation of accumulator-based raw disparity computation


There are no reviews yet.

Be the first to review “Implementation of SIFT in C”

Your email address will not be published. Required fields are marked *

SKU: P2018F230 Category: