Image matching based on SIFT features and kd-tree

This paper uses the specific SIFT (Scale Invariant Feature Transform) feature and a fast kd-tree matching strategy combined with invariant feature to solve single face recognition problems. It transforms face image data into scale-invariant coordinates relative to local features. The similarity was computed using Euclidean distance and kd-tree search. Experiments show that the features are invariant to image scaling, translation, rotation, and change in viewpoint.

[1]  Maxim Shevtsov,et al.  Highly Parallel Fast KD‐tree Construction for Interactive Ray Tracing of Dynamic Scenes , 2007, Comput. Graph. Forum.

[2]  Chris Harris,et al.  Geometry from visual motion , 1993 .

[3]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[4]  I. Wald,et al.  On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[5]  Wang Yang.  Single-Sample Face Recognition Using SIFT Features , 2008 .

[6]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[7]  Cordelia Schmid,et al.  Scale & Affine Invariant Interest Point Detectors , 2004, International Journal of Computer Vision.

[8]  Zhi-Hua Zhou,et al.  Face recognition from a single image per person: A survey , 2006, Pattern Recognit..

[9]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.