A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Learning With $\ell ^{1}$-Graph for Image Analysis
2010
IEEE Transactions on Image Processing
The graph construction procedure essentially determines the potentials of those graph-oriented learning algorithms for image analysis. In this paper, we propose a process to build the so-called directed 1 -graph, in which the vertices involve all the samples and the ingoing edge weights to each vertex describe its 1 -norm driven reconstruction from the remaining samples and the noise. Then, a series of new algorithms for various machine learning tasks, e.g., data clustering, subspace learning,
doi:10.1109/tip.2009.2038764
pmid:20031500
fatcat:lbju2dvonvb2hijji55ueqme6a