Unsupervised Metric Learning by Self-Smoothing Operator
Abstract
In this paper, we propose a diffusion-based approach to improve an input similarity metric. The diffusion process propagates similarity mass along the intrinsic manifold of data points. Our approach results in a global similarity metric which differs from the query-specific one for ranking produced by label propagation [26]. Unlike diffusion maps [7], our approach directly improves a given similarity metric without introducing any extra distance notions. We call our approach Self-Smoothing Operator (SSO). To demonstrate its wide applicability, experiments are reported on image retrieval, clustering, classification, and segmentation tasks. In most cases, using SSO results in significant performance gains over the original similarity metrics, with also very evident advantage over diffusion maps.
Cite
Text
Jiang et al. "Unsupervised Metric Learning by Self-Smoothing Operator." IEEE/CVF International Conference on Computer Vision, 2011. doi:10.1109/ICCV.2011.6126318Markdown
[Jiang et al. "Unsupervised Metric Learning by Self-Smoothing Operator." IEEE/CVF International Conference on Computer Vision, 2011.](https://mlanthology.org/iccv/2011/jiang2011iccv-unsupervised/) doi:10.1109/ICCV.2011.6126318BibTeX
@inproceedings{jiang2011iccv-unsupervised,
title = {{Unsupervised Metric Learning by Self-Smoothing Operator}},
author = {Jiang, Jiayan and Wang, Bo and Tu, Zhuowen},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2011},
pages = {794-801},
doi = {10.1109/ICCV.2011.6126318},
url = {https://mlanthology.org/iccv/2011/jiang2011iccv-unsupervised/}
}