1.Introduction
SIFT(Scale Invariant Feature Transform) featuers are invariant to image scaling and ratation, and patially robust to change in illumination and 3D camera viewpoint. SIFT descriptor is a classical local descriptor, which has been applied for many computer vision applications, such as image classification, image matching, and etc.
The properties of SIFT features:
 SIFT features are invariant to image scaling and roration, and patially invariant to change in illumination and 3D camera viewpoint. The featues are also robust to illuminatin, occlusion and affine transform.
 SIFT features are highly distinctive, which allows a single feature to be correctly matched with high probability against a large database of features, providing a basis for object and scene recognition.
 Lots of numbers of features can be generaed from few objects.
 RealTime: For object recognition, SIFT features can be matched quickly in large database.
 SIFT also have the the ability to detect small objects in cluttered backgrounds requires that at least 3 features be correctly matched from each object for reliable identification.
In this blog, we simply summary SIFT featues and its properties. In section 2, the produce of SIFT features caculation is introduced. In section 3, we will analysis SIFT features in depth and try to answer the question: why are SIFT features invariant to image scaling and rotation? why are SIFT featues robust to illumination? In addition, this blog is written in English and Chinese.
2.The Process of SIFT calculation(摘抄原文[1])
 Scalespace extrema detection（尺度空间的极点检测）:The first stage of computation searches over all scales and image locations. It is implemented efficiently by using a differenceofGaussian function to identify potential interest points that are invariant to scale and orientation. （所有图像所有尺度和位置，使用differenceofGaussian function检测出具有尺度不变性和方向不变性的interst points）
 Keypoint localization(特征点定位): At each candidate location, a detailed model is fit to determine location and scale. Keypoints are selected based on measures of their stability. (这一步是在所有的特征点中，选择出具有稳定性的特征点)
 Orientation assignment(赋予方向): One or more orientations are assigned to each keypoint lo cation based on local image gradient directions. All future operations are performed on image data that has been transformed relative to the assigned orientation, scale, and location for each feature, thereby providing invariance to these transformations.
 Keypoint descriptor(特征点描述子): The local image gradients are measured at the selected scale in the region around each keypoint. These are transformed into a representation that allows for significant levels of local shape distortion and change in illumination.
2.1 Scalespace extrema detection
 Construct image scale space based on Gaussian function:
where, $\ast$ is the convolution operation in x and y, and
Using scalespace extrema in the differenceofGuassian function convolved with the image to efficiently detect stable keypoint locations in the scale space.
One octave represents one resolution of an image. In each octave, different scalespace of the image are constructed by the gaussian function. Adjacent Gaussian images are subtracted to produce the differenceofGaussian images on the right. After each octave, the Gaussian image is downsampled by a factor of 2, and the process repeated.
1. Why is gaussian function used to construct scale space?
Koenderink (1984) and Lindeberg (1994) has proof that Gasussian function is only one scalespace kernel in linear space, and thus to construct scale space by Gaussian function is reasonable.
2. Why is difference of gaussian function a scale invariant features detector?
DifferenceofGaussian function approximates to the the scalenormalized gaussian, $\sigma^{2}\nabla^{2}G$. Lindeberg (1994) claimed in his research：scalenormalized Laplacian of Gaussian, $\sigma^{2}\nabla^{2}G$, with scaleinvariant property，and the maximum and minimum of the $\sigma^{2}\nabla^{2}G$ can produce the most stable image features compared to a range of other possible image funcitons, such as gradient, Hessian, or Harris corner function.
The relationship between $D$ and $\sigma\nabla^{2}G$:
and
Thus:
we can see that the difference between differenceofgaussian function and scalenormalized gaussian function is scale factor of $\sigma^{2}$，where $(k1)$ is constant and don’t effect the location of extrema.
 local extrema detection how to locate local extrema（including local maxima and minima）?
Each sample point is compared to its eight neighbors in the current image and nine neighbors in the sccale above and below.
2.2 Keypoint localization
2.2.1 Accurate keypoint localization
根据选出的candidate keypoints,使用模型进一步准确拟合出Keypoints的位置（即计算出Keypoints的偏移量），在[link]: http://blog.csdn.net/zddblog/article/details/7521424 “zddhub”的博客中提到：图片是离散空间，而离散空间中的极值点并不是真正的极值点，从离散空间中寻找连续空间中极值点的是连续插值直至收敛。
文中采用的是Brown and Lowe,2002提出的泰勒二阶拟合的方法：
令$D(x)$的导数为零可以求得sample point $x=(x,y,\sigma)^{T}$的偏移量：
进一步求得keypoints的准确位置：
Why is the function value at the extremumm, $D(\hat{x})$ useful for rejecting unstable extrema with low constrast. 未填
2.2.2 Eliminating Edge Responses
what’s the stability for the keypoint? 文中指出：for stability, it is not sufficient to reject keypoints with low constrast,The differenceof Gaussian function will have a strong response along edges, even if the location along the edge is poorly determined and therefore unstable to small amounts of noise.
并且 A poorly defined peak in the differenceofGaussian function will have a large principal curvature(曲率) across the edge but a small one in the perpendicular direction.
The priciple curvatures can be computed by the a $2x2$ Hessian matrix, $H$, is computed at the location and sccale of the keypoint:
文中指出：The eigenvalues of $H$ are proportional to the principal curvatures of $D$. 但文中并不直接计算Hessian matrix $H$ 的特征值，而是通过计算最大特征值$\alpha$和次大特征值$\beta$的比值:
虽然某一点的曲率可以取正负，但经过local extrema步骤筛选之后，not extrema is filtered, 因此$Det(H)$ 不太可能取负值。The ratio between the largest magnitude eigenvalue and the smaller one, let‘s $\alpha=r \beta$:
which depends only on the ratio of the eigenvalues rather than their individual values. The quantity $(r + 1)^{2}/r$ is at a minimum when the two eigenvalues are equal and it increases with r. Therefore, to check that the ratio of principal curvatures is below some threshold, r, we only need to check
通过直接计算最大特征值$\alpha$和次大特征值$\beta$的比值，使得运算非常快捷。下图展示了r=10消除principal curvatures大于10的,效果图（c）–>(d)：
2.3 Orientation assignment
给每个特征点赋予方向信息：利用关键点邻域像素的梯度方向分布特性为每个关键点指定方向参数。实现旋转不变的基本思想是采用“相对”的概念,利用领域像素的梯度方向的分布，为每个关键点赋予方向信息。使得后面的local descriptor 是相对于这个方向生成的，从而实现匹配图像的旋转无关性。 因此，对于每个已检测的关键点，考虑该关键点$16\times 16$的领域，分别计算gradient以及magnitude.
将gradient(0~360 degree)分成10 bins,利用高斯加权对方向直方图进行平滑，增加稳定性。距离中心点越远的领域对直方图的贡献也小。通过比较峰值，求取关键点的方向(peak为主方向，其他超过peak 80%的为辅助方向)。
For each Keypoint, it contains information of location$(x,y)$, scale, and orientation, and thus it’s scaleinvariant, shiftinvariant, and orientationinvariant.
2.4 Descriptor representation（梯度方向直方图，128维向量）
基于每个特征点生成local descriptor, 主要思路是: 基于每个特征点，考虑特征点的邻域, i.e $16\times 16$的梯度信息，将其分块，计算梯度直方图，生成具有独特性的feature. 下图是以$8\times 8$邻域为例子，将其分成$2\times 2$图像块，计算梯度直方图(8 bins).
以下图为例：
考虑keypoint为8x8的邻域，将其领域分成2x2的的区域（descriptor），每一个区域为4x4的subimage,在每一个subimage中做梯度方向直方图，每45度为一bin,一共8bin. 那么这个SIFT特征维度为：2x2x8=32. 文中实验考虑的是16x16的邻域，4x4的descriptor,8 bins,因此SIFT特征的维度为：4x4x8 = 128.
最后一步则是将SIFT特征归一化，进一步消除光照的影响
 确定计算local discriptor生成的neighborhood, 可以是矩形，也可以是圆，这里以圆为例子:
where, $\sigma_{oct}$ is the scale function, $d=4$.
 将领域内的像素做affine transform, 旋转至关键点主方向.
 对图像领域内的像素求梯度方向以及幅值，对每个梯度幅值乘以高斯权重生成直方图。Gradient gistogram of local descriptor 是关键点所在尺度的模糊图像计算产生，生成直方图的计算如下：
where $x_{k}$是该点与关键点的列距离, $y_{k}$是该点与关键点的行距离，$\sigma_{\omega}$ 等于描述子窗口宽度$3\sigma$直方图列数取一半, $\omega$ 表示直方图某个bin的数值。

在窗口宽度为$2\times 2$的区域内计算8个方向的梯度直方图，累计每个方向的数值，形成该区域内的梯度直方图。然后在下一个$2\times 2$区域重复该步骤。共生成16个梯度直方图。

Normalization:
Raw descriptor: $\omega=(\omega_{1},\omega_{2},…,\omega_{128})$ Normalized Feature: $I=(I_{1},I_{2},…,I_{128})$
Reference

Previous
Network in Network 
Next
NoteSpatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognition