Hybrid Sparse Subspace Clustering for Visual Tracking

被引:0
|
作者
Ma, Lin [1 ,2 ]
Liu, Zhihua [1 ]
机构
[1] Samsung Res Inst China Beijing SRC B, Beijing, Peoples R China
[2] Tsinghua Univ, Dept Automat, Beijing, Peoples R China
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In many conditions, the object samples are distributed in a number of different subspaces. By segmenting the subspaces with spectral clustering based subspace clustering, more accurate sample distribution is obtained. The LSR (Least Squares Regression) sparse subspace clustering method which fulfills the EBD (Enhance Block Diagonal) criterion and has closed-form solution, is an important spectral clustering based sparse subspace clustering method. However, LSR uses no discriminative information which is important to discriminate positive samples from the negative samples. Thus, we propose a new hybrid sparse subspace clustering method which makes the clustering discriminative by involving the discriminative information provided by graph embedding into LSR. The sub subspaces obtained based on the new subspace clustering method can both retain the object distribution information and also make the object samples less confused with surrounding environment. Experimental results on a set of challenging videos in visual tracking demonstrate the effectiveness of our method in discriminating the object from the background.
引用
收藏
页码:1737 / 1742
页数:6
相关论文
共 50 条
  • [41] Sparse subspace clustering via nonconvex approximation
    Wenhua Dong
    Xiao-Jun Wu
    Josef Kittler
    He-Feng Yin
    Pattern Analysis and Applications, 2019, 22 : 165 - 176
  • [42] Graph Connectivity in Noisy Sparse Subspace Clustering
    Wang, Yining
    Wang, Yu-Xiang
    Singh, Aarti
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 51, 2016, 51 : 538 - 546
  • [43] SPARSE SUBSPACE CLUSTERING WITH MISSING AND CORRUPTED DATA
    Charles, Zachary
    Jalali, Amin
    Willett, Rebecca
    2018 IEEE DATA SCIENCE WORKSHOP (DSW), 2018, : 180 - 184
  • [44] Subspace Clustering with Block Diagonal Sparse Representation
    Xian Fang
    Ruixun Zhang
    Zhengxin Li
    Xiuli Shao
    Neural Processing Letters, 2021, 53 : 4293 - 4312
  • [45] Multi-geometric Sparse Subspace Clustering
    Wen-Bo Hu
    Xiao-Jun Wu
    Neural Processing Letters, 2020, 52 : 849 - 867
  • [46] Sparse Subspace Clustering: Algorithm, Theory, and Applications
    Elhamifar, Ehsan
    Vidal, Rene
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) : 2765 - 2781
  • [47] Multi-geometric Sparse Subspace Clustering
    Hu, Wen-Bo
    Wu, Xiao-Jun
    NEURAL PROCESSING LETTERS, 2020, 52 (01) : 849 - 867
  • [48] Sparse Subspace Clustering with Entropy-Norm
    Bai, Liang
    Liang, Jiye
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [49] Sparse subspace clustering via nonconvex approximation
    Dong, Wenhua
    Wu, Xiao-Jun
    Kittler, Josef
    Yin, He-Feng
    PATTERN ANALYSIS AND APPLICATIONS, 2019, 22 (01) : 165 - 176
  • [50] Subspace Clustering via Sparse Graph Regularization
    Zhang, Qiang
    Miao, Zhenjiang
    PROCEEDINGS 2017 4TH IAPR ASIAN CONFERENCE ON PATTERN RECOGNITION (ACPR), 2017, : 214 - 219