Name
Abstract | ||
|---|---|---|
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 seri... |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/TIP.2009.2038764 | IEEE Transactions on Image Processing |
Keywords | DocType | Volume |
Semisupervised learning,Clustering algorithms,Noise robustness,Image edge detection,Machine learning,Partitioning algorithms,Image reconstruction,Machine learning algorithms,Algorithm design and analysis,Laplace equations | Journal | 19 |
Issue | ISSN | Citations |
4 | 1057-7149 | 308 |
PageRank | References | Authors |
7.88 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Cheng | 1 | 514 | 17.43 |
| jianchao yang | 2 | 7508 | 282.48 |
| Shuicheng Yan | 3 | 767 | 25.71 |
| Yun Fu | 4 | 802 | 48.11 |
| Thomas S. Huang | 5 | 27815 | 2618.42 |