Browsing by Author "Huang, Liang-Chi"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Item type:Item, Enhanced Noisy Sparse Subspace Clustering via Reweighted L1-Minimization(2018-01-01) ;Wu, Jwo-Yuh ;Huang, Liang-Chi ;Yang, Ming-Hsun ;Chang, Ling-HuaLiu, Chun-HungSparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing (CS), this paper proposes a new sparse regression scheme for SSC via reweighted l(1)-minimization, which also generalizes a twostep l(1)-minimization algorithm introduced by E. J. Candes al all in [The Annals of Statistics, vol. 42, no. 2, pp. 669-699, 2014] without incurring extra complexity burden. To fully exploit the prior information conveyed by the computed sparse vector in the first step, our approach places a weight on each component of the regression vector, and solves a weighted LASSO in the second step. We discuss the impact of weighting on neighbor identification, argue that a popular weighting rule used in CS literature is not suitable for the SSC purpose, and propose a new weighting scheme for enhancing neighbor identification accuracy. Extensive simulation results are provided to validate our discussions and evidence the effectiveness of the proposed approach. Some key issues for future works are also highlighted.Item type:Item, SPARSE SUBSPACE CLUSTERING WITH SEQUENTIALLY ORDERED AND WEIGHTED L1-MINIMIZATION(2019-01-01) ;Wu, Jwo-Yuh ;Huang, Liang-Chi ;Yang, Ming-Hsun ;Chang, Ling-HuaLiu, Chun-HungBuilt on the sparse representation framework, sparse subspace clustering (SSC) received considerable attention in the recent years. Conventional SSC employs. l(1)-minimization based sparse regression for neighbor identification on a sample-by-sample basis, and is unaware of the neighbor information revealed by those already computed sparse representation vectors. To rid this drawback, this paper proposes a weighted. l(1)-minimization based sparse regression method, and an associated data ordering rule able to reflect the reliability of neighbor information for further enhancing the clustering accuracy. The selection of weighting coefficients for SSC is also discussed. Computer simulations using both the synthesis and real data are provided to evidence the effectiveness of the proposed method.