Visual Object Clustering via Mixed-Norm Regularization
Lists
Only you see this
Abstract
Many vision problems deal with high-dimensional data, such as motion segmentation and face clustering. However, these high-dimensional data usually lie in a low-dimensional structure. Sparse representation is a powerful principle for solving a number of clustering problems with high-dimensional data. This principle is motivated from an ideal modeling of data points according to linear algebra theory. However, real data in computer vision are unlikely to follow the ideal model perfectly. In this paper, we exploit the mixed norm regularization for sparse subspace clustering. This regularization term is a convex combination of the ℓ 1 norm, which promotes sparsity at the individual level and the block norm ℓ 2/1 which promotes group sparsity. Combining these powerful regularization terms will provide a more accurate modeling, subsequently leading to a better solution for the affinity matrix used in sparse subspace clustering. This could help us achieve better performance on motion segmentation and face clustering problems. This formulation also caters for different types of data corruptions. We derive a provably convergent algorithm based on the alternating direction method of multipliers (ADMM) framework, which is computationally efficient, to solve the formulation. We demonstrate that this formulation outperforms other state-of-arts on both motion segmentation and face clustering.
BibTeX
@inproceedings{zhang2015visual,
author = {Xin Zhang and Duc-Son Pham and Dinh Q. Phung and Wanquan Liu and Budhaditya Saha and Svetha Venkatesh},
title = {{Visual Object Clustering via Mixed-Norm Regularization}},
booktitle = {IEEE/CVF Winter Conference on Applications of Computer Vision},
year = {2015},
doi = {10.1109/wacv.2015.142},
}Loading related content...