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

Recognizing faces prone to occlusions and common variations using optimal face subgraphs

Author

Listed:
  • Lahasan, Badr Mohammed
  • Venkat, Ibrahim
  • Al-Betar, Mohammed Azmi
  • Lutfi, Syaheerah Lebai
  • Wilde, Philippe De

Abstract

An intuitive graph optimization face recognition approach called Harmony Search Oriented-EBGM (HSO-EBGM) inspired by the classical Elastic Bunch Graph Matching (EBGM) graphical model is proposed in this contribution. In the proposed HSO-EBGM, a recent evolutionary approach called harmony search optimization is tailored to automatically determine optimal facial landmarks. A novel notion of face subgraphs have been formulated with the aid of these automated landmarks that maximizes the similarity entailed by the subgraphs. For experimental evaluation, two sets of de facto databases (i.e., AR and Face Recognition Grand Challenge (FRGC) ver2.0) are used to validate and analyze the behavior of the proposed HSO-EBGM in terms of number of subgraphs, varying occlusion sizes, face images under controlled/ideal conditions, realistic partial occlusions, expression variations and varying illumination conditions. For a number of experiments, results justify that the HSO-EBGM shows improved recognition performance when compared to recent state-of-the-art face recognition approaches.

Suggested Citation

  • Lahasan, Badr Mohammed & Venkat, Ibrahim & Al-Betar, Mohammed Azmi & Lutfi, Syaheerah Lebai & Wilde, Philippe De, 2016. "Recognizing faces prone to occlusions and common variations using optimal face subgraphs," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 316-332.
    • Handle: RePEc:eee:apmaco:v:283:y:2016:i:c:p:316-332
    DOI: 10.1016/j.amc.2016.02.047
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Mohammed Al-Betar & Ahamad Khader & Iyad Doush, 2014. "Memetic techniques for examination timetabling," Annals of Operations Research, Springer, vol. 218(1), pages 23-50, July.
    2. Mohammed Al-Betar & Ahamad Khader, 2012. "A harmony search algorithm for university course timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 3-31, April.
    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. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    2. Assif Assad & Kusum Deep, 2018. "Harmony search based memetic algorithms for solving sudoku," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(4), pages 741-754, August.
    3. Mohammed Al-Betar & Ahamad Khader & Iyad Doush, 2014. "Memetic techniques for examination timetabling," Annals of Operations Research, Springer, vol. 218(1), pages 23-50, July.
    4. Abha Sharma & Pushpendra Kumar & Kanojia Sindhuben Babulal & Ahmed J. Obaid & Harshita Patel, 2022. "Categorical Data Clustering Using Harmony Search Algorithm for Healthcare Datasets," International Journal of E-Health and Medical Communications (IJEHMC), IGI Global, vol. 13(4), pages 1-15, August.
    5. R. A. Oude Vrielink & E. A. Jansen & E. W. Hans & J. Hillegersberg, 2019. "Practices in timetabling in higher education institutions: a systematic review," Annals of Operations Research, Springer, vol. 275(1), pages 145-160, April.
    6. MinJun Kim & JuneSeok Hong & Wooju Kim, 2019. "An Efficient Representation Using Harmony Search for Solving the Virtual Machine Consolidation," Sustainability, MDPI, vol. 11(21), pages 1-20, October.
    7. Wei Sun & Yujun He & Hong Chang, 2015. "Forecasting Fossil Fuel Energy Consumption for Power Generation Using QHSA-Based LSSVM Model," Energies, MDPI, vol. 8(2), pages 1-21, January.
    8. De Boeck, Liesje & Beliën, Jeroen & Creemers, Stefan, 2016. "A column generation approach for solving the examination-timetabling problemAuthor-Name: Woumans, Gert," European Journal of Operational Research, Elsevier, vol. 253(1), pages 178-194.
    9. F. Paola & M. Giugni & F. Pugliese & P. Romano, 2018. "Optimal Design of LIDs in Urban Stormwater Systems Using a Harmony-Search Decision Support System," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(15), pages 4933-4951, December.
    10. Hasan, Basima Hani F. & Abu Doush, Iyad & Al Maghayreh, Eslam & Alkhateeb, Faisal & Hamdan, Mohammad, 2014. "Hybridizing Harmony Search algorithm with different mutation operators for continuous problems," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 1166-1182.
    11. Edmund K. Burke & Yuri Bykov, 2016. "An Adaptive Flex-Deluge Approach to University Exam Timetabling," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 781-794, November.

    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:283:y:2016:i:c:p:316-332. 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: 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.