Abstract

Recently, low-rank and sparse model-based dimensionality reduction (DR) methods have aroused lots of interest. In this paper, we propose an effective supervised DR technique named block-diagonal constrained low-rank and sparse-based embedding (BLSE). BLSE has two steps, i.e., block-diagonal constrained low-rank and sparse representation (BLSR) and block-diagonal constrained low-rank and sparse graph embedding (BLSGE). Firstly, the BLSR model is developed to reveal the intrinsic intra-class and inter-class adjacent relationships as well as the local neighborhood relations and global structure of data. Particularly, there are mainly three items considered in BLSR. First, a sparse constraint is required to discover the local data structure. Second, a low-rank criterion is incorporated to capture the global structure in data. Third, a block-diagonal regularization is imposed on the representation to promote discrimination between different classes. Based on BLSR, informative and discriminative intra-class and inter-class graphs are constructed. With the graphs, BLSGE seeks a low-dimensional embedding subspace by simultaneously minimizing the intra-class scatter and maximizing the inter-class scatter. Experiments on public benchmark face and object image datasets demonstrate the effectiveness of the proposed approach.

Highlights

  • With the rapid development of information technology, nowadays high precision sensors sense large-scale data, especially image data, all the time

  • The representation results of block-diagonal constrained low-rank and sparse representation (BLSR) have a great influence on the graph construction and the performance of BLSE

  • We conduct experiments to study the sensitivity of the proposed BLSE over a9 of 17 wide range of these parameters

Read more

Summary

Introduction

With the rapid development of information technology, nowadays high precision sensors sense large-scale data, especially image data, all the time. A sparse and low-rank graph-based discriminate analysis (SLGDA) method was developed in [28] to purse block-diagonal structured affinity matrix with both sparsity and low-rank constraints. The model has two steps: first, a self-expressive model, i.e., block-diagonal constrained low-rank and sparse representation (BLSR) model is developed to reveal the intra-class and inter-class adjacent relationships among samples and discover the local and global structures latent in data. Since our aim develop an iteration method to explicitly optimize the diagonal elements of the solution to be large, information for the solution Different from their strategy, we separately optimize the solution to be isthe to induce inter-class and inter-class graphs from the solution fordiagonal further embedding learning, our and rest ones to bean small via a method predefined block-diagonal mask matrix.

Related Works
Low Rank and Sparse Representation
Graph Embedding
Block-Diagonal Constrained Low–Rank and Sparse Representation
Optimization for BLSR
1: While not converged do
8: End while
Optimization for BLSGE
Analysis of BLSE
Visualization ofofthe weightsand and corresponding recognition accuracy
Experimental Results on Image Datasets
Compared Methods t
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call