z-logo
open-access-imgOpen Access
Partial Face Recognition
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b1108.0882s819
Subject(s) - computer science , face (sociological concept) , artificial intelligence , facial recognition system , similarity (geometry) , point (geometry) , topology (electrical circuits) , pattern recognition (psychology) , surface (topology) , key (lock) , identification (biology) , image (mathematics) , computer vision , mathematics , geometry , combinatorics , social science , botany , computer security , sociology , biology
Most current Face Identification methods get features and nodes points from still and clear facial images. But, individuals in real world may be obstructed from objects or other people who do not provide the entire image of the person to describe. Keyword-following pats key recognition methods such as: Multiple Key Points with Gbor Triangle (MKD-GTP) and Group Point Matching (RPSM) correspond to the local key points for part of face recognition.Also, on the same note they measure similarity of nodes without higher order mathematical and graphicalinformation that are prone to noise. To solve this, the TPGM method evaluates a static change that encodes the geometry of the other line of the graph, so that a extra precise and stable match with the topology can be calculated.In case to apply higher topological information having higher order, paper offer a topological method to preserve the TPSM algorithm ofconstructionofa higher order shape for each surface and evaluate the change. The paper also suggests that the selection of Viola Jones face recognition points. Deep training can be used to create and combine graphs. This article offers an in-depth study of the progress made in scientific articles and explains the accuracy of the results

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here