This paper presents the development of a new feature descriptor derived from previous work on the basis sparse-coding inspired similarity descriptor that provides smaller descriptor size, simpler computations, faster matching speed, and higher accuracy. The TreeBASIS descriptor algorithm uses a binary vocabulary tree that is computed offline using basis sparse-coding inspired similarity dictionary images derived from sparse coding and a test set of feature region images. The resulting tree is stored in memory for online high-speed searching for feature matching. During the online matching stage, a feature region image is binary quantized and the resulting quantized vector is passed into the basis sparse-coding inspired similarity tree. A Hamming distance is computed between the feature region images and the effectively descriptive basis sparse-coding inspired similarity dictionary images at the current node to determine the branch taken. The path the feature region image takes is saved as the descriptor, and matching is performed by following the paths of two features and iteratively reducing the distance as the path is traversed. Experimental results show that the TreeBASIS descriptor is better than basis sparse-coding inspired similarity, scale invariant feature transform, and speeded-up robust features on frame-to-frame aerial feature point matching. It requires much less computational resources and runs faster.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient Tree-Based Feature Descriptor and Matching Algorithm


    Contributors:
    Fowers, Spencer (author) / Desai, Alok (author) / Lee, D. J. (author) / Ventura, Dan (author) / Wilde, Doran (author)

    Published in:

    Publication date :

    2014-09-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    An efficient feature descriptor based on synthetic basis functions and uniqueness matching strategy

    Desai, Alok / Lee, Dah-Jye / Ventura, Dan | British Library Online Contents | 2016


    An efficient feature descriptor based on synthetic basis functions and uniqueness matching strategy

    Desai, Alok / Lee, Dah-Jye / Ventura, Dan | British Library Online Contents | 2016


    Robust Wide Baseline Point Matching Based on Scale Invariant Feature Descriptor

    Sicong, Y. / Qing, W. / Rongchun, Z. | British Library Online Contents | 2009


    Boundary Directional Feature Descriptor for LiDAR-OpenStreetMap Matching in Urban Scenarios

    Li, Zexing / Wang, Yafei / Zhang, Ruitao et al. | IEEE | 2024


    An Efficient Algorithm for Robust Feature Matching

    Mount, D. / Netanyahu, N. / Le Moigne, J. et al. | British Library Conference Proceedings | 1998