ABSTRACT
In this paper, we define a new metric, the Fragile Bit Weight (FBW), which is used in binary feature matching and measures how two features differ. High FBWs are associated with genuine matches between two binary features and low FBWs are associated with impostor ones. One bit in binary feature is deemed fragile if its sign of value reverses easily across the local image patch that has changed slightly. Previous binary feature extract algorithms ignore the fact that the signs of fragile bits are not stable through image transform. Rather than ignore fragile bits completely, we consider what beneficial information can be obtained from those fragile bits. In our approach, we exploit FBW as a measure in binary feature match to remove the false matches. In experiments, using FBW can effectively remove the false matches and highly improve the accuracy of feature match. Then, we find that fusion of FBW and Hamming distance work better in feature matching than Hamming distance alone. Furthermore, FBW can easily integrate in the well-established binary feature schemes if those descriptor bit in extract from comparison of pixels.
- Rublee, E.; Rabaud, V.; Konolige, K. and Bradski, G. "ORB: An efficient alternative to SIFT or SURF." Computer Vision (ICCV), 2011 IEEE International Conference on, 2011, 2564--2571. Google ScholarDigital Library
- Leutenegger, S.; Chli, M. and Siegwart, R. "BRISK: binary robust invariant scalable keypoints." Computer Vision (ICCV), 2011 IEEE International Conference on, 2011, 2548--2555 Google ScholarDigital Library
- Calonder, M.; Lepetit, V.; Ozuysal, M.; Trzcinski, T.; Strecha, C. and Fua, P. "BRIEF: Computing a local binary descriptor very fast." Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2012, 34, 1281--1298 Google ScholarDigital Library
- Alahi, A.; Ortiz, R. and Vandergheynst, P. "FREAK: Fast Retina Keypoint." Computer Vision and Pattern Recognition, 2012. CVPR '12. IEEE Conference on, June 16--21, 2012 Google ScholarDigital Library
- Lowe, D. G. "Distinctive Image Features from Scale-Invariant Keypoints." International Journal of Computer Vision, 2004, 60, 91--110 Google ScholarDigital Library
- Bay, H.; Tuytelaars, T. and Van G., L. "SURF: Speeded Up Robust Features." ECCV 2006, 2006, 3951, 404--417 Google ScholarDigital Library
- Gupta, R.; Mittal, A. Forsyth, D.; Torr, P. and Zisserman, A. "SMD: a Locally atable monotonic change invariant feature descriptor." ECCV 2008, Springer Berlin / Heidelberg, 2008, 5303, 265--277 Google ScholarDigital Library
- Zhuang, D.; Zhang, D.; Li, J. and Tian, Q. "a novel binary feature from intensity difference quantization between random sample of points." Advances in Multimedia Modeling, Springer, 2013, 7733, 228--238Google Scholar
- Mikolajczyk, K. and Schmid, C. "A performance evaluation of local descriptors." Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2005, 27, 1615--1630 Google ScholarDigital Library
- Philbin, J.; Chum, O.; Isard, M.; Sivic, J. and Zisserman, A. "Object retrieval with large vocabularies and fast spatial matching." Computer Vision and Pattern Recognition 2007. CVPR '07. IEEE Conference on, 2007, 1--8Google Scholar
- Tan, Xiaoyang, and Bill Triggs. "Enhanced local texture feature sets for face recognition under difficult lighting conditions." Analysis and Modeling of Faces and Gestures. Springer Berlin Heidelberg, 2007. 168--182. Google ScholarDigital Library
- Wei Liu, Jun Wang, Sanjiv Kumar, Shih-Fu Chang. "Hashing with Graphs." ICML 2011: 1--8.Google Scholar
- Wei Liu, Jun Wang, Rongrong Ji, Yu-Gang Jiang, Shih-Fu Chang. "Supervised hashing with kernels." CVPR 2012: 2074--208 Google ScholarDigital Library
- Charikar, M. S. "Similarity estimation techniques from rounding algorithms." Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, ACM, 2002, 380--388 Google ScholarDigital Library
- Indyk, P. and Motwani, R. "Approximate nearest neighbors: towards removing the curse of dimensionality." Proceedings of the thirtieth annual ACM symposium on Theory of computing, ACM, 1998, 604--613 Google ScholarDigital Library
- Weiss, Y.; Torralba, A. B. and Fergus, R. "Spectral Hashing." Neural Information Processing Systems, 2008, 1753--1760Google Scholar
- Kulis, B. and Grauman, K. "Kernelized locality-sensitive hashing for scalable image search." International Conference on Computer Vision, 2009, 2130--2137Google Scholar
- Raginsky, M. and Lazebnik, S. "Locality-sensitive binary codes from shift-invariant kernels." The Neural Information Processing Systems, 2009, 22Google Scholar
- Wang, J.; Kumar, S. and Chang, S. Semi-supervised hashing for scalable image retrieval Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on, 2010, 3424--3431Google Scholar
- Wang, J.; Kumar, S. and Chang, S.-F. "Semi-Supervised Hashing for Large-Scale Search." Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2012, 34, 2393--2406 Google ScholarDigital Library
- Strecha, C.; Bronstein, A.; Bronstein, M. and Fua, P. "LDAHash: Improved Matching with Smaller Descriptors." Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2012, 34, 66--78 Google ScholarDigital Library
- Zhou, W.; Li, H.; Lu, Y. and Tian, Q. "Scalar Quantization for Large Scale Image Search." ACM Multimedia, Full Paper,, 2012 Google ScholarDigital Library
- Zhou, W.; Li, H.; Wang, M.; Lu, Y. and Tian, Q. "Binary SIFT: Towards Efficient Feature Matching Verification for Image Search." ACM ICIMCS, 2012 Google ScholarDigital Library
- Rosten, E. and Drummond, T. "Fusing points and lines for high performance tracking Computer Vision.", 2005. ICCV 2005. Tenth IEEE International Conference on, 2005, 2, 1508--1515 Vol. 2 Google ScholarDigital Library
- Ozuysal, M.; Calonder, M.; Lepetit, V. and Fua, P. "Fast Keypoint Recognition Using Random Ferns." Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2010, 32, 448--461 Google ScholarDigital Library
- Tang, F.; Lim, S.; Chang, N. and Tao, H. "A novel feature descriptor invariant to complex brightness changes." Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, 2009, 2631--2638Google Scholar
- Zhang, L.; Zhang, Y.; Tang, J.; Lu, K. and Tian, Q. "Binary Code Ranking with Weighted Hamming Distance." 2013 IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Portland, Oregon, June 23--28, 2013. Google ScholarDigital Library
- Zhou, W.; Lu, Y,; Li, H.; Song, Y. and Tian, Q. "Spatial Coding for Large Scale Partial-Duplicate Web Image Search." ACM Multimedia, Florence, Italy, October 25--29, 2010. Google ScholarDigital Library
- Zhang, S.; Tian, Q.; Hua, G.; Huang, Q. and Li, S. "Descriptive Visual Words and Visual Phrases for Image Applications." ACM Multimedia 2009, October 19--23, 2009, Beijing, China. Google ScholarDigital Library
Index Terms
- Improved binary feature matching through fusion of hamming distance and fragile bit weight
Recommendations
Binary feature fusion for discriminative and secure multi-biometric cryptosystems
AbstractBiometric cryptosystem has been proven to be a promising approach for template protection. Cryptosystems such as fuzzy extractor and fuzzy commitment require discriminative and informative binary biometric input to offer accurate and ...
Highlights- Propose a binary feature fusion approach for multi-biometric cryptosystems
- ...
Lightweight Binary Voxel Shape Features for 3D Data Matching and Retrieval
BIGMM '15: Proceedings of the 2015 IEEE International Conference on Multimedia Big DataThis paper proposes several lightweight local 3D shape features for 3D voxel data that yield compact binary feature vectors. These features are inspired by compact binary features for 2D image, namely, Local Binary Pattern (LBP) [22], BRIEF [6] and ORB [...
An Efficient Binary Feature Based on Hierarchical Structure Histogram
CIPAE 2020: Proceedings of the 2020 International Conference on Computers, Information Processing and Advanced EducationAn efficient binary feature is proposed in this paper to compromise the efficiency of simple hash feature and the discrimination of float-point feature. The proposed feature extraction method integrates a hierarchical feature descriptor and a simple but ...
Comments