Q-CSLBP: compression of CSLBP descriptor

Authors:
Junaid Baber;Shin'ichi Satoh;Nitin Afzulpurkar;Maheen Bakhtyar
Affiliations:
School of Engineering and Technology, Asian Institute of Technology, Thailand;Multimedia Information Research Division, National Institute of Informatics, Japan;School of Engineering and Technology, Asian Institute of Technology, Thailand;School of Engineering and Technology, Asian Institute of Technology, Thailand
Venue:
PCM'12 Proceedings of the 13th Pacific-Rim conference on Advances in Multimedia Information Processing
Year:
2012

Citing 6
Cited 0

Scale & Affine Invariant Interest Point Detectors

International Journal of Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
A Performance Evaluation of Local Descriptors

IEEE Transactions on Pattern Analysis and Machine Intelligence
Speeded-Up Robust Features (SURF)

Computer Vision and Image Understanding
Description of interest regions with local binary patterns

Pattern Recognition
PCA-SIFT: a more distinctive representation for local image descriptors

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Center Symmetric-Local Binary Pattern (CSLBP) is textured based operator which is mostly used as keypoint descriptor, it is 256-length descriptor to represent single keypoint or affine patch. This operator is an extension of Local Binary Pattern (LBP) operator. The CSLBP descriptor is computationally simple, effective, and robust for various image transformations such as illumination change and image blurring. However, the space and time utilization of CSLBP can be improved by simple compression which can make CSLBP a smart selection for large databases and smart phones. In this paper, we propose simple compression of CSLBP without loss of its discriminative power. We reduce the descriptor length (dimensions) upto 50% without applying any dimensionality reduction techniques such as PCA or LDA. We evaluate our framework on state-of-the-art matching protocols and compare the effectiveness of proposed compressed descriptor (Q-CSLBP) with CSLBP, SIFT and PCA-SIFT.