Fading Affect Bias: Improving the Trade-Off Between Accuracy and Efficiency in Feature Clustering
Abstract
We present a fast and accurate center-based, singlepass clustering method, with main focus on improving the trade-off between accuracy and speed in computer vision problems, such as creating visual vocabularies. We use a stochastic Mean-shift procedure to seek the local density peaks within a single pass of the data. We also present a dynamic kernel generation along with a density test procedure that finds the most promising kernel initializations. In our algorithm, we use two data structures, namely a dictionary of permanent kernels, and a 'short memory' that is used to determine emerging kernels to be maintained and outliers to be discarded. In our experiments we make extensive comparisons with popular clustering algorithms, with respect to accuracy and efficiency.
Cite
Text
Wang et al. "Fading Affect Bias: Improving the Trade-Off Between Accuracy and Efficiency in Feature Clustering." IEEE/CVF Winter Conference on Applications of Computer Vision, 2018. doi:10.1109/WACV.2018.00090Markdown
[Wang et al. "Fading Affect Bias: Improving the Trade-Off Between Accuracy and Efficiency in Feature Clustering." IEEE/CVF Winter Conference on Applications of Computer Vision, 2018.](https://mlanthology.org/wacv/2018/wang2018wacv-fading/) doi:10.1109/WACV.2018.00090BibTeX
@inproceedings{wang2018wacv-fading,
title = {{Fading Affect Bias: Improving the Trade-Off Between Accuracy and Efficiency in Feature Clustering}},
author = {Wang, Ziyin and Farhand, Sepehr and Tsechpenakis, Gavriil},
booktitle = {IEEE/CVF Winter Conference on Applications of Computer Vision},
year = {2018},
pages = {775-783},
doi = {10.1109/WACV.2018.00090},
url = {https://mlanthology.org/wacv/2018/wang2018wacv-fading/}
}