Feature selection for video categorization is impractical with existing techniques. We present a novel algorithm to select a very small subset of image features. We reduce the cardinality of the input data by sorting the individual features by their effectiveness in categorization, and then merging pairwise these features into feature sets of cardinality two. Repeating this sort-merge process several times results in the learning of a small-cardinality, efficient, but highly accurate, feature set. The cost of this wrapper method for learning the feature set, approximately O(F logF) where F is the number of incoming features, is very reasonable, particularly when compared with the impracticality of applying the much higher cost current filter or wrapper learning models to the massive data of this domain. We provide empirical validation of this method, comparing it to both random and hand-selected feature sets of comparable small cardinality.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Video frame categorization using sort-merge feature selection


    Contributors:
    Yan Liu, (author) / Kender, J.R. (author)


    Publication date :

    2002-01-01


    Size :

    288535 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Video Frame Categorization Using Sort-Merge Feature Selection

    Liu, Y. / Kender, J. R. | British Library Conference Proceedings | 2002



    Data-adapted Parallel Merge Sort

    Holke, Johannes / Rüttgers, Alexander / Klitz, Margrit et al. | German Aerospace Center (DLR) | 2019

    Free access

    Feature Selection for Image Categorization

    Xu, F. / Zhang, Y.-J. | British Library Conference Proceedings | 2006


    Feature Selection for Image Categorization

    Xu, Feng / Zhang, Yu-Jin | Springer Verlag | 2006