Name
Abstract | ||
|---|---|---|
Parsimony, including sparsity and low-rank, has shown great importance for data mining in social networks, particularly in tasks such as segmentation and recognition. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with convex l(1)-norm or nuclear norm constraints. However, the obtained results by convex optimization are usually suboptimal to solutions of original sparse or low-rank problems. In this paper, a novel robust subspace segmentation algorithm has been proposed by integrating l(p)-norm and Schatten p-norm constraints. Our so-obtained affinity graph can better capture local geometrical structure and the global information of the data. As a consequence, our algorithm is more generative, discriminative and robust. An efficient linearized alternating direction method is derived to realize our model. Extensive segmentation experiments are conducted on public datasets. The proposed algorithm is revealed to be more effective and robust compared to five existing algorithms. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.3390/s17071633 | SENSORS |
Keywords | Field | DocType |
subspace segmentation,low-rank representation,non-convex,LADMAP | Data mining,Scale-space segmentation,Pattern recognition,Segmentation,Iterative method,Segmentation-based object categorization,Matrix norm,Regular polygon,Artificial intelligence,Engineering,Convex optimization,Discriminative model | Journal |
Volume | Issue | ISSN |
17 | 7.0 | 1424-8220 |
Citations | PageRank | References |
3 | 0.37 | 22 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenlong Cheng | 1 | 3 | 0.37 |
| Mingbo Zhao | 2 | 631 | 36.16 |
| Naixue Xiong | 3 | 2413 | 194.61 |
| Kwok Tai Chui | 4 | 46 | 7.41 |