Constructing L2-Graph For Subspace Learning and Segmentation
IEEE Transactions on Cybernetics (IEEE Trans. Cybern.), 2012
Abstract
Some recent works used L1-norm based sparse coefficients to build the graph for various applications, and achieved impressive results. Can we find other way to achieve sparsity with better performance and fewer limitations?
View on arXivComments on this paper