期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2015
卷号：8
期号：1
页码：259-268
DOI：10.14257/ijgdc.2015.8.1.24
出版社：SERSC
摘要：With many engineering and science application problems, we must deal with a lot of high-dimensional data, such as videos, images, web documents, text, etc. In the areas of computer vision, image processing and machine learning, high-dimensional data are widespread. However, it is very hard for obtaining meaningful learning and inference from these high-dimensional data directly, the computational complexity of high- dimensional data is often exponential. However, under many conditions, high- dimensional data lie in low-dimensional data corresponding to some classes of the data. Thus, finding the low-dimensional structure from the high-dimensional data is very important. The aim of subspace segmentation is to cluster data that lie in a union of low- dimensional subspaces. In recent years, based on the research of representation methods, many subspace segmentation algorithms appeared. Although these methods are all effective for handling subspace segmentation problems, they all have advantages and disadvantages. This paper focuses on the performance comparison of different subspace segmentation algorithms currently used in handling subspace segmentation problems and views other conventional methods that can be applied in this field.
