IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v12y2016i3p8414157.html
   My bibliography  Save this article

Face Recognition Based on Optimized Projections for Distributed Intelligent Monitoring Systems

Author

Listed:
  • Aihua Yu
  • Huang Bai
  • Binbin Sun
  • Gang Li
  • Beiping Hou

Abstract

Compressive sensing (CS), as a new theory of signal processing, has found many applications. This paper deals with a CS-based face recognition system design. A novel framework, called projection matrix optimization- (PMO-) based compressive classification, is proposed for distributed intelligent monitoring systems. Unlike the sparse preserving projection (SPP) approach, the projection matrix is designed such that the coherence between different classes of faces is reduced and hence a higher recognition rate is expected. The optimal projection matrix problem is formulated as identifying a matrix that minimizes the Frobenius norm of the difference between a given target Gram and that of the equivalent dictionary. A class of analytical solutions is derived. With the PMO-based CS system, two frameworks are proposed for compressive face recognition. Experiments are carried out with five popularly utilized face databases (i.e., ORL, Yale, Yale Extend, CMU PIE, and AR) and simulation results show that the proposed approaches outperform those existing compressive ones in terms of the recognition rate and reconstruction error.

Suggested Citation

  • Aihua Yu & Huang Bai & Binbin Sun & Gang Li & Beiping Hou, 2016. "Face Recognition Based on Optimized Projections for Distributed Intelligent Monitoring Systems," International Journal of Distributed Sensor Networks, , vol. 12(3), pages 8414157-841, March.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:3:p:8414157
    DOI: 10.1155/2016/8414157
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/8414157
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/8414157?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:intdis:v:12:y:2016:i:3:p:8414157. 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: SAGE Publications (email available below). General contact details of provider: .

    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.