Open Access Open Access  Restricted Access Subscription or Fee Access

Face Recognition using Binary SIFT and it’s Robustness against Face Variations

Rahul Prakash, Padmavati Padmavati

Abstract


SIFT algorithm is one of the most notable algorithm
being used for feature extraction. In order to detect the object, these extracted features should be matched with the features extracted from the target image. For the matching purpose there are number of algorithms (Euclidian distance, Cityblock, correlation etc) to compute
the distance between extracted features. But the space and time complexity of this algorithm is high enough to meet the real time requirements because of having the large feature vector space (256128). To overcome this drawback, Binary-SIFT is introduced by Kadir A. Peker having a very small feature vector space (comparatively) and
meets the real time requirements by using the XOR function for matching purpose which needs very less time in comparison with the technique mentioned above. In this paper we have done the performance evaluation of SIFT and Binary- SIFT on test images of Indian face database and The ORL Database of Faces. The performance of both the algorithms is same if the variation (change in
scale, illumination and rotation) in the image is very low. But as the variation increases the Binary-SIFT algorithm began to lack the performance in comparison with SIFT.


Keywords


Binary-SIFT, DoG (Difference of Gaussian), Keypoints, SIFT, XOR.

Full Text:

PDF

References


David G. Lowe “Distinctive image features from scale-invariant

keypoints”, International Journal of Computer Vision. 60(2): 91-110,

Available:www.cs.ubc.ca/~lowe/papers/ijcv04.pdf

Herbert Bay, Tinne Tuytelaars, and Luc Van Gool”SURF: Speeded up

robust features” Computer Vision and Image Understanding 110 (2008).

Available:www.vision.ee.ethz.ch/~surf/eccv06.pdf

Feng-Cheng Huang Shi-Yu Huang, Ji-Wei Ker Yung-Chang Chen,”High

performance sift hardware accelerator for real time image feature

extraction ” Accepted In IEEE Journal.

Kadir A. Peker “Binary SIFT: Fast image retrieval using binary quantized

features” 2011 IEEE.

Michael Calonder, Vincent Lepetit, Mustafa Özuysal, Tomasz Trzcinski,

Christoph Strecha, and Pascal Fua, “BRIEF: Computing a local binary

descriptor very fast”, Digital Object Identifier IEEE 2011.

Available:cvlab.epfl.ch/~lepetit/papers/calonder_pami11.pdf

E. Jauregi, E. Lazkano and B. Sierra “Object recognition using region

detection and feature extraction.”

Available:www.sc.ehu.es/ccwrobot/publications/papers/jauregi09object.

pdf

F. Samaria and A. Harter “Parameterisation of a stochastic model for

human face identification” 2nd IEEE workshop on Applications of

Computer Vision December 1994 Sarasota (Florida).

Vidit Jain and Amitabha Mukherjee "The Indian Face Database" 2002.

Availabe:http://vis-www.cs.umass..edu/$sim$vidit/{I}ndian{F}ace{D}

atabase/

Rafel C. Gonzalez, Richard E. woods “Digital image processing.”

Mohamed Aly “Face Recognition Using SIFT Features” CNS186 Term

Project winter 2006.

Bo Dai, Dengsheng Zhang, Hui Liu, Shixin Sun, KeLi “Evaluation of

Face Recognition Techniques.” Proc. Of SPIE vol. 7489 74890M-1.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.