In the multi-view multi-label (MVML) classification problem, multiple views are simultaneously associated with multiple semantic representations. Multi-view multi-label learning inevitably has the problems of consistency, diversity, and non-alignment among views and the correlation among labels. Most of the existing multi-view multi-label methods for non-aligned views assume that each view has a common or shared label set, but because a single view cannot contain the entire label information, they often learn suboptimal results. Based on this, this paper proposes a non-aligned multi-view multi-label classification method that learns view-specific labels (LVSL), aiming to explicitly mine the information of view-specific labels and low-rank label structures in non-aligned views in a unified model framework. Furthermore, to alleviate insufficient available label information, we thoroughly explored the global and local structural information among labels. Specifically, first, we assume that there is structural consistency between the view and the label space and then construct the view-specific label model in turn. Second, to enrich the original label space information, we mine the consistent information of multiple views and the low-rank correlation information hidden among multiple labels. Finally, the contribution weight of each view is combined with learning the complementary information among the views in the decision-making stage, and extend the model to handle nonlinear data. The results of the proposed method compared with existing state-of-the-art algorithms on several datasets validate its effectiveness.
Bearing is one of the most important transmission components and breaks down more frequently than other parts in rotating equipment. The state detection of the bearing has a great significance for their working performance and safety in industrial production. In this article, we propose a very effective fault diagnosis algorithm based on clustering and sparse representation for rolling bearing. To obtain a robust cluster center for the acquired noisy samples, the samples are first clustered by using their frequency spectrums instead of directly in time-domain waveforms. Then, for each class of samples, an adaptive redundant dictionary is trained over residuals between the original frequency spectrums and their component projected on the calculated cluster center. The noise contained in a test sample is reduced by performing sparse coding and representation with the trained dictionary. Finally, the test sample belonging to a specific category is identified by selecting the maximum cosine similarity value between the reconstructed sample and cluster centers. Experimental results show that the proposed algorithm performs well on both simulated signals and real signals and exhibits advantages over other fault diagnosis methods in terms of diagnosis accuracy.
12 June 2012 in IEEE Transactions on Image Processing
In this paper, we propose an efficient algorithm to reconstruct the 3D structure of a human face from one or more of its 2D images with different poses. In our algorithm, the nonlinear least-squares model is first employed to estimate the depth values of facial feature points and the pose of the 2D face image concerned by means of the similarity transform. Furthermore, different optimization schemes are presented with regard to the accuracy levels and the training time required. Our algorithm also embeds the symmetrical property of the human face into the optimization procedure, in order to alleviate the sensitivities arising from changes in pose. In addition, the regularization term, based on linear correlation, is added in the objective function to improve the estimation accuracy of the 3D structure. Further, a model-integration method is proposed to improve the depth-estimation accuracy when multiple nonfrontal-view face images are available. Experimental results on the 2D and 3D databases demonstrate the feasibility and efficiency of the proposed methods.