IDEAS home Printed from https://ideas.repec.org/a/epw/ejeng0/v1y2018i2id60124.html

A Non-domination Pareto-based Scale-Invariant Approach for Face Recognition

Author

Listed:
  • Taqdir Kaur

    (Guru Nanak Dev University, R.C. Gurdaspur)

  • Renu Dhir

Abstract

Human face recognition has presented a major challenge to the researchers from different domains enabling to enhance the security and pattern analysis. The different orientations, lighting, pose and facial expression of a human face constructs an array of similar images with variations. The identification of face under different circumstances has been the focus of the researchers from a decade to the present time. For face recognition higher the number of feature may not lead to high recognition rate. Hence, the selection of the optimum features becomes primary concern. It reduces the feature size and increases the recognition rate. Many algorithms have been proposed that fulfilled the goal of face recognition system but also comprises of some drawbacks. In this paper a novel Pareto-Optimized Evolutionary Approach with Scale Invariance Discrimination has been proposed. The algorithm extracts the set of relevant features from the given image. The optimization of the features is performed for finding the features that enhances the recognition rate. The algorithm performs the classification of the test image, given the set of training images to obtain the accuracy of human face identification. The recognition rate is evaluated to show the performance of the proposed approach with conventional methods.

Suggested Citation

  • Taqdir Kaur & Renu Dhir, 2018. "A Non-domination Pareto-based Scale-Invariant Approach for Face Recognition," European Journal of Engineering and Technology Research, European Open Science, vol. 1(2), pages 6-13, July.
  • Handle: RePEc:epw:ejeng0:v:1:y:2018:i:2:id:60124
    DOI: 10.24018/ejeng.2016.1.2.124
    as

    Download full text from publisher

    File URL: https://eu-opensci.org/index.php/ejeng/article/view/60124
    File Function: Abstract page
    Download Restriction: no

    File URL: https://eu-opensci.org/index.php/ejeng/article/download/60124/11699
    File Function: Full text
    Download Restriction: no

    File URL: https://libkey.io/10.24018/ejeng.2016.1.2.124?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

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:epw:ejeng0:v:1:y:2018:i:2:id:60124. 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: Support (email available below). General contact details of provider: https://eu-opensci.org/index.php/ejeng .

    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.