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

A New Low-Rank Structurally Incoherent Algorithm for Robust Image Feature Extraction

Author

Listed:
  • Hongmei Ge

    (School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
    School of Engineering Audit, Nanjing Audit University, Nanjing 211815, China)

  • Aibo Song

    (School of Computer Science and Engineering, Southeast University, Nanjing 211189, China)

Abstract

In order to solve the problem in which structurally incoherent low-rank non-negative matrix decomposition (SILR-NMF) algorithms only consider the non-negativity of the data and do not consider the manifold distribution of high-dimensional space data, a new structurally incoherent low rank two-dimensional local discriminant graph embedding (SILR-2DLDGE) is proposed in this paper. The algorithm consists of the following three parts. Firstly, it is vital to keep the intrinsic relationship between data points. By the token, we introduced the graph embedding (GE) framework to preserve locality information. Secondly, the algorithm alleviates the impact of noise and corruption uses the L1 norm as a constraint by low-rank learning. Finally, the algorithm improves the discriminant ability by encrypting the structurally incoherent parts of the data. In the meantime, we capture the theoretical basis of the algorithm and analyze the computational cost and convergence. The experimental results and discussions on several image databases show that the proposed algorithm is more effective than the SILR-NMF algorithm.

Suggested Citation

  • Hongmei Ge & Aibo Song, 2022. "A New Low-Rank Structurally Incoherent Algorithm for Robust Image Feature Extraction," Mathematics, MDPI, vol. 10(19), pages 1-19, October.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3648-:d:934206
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/19/3648/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/19/3648/
    Download Restriction: no
    ---><---

    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:10:y:2022:i:19:p:3648-:d:934206. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.