{"title":"为面部变形攻击找到合适的Doppelgänger","authors":"Alexander Röttcher, U. Scherhag, C. Busch","doi":"10.1109/IJCB48548.2020.9304878","DOIUrl":null,"url":null,"abstract":"ID cards are uniquely linked to one individual via a printed or electronically provided facial image. Even though the face is treated as universal and distinctive characteristic, twins can weaken this distinctiveness because of their biological similarity. Also, humans might falsely recognise an unknown person as a friend - colloquially named a Dop-pelgänger. Recently it was demonstrated that this biological effect of similar data subjects can be purposefully established between two individuals in order to improve the vulnerability of the so-called morphing attack. This image manipulation technique creates a melted facial image which is similar to two or more data subjects. If embedded into an ID card, the manipulated reference image can be used by all participating individuals and thus the concept of a unique link is broken. This work elaborates the rather neglected part of selecting morph pairs based on a similarity score instead of a simple random assignment. It discusses the applicability of different possible algorithms. The finally developed approach considers complex real-world constraints while being executable in a reasonable amount of time and producing acceptable large morph sets. It is shown that this algorithm greatly increases the vulnerability of automated face recognition systems. Surprisingly, it also proves that an effective pre-selection of pairs questions the need of in-depth optimized morphing algorithms.","PeriodicalId":417270,"journal":{"name":"2020 IEEE International Joint Conference on Biometrics (IJCB)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Finding the Suitable Doppelgänger for a Face Morphing Attack\",\"authors\":\"Alexander Röttcher, U. Scherhag, C. Busch\",\"doi\":\"10.1109/IJCB48548.2020.9304878\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ID cards are uniquely linked to one individual via a printed or electronically provided facial image. Even though the face is treated as universal and distinctive characteristic, twins can weaken this distinctiveness because of their biological similarity. Also, humans might falsely recognise an unknown person as a friend - colloquially named a Dop-pelgänger. Recently it was demonstrated that this biological effect of similar data subjects can be purposefully established between two individuals in order to improve the vulnerability of the so-called morphing attack. This image manipulation technique creates a melted facial image which is similar to two or more data subjects. If embedded into an ID card, the manipulated reference image can be used by all participating individuals and thus the concept of a unique link is broken. This work elaborates the rather neglected part of selecting morph pairs based on a similarity score instead of a simple random assignment. It discusses the applicability of different possible algorithms. The finally developed approach considers complex real-world constraints while being executable in a reasonable amount of time and producing acceptable large morph sets. It is shown that this algorithm greatly increases the vulnerability of automated face recognition systems. Surprisingly, it also proves that an effective pre-selection of pairs questions the need of in-depth optimized morphing algorithms.\",\"PeriodicalId\":417270,\"journal\":{\"name\":\"2020 IEEE International Joint Conference on Biometrics (IJCB)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Joint Conference on Biometrics (IJCB)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCB48548.2020.9304878\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Joint Conference on Biometrics (IJCB)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCB48548.2020.9304878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finding the Suitable Doppelgänger for a Face Morphing Attack
ID cards are uniquely linked to one individual via a printed or electronically provided facial image. Even though the face is treated as universal and distinctive characteristic, twins can weaken this distinctiveness because of their biological similarity. Also, humans might falsely recognise an unknown person as a friend - colloquially named a Dop-pelgänger. Recently it was demonstrated that this biological effect of similar data subjects can be purposefully established between two individuals in order to improve the vulnerability of the so-called morphing attack. This image manipulation technique creates a melted facial image which is similar to two or more data subjects. If embedded into an ID card, the manipulated reference image can be used by all participating individuals and thus the concept of a unique link is broken. This work elaborates the rather neglected part of selecting morph pairs based on a similarity score instead of a simple random assignment. It discusses the applicability of different possible algorithms. The finally developed approach considers complex real-world constraints while being executable in a reasonable amount of time and producing acceptable large morph sets. It is shown that this algorithm greatly increases the vulnerability of automated face recognition systems. Surprisingly, it also proves that an effective pre-selection of pairs questions the need of in-depth optimized morphing algorithms.