IEMN
  • Home
  • News
    • IEMN Newsletters
    • M2-Ingé Internships
    • Job offers
    • All news
  • The Institute
    • Presentation
    • Organization of the institute
    • The Scientific Department
    • The Technological Department
    • Administrative and financial management
    • Rules of procedure
    • Our commitments
  • The Research
    • Scientific departments
      • Nanostructured Materials and Components
      • Micro / nano optoelectronics
      • Telecommunications Technologies and Intelligent Systems
      • Acoustic
    • Research groups
    • Flagship
  • Scientific Production
    • IEMN publications
    • Scientific production resources
  • The platforms
    • CMNF - Central Platform for Micro Nano Manufacturing
      • Engraving and implantation pole
      • In Line Analysis Unit
      • Soft Lithography and Bio Microfluidics
      • Deposits and epitaxy division
      • Lithography Unit
      • Packaging Division
      • CMNF Staff
    • PCMP - Multi-Physics Characterization Platform
      • Scanning Probe Microscopy Facility
      • Hyperfrequency, Optical and Photonic Characterization (CHOP)
      • Advanced Communications Systems and Prototyping cluster (SigmaCOM)
      • Characterisation, ElectroMagnetic Compatibility and Prototyping Centre (C2EM)
      • PCMP Staff
    • Services offered by our platforms
  • Partnership - Valuation
    • Academic Collaborations
    • ANR Projects
    • Main international collaborations
    • Industrial partnerships
    • The joint IEMN-Industry laboratories
    • Startups
  • Research Training
    • After the thesis
      • Do a post-doc at the IEMN
      • Towards the world of business and industry
      • Become a teacher-researcher
      • Become a Researcher
      • Starting a business at IEMN
      • FOCUS on a SATT engineer from the IEMN
    • A thesis at IEMN
      • Thesis and HDR defenses
      • Thesis topics
      • Financing
      • Doctoral studies
    • Master - Engineer
      • Masters ULille
        • Master Life Sciences and Technologies graduate programme
        • Master Nanosciences and Nanotechnologies - Speciality ETECH
        • Master Networks and Telecommunications
      • UPHF-INSA Masters
        • Master in Embedded Systems and Mobile Communications Engineering
        • Master Cyber Defense and Information Security
        • Master in Materials, Control and Safety
        • Master in Image and Sound Systems Engineering
      • Partner/Tutoring Engineering Schools
      • M2-Ingé Internships
    • The Lille branch of the GIP-CNFM
    • Nano-École Lille
  • Contact Us
    • Location
    • Contact form
    • Staff directory
  • Our support
  • fr_FR
  • Rechercher
  • Menu Menu
NEWS

THESE : O. LAIADI -Vérification de la parenté entre deux personnes par apprentissage machine

O. LAIADI

Soutenance : 13 Juillet 2021
Thèse de doctorat en Electronique, Microélectronique, Nanoélectronique et Micro-ondes, Université de Biskra, Université Polytechnique Hauts de France.

[av_hr class=’default’ shadow=’no-shadow’ position=’center’ custom_border=’av-border-thin’ custom_width=’50px’ custom_border_color= » custom_margin_top=’5px’ custom_margin_bottom=’5px’ icon_select=’yes’ custom_icon_color= » icon=’ue808′ font=’entypo-fontello’ av_uid=’av-kjh3zw’ admin_preview_bg= »

Summary:

Le domaine de la vérification de la parenté a attiré beaucoup d’attention ces dernières années en raison de sa capacité à améliorer les systèmes biométriques en tant que biométrique souple pour la vérification du visage (traits de parenté). Parmi ces applications, citons la création d’arbres généalogiques, l’organisation d’albums de famille, l’annotation d’images, la recherche d’enfants disparus et la criminalistique. Dans cette thèse, la vérification de la parenté faciale sur les images faciales est étudiée. À cette fin, nous commençons avec les méthodes de vérification de parenté basées sur les fonctionnalités, les méthodes de vérification de parenté basées sur l’apprentissage métrique et les méthodes de vérification de parenté basées sur l’apprentissage profond par convolution. Notre système proposé comprend trois phases principales à savoir : 1) extractions de caractéristiques, 2) proposition d’un nouvel espace de transformation, 3) décision de vérification de la parenté. Notre système est validé sur différentes bases de données. Les résultats obtenus montrent une grande amélioration, en termes de robustesse et de précision, pour la vérification de la parenté faciale sur les bases de données grandes et petites et notre système est aussi bien adapté aux applications en temps réel.

Abstract:

The field of kinship verification has attracted a lot of attention in recent years due to its ability to enhance biometric systems as a flexible biometric for facial verification (kinship traits). Some of these applications include creating family trees, organizing family albums, annotating images, finding missing children, and forensics. In this thesis, facial kinship verification on facial images is studied. To this end, we start with feature-based kinship verification methods, metric learning-based kinship verification methods, and deep convolution learning-based kinship verification methods. Our proposed system consists of three main phases namely: 1) feature extraction, 2) proposal of a new transformation space, 3) kinship verification decision. Our system is validated on different databases. The obtained results show a great improvement, in terms of robustness and accuracy, for facial relatedness verification on large and small databases and our system is also well suited for real-time applications.

Logo
Cité Scientifique
Avenue Henri Poincaré
CS 60069
59 652 Villeneuve d'Ascq Cedex, France
CNRS Logo University of Lille Logo University Polytech Logo Junia Logo Centrale Lille Logo Renatech Logo RFnet Logo
Site map
Copyright Service ECM et pôle SISR 2024
  • Scientific production
  • Legal information
  • Privacy policy
Faire défiler vers le haut
fr_FR
fr_FR
en_GB
We use cookies to ensure you have the best experience on our website. If you continue to use this site, we will assume that you are happy with it.OKNoPrivacy policy