IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v320y2018icp99-115.html
   My bibliography  Save this article

A single gallery-based face recognition using extended joint sparse representation

Author

Listed:
  • Shang, Kun
  • Huang, Zheng-Hai
  • Liu, Wanquan
  • Li, Zhi-Ming

Abstract

For many practical face recognition problems, such as law enforcement, e-passport, ID card identification, and video surveillance, there is usually only a single sample per person enrolled for training, meanwhile the probe samples can usually be captured on the spot, it is possible to collect multiple face images per person. This is a new face recognition problem with many challenges, and we name it as the single-image-to-image-set face recognition problem (ISFR). In this paper, a customized dictionary-based face recognition approach is proposed to solve this problem using the extended joint sparse representation. We first learn a customized variation dictionary from the on-location probing face images, and then propose the extended joint sparse representation, which utilizes the information of both the customized dictionary and the gallery samples, to classify the probe samples. Finally we compare the proposed method with the related methods on several popular face databases, including Yale, AR, CMU-PIE, Georgia, Multi-PIE and LFW databases. The experimental results show that the proposed method outperforms most of these popular face recognition methods for the ISFR problem.

Suggested Citation

  • Shang, Kun & Huang, Zheng-Hai & Liu, Wanquan & Li, Zhi-Ming, 2018. "A single gallery-based face recognition using extended joint sparse representation," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 99-115.
    • Handle: RePEc:eee:apmaco:v:320:y:2018:i:c:p:99-115
    DOI: 10.1016/j.amc.2017.07.058
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317305192
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.07.058?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wu, Tingting & Shao, Jinbo & Gu, Xiaoyu & Ng, Michael K. & Zeng, Tieyong, 2021. "Two-stage image segmentation based on nonconvex ℓ2−ℓp approximation and thresholding," Applied Mathematics and Computation, Elsevier, vol. 403(C).

    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:eee:apmaco:v:320:y:2018:i:c:p:99-115. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.