DETERMINING A FLEXIBLE LOW-RANK GRAPH USING SUBSPACE CLUSTERING

JN Chandra Sekhar

Abstract


 By utilizing a meager representation or low-rank representation of information, chart based subspace bunching has as of late pulled in impressive consideration in PC vision, given its ability and productivity in grouping information. Be that as it may, the chart weights worked by utilizing representation coefficients are not the correct ones as the conventional definition. The two stages of portrayal what's more, bunching are led in an autonomous way; in this manner a general ideal outcome can't be ensured. Moreover, it is vague how the bunching execution will be influenced by utilizing this chart. For instance, the diagram parameters, i.e., the weights on edges, must be falsely pre-indicated while it is extremely hard to pick the ideal. To this end, in this paper, a novel subspace bunching by means of taking in a versatile low-rank diagram proclivity lattice is proposed, where the partiality framework and the representation coefficients are found out in a bound together system. All things considered, the pre-figured chart regularize is successfully blocked and better execution can be accomplished. Test comes about on a few well known databases illustrate that the proposed technique performs better against the state-of the- workmanship approaches, in grouping.


Keywords


inadequate portrayal, low-rank portrayal, subspace grouping, versatile low-rank diagram, partiality grid.

Full Text:

PDF

References


] R. Vidal. Subspace clustering. IEEE Signal Processing Magazine, 28(2):52–68, 2011.

Lance Parsons, EhteshamHaque, and Huan Liu. Subspace clustering for high dimensional data: A review. SIGKDD Explorations Newsletter, 6(1):90–105, June 2004.

Jianbo Shi and Jitendra Malik.Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22:888–905, 1997.

Ming Yin, JunbinGao, Zhouchen Lin, Qinfeng Shi, and Yi Guo. Dual graph regularized latent low-rank representation for subspace clustering. IEEE Transactions on Image Processing, 24(12):4918–4933, 2015.

Ran He, Liang Wang, Zhenan Sun, Yingya Zhang and Bo Li. Information theoretic subspace clustering. IEEE Transactions on Neural Networks and Learning Systems, 27(12):2643-2655,2016.

HongchangGao, FeipingNie, Xuelong Li, and Heng Huang. Multiview subspace clustering.In 2015 IEEE International Conference on Computer Vision (ICCV), pages 4238–4246, 2015.

Mikhail Belkin and ParthaNiyogi.Laplacianeigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373–1396, 2003.

S. T. Roweis and L. K. Saul.Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323–2326, 2000.

FeipingNie, Xiaoqian Wang, and Heng Huang. Clustering and projected clustering with adaptive neighbors. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 977–986, 2014.

FeipingNie, Xiaoqian Wang, Michael I. Jordan, and Heng Huang.The constrained laplacian rank algorithm for graph-based clustering.In Proceedings of AAAI 2016, pages 1969–1976, 2016.

EhsanElhamifar and Ren_e Vidal. Sparse subspace clustering: Algorithm, theory, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(11):2765–2781, 2013.

Guangcan Liu, Zhouchen Lin, Shuicheng Yan, Ju Sun, and Yi Ma. Robust recovery of subspace structures by low-rank representation. IEEE Transactions on Pattern Analysis and Machince Intelligence, 35(1):171 – 184, Jan. 2013.

Miao Zheng, Jiajun Bu, Chun Chen, Can Wang, Lijun Zhang, GuangQiu, and Deng Cai. Graph regularized sparse coding for image representation. IEEE Transactions on Image Processing, 20(5):1327–1336, 2011.

Ming Yin, JunbinGao, and Zhouchen Lin. Laplacian regularized lowrank representation and its applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(3):504–517, 2016.

Xi Peng, Zhang Yi, and Huajin Tang. Robust subspace clustering via thresholding ridge regression. In Proceedings of AAAI, AAAI’15, pages 3827–3833, 2015.

D.L. Donoho, M. Elad, and V. Temlyakov. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory, 52(1):6–18, 2006.

D. L. Donoho. Compressed sensing. IEEE Transcations on Information Theory, 52(4):1289–1306, 2006.

Guangcan Liu, Zhouchen Lin, Shuicheng Yan, Ju Sun, and Yi Ma. Robust recovery of subspace structures by low-rank representation. IEEE Transactions on Pattern Analysis and Machince Intelligence, 35(1):171 – 184, Jan. 2013.

Ren_e Vidal and Paolo Favaro. Low rank subspace clustering (LRSC). Pattern Recognition Letters, 43(1):47–61, 2014.

Shuicheng Yan, Dong Xu, Benyu Zhang, Hong-Jiang Zhang, Qiang Yang, and Stephen Lin. Graph embedding and extensions: A general framework for dimensionality reduction. IEEE Transactions on Pattern Analysis and Machince Intelligence, 29(1):40–51, 2007.

Ming Yin, JunbinGao, and Yi Guo. Nonlinear low-rank representation on Stiefel manifolds. Electronics Letters, 51(10):749–751, 2015.

YangyangXu and Wotao Yin.A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM Journal of Imaging Sciences, 6(3):1758–1789, 2013.




DOI: https://doi.org/10.26483/ijarcs.v9i3.6042

Refbacks

  • There are currently no refbacks.




Copyright (c) 2018 International Journal of Advanced Research in Computer Science