access icon free STBD: a simple tri-bit binary descriptor for point matching

© The Institution of Engineering and Technology
Received 26/08/2016, Accepted 10/07/2017, Revised 17/06/2017, Published 20/07/2017

This study investigates the problem of constructing binary descriptor and develops a novel binary descriptor called simple tri-bit binary descriptor (STBD) based on a simple sampling pattern (SSP) and a tri-value binarisation strategy (TBS). First, an SSP is proposed, in which sample points are divided into two groups according to the distance from the pattern centre and smoothed by different circular filters. Then, to make the descriptor adaptive to the matched images, a selection strategy which directly employs detected keypoints as training data is introduced to select 256 point pairs with low correlation from initial pairs. Finally, a modified TBS method is presented to properly refine intensity comparison results. Experiments show that the proposed STBD can perform well and is robust to various transformations, except for scale change.

Inspec keywords: image matching; image filtering

Other keywords: point matching; circular filters; selection strategy; SSP; training data; simple tri-bit binary descriptor; tri-value binarisation strategy; STBD; modified TBS method; simple sampling pattern

Subjects: Filtering methods in signal processing; Computer vision and image processing techniques; Image recognition

References

    1. 1)
      • 12. Taylor, S., Rosten, E., Drummond, T.: ‘Robust feature matching in 2.3 µs’. IEEE Computer Society Conf. Computer Vision and Pattern Recognition, 2009, pp. 15–22.
    2. 2)
      • 21. Bay, H., Ess, A., Tuytelaars, T., et al: ‘SURF: speeded up robust features’, Comput. Vis. Image Underst., 2008, 110, (3), pp. 346–359.
    3. 3)
      • 1. Michel, D., Oikonomidis, I., Argyros, A.: ‘Scale invariant and deformation tolerant partial shape matching’, Image Vis. Comput., 2011, 29, (7), pp. 459–469.
    4. 4)
      • 8. Wang, Z.H., Fan, B., Wu, F.C.: ‘Local intensity order pattern for feature description’. IEEE Int. Conf. Computer Vision, 2011, pp. 603–610.
    5. 5)
      • 13. Calonder, M., Lepetit, V., Strecha, C., et al: ‘BRIEF: binary robust independent elementary features’. European Conf. Computer Vision, 2010, pp. 778–792.
    6. 6)
      • 22. Gao, Y.Q., Qiao, Y., Li, Z.F., et al: ‘LTD: local ternary descriptor for image matching’. IEEE Int. Conf. Information and Automation, 2013, pp. 1375–1380.
    7. 7)
      • 7. Mikolajczyk, K., Schmid, C.: ‘A performance evaluation of local descriptors’. IEEE Conf. Computer Vision and Pattern Recognition, 2003, pp. 257–263.
    8. 8)
      • 23. Awrangjeb, M., Lu, G.J.: ‘Robust image corner detection based on the chord-to-point distance accumulation technique’, IEEE Trans. Multimed., 2008, 10, pp. 1059–1072.
    9. 9)
      • 6. Ke, Y., Sukthankar, R.: ‘PCA-SIFT: a more distinctive representation for local image descriptors’. IEEE Computer Society Conf. Computer Vision and Pattern Recognition, 2004, pp. 506–513.
    10. 10)
      • 17. Ahi, A., Ortizand, R., Vandergheynst, P.: ‘FREAK: fast retina keypoint’. IEEE Conf. Computer Vision and Pattern Recognition, 2012, pp. 2069–2076.
    11. 11)
      • 19. Harris, C., Stephens, M.: ‘A combined corner and edge detector’. Proc. Fourth Alvey Vision Conf., 1988, pp. 147–151.
    12. 12)
      • 14. Rosten, E., Drummond, T.: ‘Machine learning for high-speed corner detection’, Comput. Vis., ECCV, 2006, 3951, pp. 430–443.
    13. 13)
      • 10. Wang, Z.H., Wang, Z.F., Liu, H.M., et al: ‘Scale-invariant feature matching based on pairs of feature points’, IET Comput. Vis., 2015, 9, (16), pp. 789–796.
    14. 14)
      • 11. Ambai, M., Yoshida, Y.: ‘CARD: compact and real-time descriptors’. IEEE Int. Conf. Computer Vision, 2011, pp. 97–104.
    15. 15)
      • 3. Hu, R., Collomosse, J.: ‘A performance evaluation of gradient field HOG descriptor for sketch based image retrieval’, Comput. Vis. Image Underst., 2013, 117, (7), pp. 790–806.
    16. 16)
      • 4. Qu, Z., Lin, S.P., Ju, F.R.: ‘The improved algorithm of fast panorama stitching for image sequence and reducing the distortion errors’, Math. Probl. Eng., 2015, 2015, pp. 1–12.
    17. 17)
      • 16. Leutenegger, S., Chli, M., Siegwart, R.: ‘BRISK: binary robust invariant scalable keypoints’, Int. Conf. Computer Vision, 2011, pp. 2548–2555.
    18. 18)
      • 15. Rublee, E., Rabaud, V., Konolige, K., et al: ‘ORB: an efficient alternative to SIFT or surf’. Int. Conf. Computer Vision, 2011, pp. 2564–2571.
    19. 19)
      • 5. Lowe, D.G.: ‘Distinctive image features from scale-invariant keypoints’, Int. J. Comput. Vis., 2004, 60, (2), pp. 91–110.
    20. 20)
      • 18. Hui, G.B., Li, D.B., Tong, Y.F.: ‘A binary descriptor based on both optimized sampling pattern and image sub-patches’, Acta Autom. Sin., 2013, 40, (2), pp. 255–266.
    21. 21)
      • 9. Fan, B., Wu, F.C., Hu, Z.Y.: ‘Rotationally invariant descriptors using intensity order pooling’, IEEE Trans. Pattern Anal. Mach. Intell., 2012, 34, (10), pp. 2031–2045.
    22. 22)
      • 2. Lillywhite, K., Lee, D., Tippetts, B., et al: ‘A feature construction method for general object recognition’, Pattern Recognit., 2013, 46, (12), pp. 3300–3314.
    23. 23)
      • 20. Mikolajczyk, K., Tuytelaars, T., Schmid, C., et al: ‘A comparison of affine region detectors’, Int. J. Comput. Vis., 2005, 65, (1), pp. 43–72.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cvi.2016.0299
Loading

Related content

content/journals/10.1049/iet-cvi.2016.0299
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading