IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i7p1722-d1115658.html
   My bibliography  Save this article

Two-Dimensional Exponential Sparse Discriminant Local Preserving Projections

Author

Listed:
  • Minghua Wan

    (School of Computer Science (School of Intelligent Auditing), Nanjing Audit University, Nanjing 211815, China
    Jiangsu Key Lab of Image and Video Understanding for Social Security, Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education, Nanjing University of Science and Technology, Nanjing 210094, China
    Key Laboratory of Intelligent Information Processing, Nanjing Xiaozhuang University, Nanjing 211171, China)

  • Yuxi Zhang

    (School of Computer Science (School of Intelligent Auditing), Nanjing Audit University, Nanjing 211815, China)

  • Guowei Yang

    (School of Computer Science (School of Intelligent Auditing), Nanjing Audit University, Nanjing 211815, China
    School of Electronic Information, Qingdao University, Qingdao 266071, China)

  • Hongjian Guo

    (School of Computer Science (School of Intelligent Auditing), Nanjing Audit University, Nanjing 211815, China)

Abstract

The two-dimensional discriminant locally preserved projections (2DDLPP) algorithm adds a between-class weighted matrix and a within-class weighted matrix into the objective function of the two-dimensional locally preserved projections (2DLPP) algorithm, which overcomes the disadvantage of 2DLPP, i.e., that it cannot use the discrimination information. However, the small sample size (SSS) problem still exists, and 2DDLPP processes the whole original image, which may contain a large amount of redundant information in the retained features. Therefore, we propose a new algorithm, two-dimensional exponential sparse discriminant local preserving projections (2DESDLPP), to address these problems. This integrates 2DDLPP, matrix exponential function and elastic net regression. Firstly, 2DESDLPP introduces the matrix exponential into the objective function of 2DDLPP, making it positive definite. This is an effective method to solve the SSS problem. Moreover, it uses distance diffusion mapping to convert the original image into a new subspace to further expand the margin between labels. Thus more feature information will be retained for classification. In addition, the elastic net regression method is used to find the optimal sparse projection matrix to reduce redundant information. Finally, through high performance experiments with the ORL, Yale and AR databases, it is proven that the 2DESDLPP algorithm is superior to the other seven mainstream feature extraction algorithms. In particular, its accuracy rate is 3.15%, 2.97% and 4.82% higher than that of 2DDLPP in the three databases, respectively.

Suggested Citation

  • Minghua Wan & Yuxi Zhang & Guowei Yang & Hongjian Guo, 2023. "Two-Dimensional Exponential Sparse Discriminant Local Preserving Projections," Mathematics, MDPI, vol. 11(7), pages 1-16, April.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:7:p:1722-:d:1115658
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/7/1722/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/7/1722/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sadiq H. Abdulhussain & Basheera M. Mahmmod & Amer AlGhadhban & Jan Flusser, 2022. "Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments," Mathematics, MDPI, vol. 10(15), pages 1-28, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Seng Chun Hoo & Haidi Ibrahim & Shahrel Azmin Suandi & Theam Foo Ng, 2023. "LCAM: Low-Complexity Attention Module for Lightweight Face Recognition Networks," Mathematics, MDPI, vol. 11(7), pages 1-27, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:7:p:1722-:d:1115658. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.