SCE: A Manifold Regularized Set-Covering Method for Data Partitioning

Robust Subspace Clustering by Cauchy Loss Function

Subspace clustering is a problem of exploring the low-dimensional subspaces of high-dimensional data. State-of-the-art approaches are designed by following the model of spectral clustering-based method. These methods pay much attention to learn the representation matrix to construct a suitable similarity matrix and overlook the influence of the noise term on subspace clustering. However, the real data are always contaminated by the noise and the noise usually has a complicated statistical distribution. To alleviate this problem, in this paper, we propose a subspace clustering method based on Cauchy loss function (CLF). Particularly, it uses CLF to penalize the noise term for suppressing the large noise mixed in the real data. This is due to that the CLF's influence function has an upper bound that can alleviate the influence of a single sample, especially the sample with a large noise, on estimating the residuals. Furthermore, we theoretically prove the grouping effect of our proposed method, which means that highly correlated data can be grouped together. Finally, experimental results on five real data sets reveal that our proposed method outperforms several representative clustering methods.

Sensors Information Fusion System with Fault Detection Based on Multi-Manifold Regularization Neighborhood Preserving Embedding

Electrical drive systems play an increasingly important role in high-speed trains. The whole system is equipped with sensors that support complicated information fusion, which means the performance around this system ought to be monitored especially during incipient changes. In such situation, it is crucial to distinguish faulty state from observed normal state because of the dire consequences closed-loop faults might bring. In this research, an optimal neighborhood preserving embedding (NPE) method called multi-manifold regularization NPE (MMRNPE) is proposed to detect various faults in an electrical drive sensor information fusion system. By taking locality preserving embedding into account, the proposed methodology extends the united application of Euclidean distance of both designated points and paired points, which guarantees the access to both local and global sensor information. Meanwhile, this structure fuses several manifolds to extract their own features. In addition, parameters are allocated in diverse manifolds to seek an optimal combination of manifolds while entropy of information with parameters is also selected to avoid the overweight of single manifold. Moreover, an experimental test based on the platform was built to validate the MMRNPE approach and demonstrate the effectiveness of the fault detection. Results and observations show that the proposed MMRNPE offers a better fault detection representation in comparison with NPE.

Superpixel-Based Foreground Extraction With Fast Adaptive Trimaps

Extracting the foreground from a given complex image is an important and challenging problem. Although there have been many methods to perform foreground extraction, most of them are time-consuming, and the trimaps used in the matting step are labeled manually. In this paper, we propose a fast interactive foreground extraction method based on the superpixel GrabCut and image matting. Specifically, we first extract superpixels from a given image and apply GrabCut on them to obtain a raw mask. Due to that the resulting mask border is hard and toothing, we further propose fast and adaptive trimaps (FATs), and construct an FATs-based shared matting for computing a refined mask. Finally, by interactive processing, we can obtain the final foreground. Experimental results on the BSDS500 and alphamatting datasets demonstrate that our proposed method is faster than five representative methods, and performs better than the interactive representative methods in terms of the three evaluation criteria: 1) mean square error; 2) sum of absolute difference; and 3) execution time.