Dynamic Graph Representation for Occlusion Handling in Biometrics
文献类型:会议论文
作者 | Ren M(任民)1,2![]() ![]() ![]() ![]() |
出版日期 | 2020-07 |
会议日期 | 2020-7-12 |
会议地点 | New York, USA |
英文摘要 | The generalization ability of Convolutional neural networks (CNNs) for biometrics drops greatly due to the adverse ef- fects of various occlusions. To this end, we propose a novel unified framework integrated the merits of both CNNs and graphical models to learn dynamic graph representations for occlusion problems in biometrics, called Dynamic Graph Representation (DGR). Convolutional features onto certain regions are re-crafted by a graph generator to establish the connections among the spatial parts of biometrics and build Feature Graphs based on these node representations. Each node of Feature Graphs corresponds to a specific part of the input image and the edges express the spatial relationships be- tween parts. By analyzing the similarities between the nodes, the framework is able to adaptively remove the nodes rep- resenting the occluded parts. During dynamic graph match- ing, we propose a novel strategy to measure the distances of both nodes and adjacent matrixes. In this way, the proposed method is more convincing than CNNs-based methods be- cause the dynamic graph method implies a more illustrative and reasonable inference of the biometrics decision. Experi- ments conducted on iris and face demonstrate the superior- ity of the proposed framework, which boosts the accuracy of occluded biometrics recognition by a large margin com- paring with baseline methods. The code is available at https: //github.com/RenMin1991/Dyamic Graph Representation |
语种 | 英语 |
源URL | [http://ir.ia.ac.cn/handle/173211/50603] ![]() |
专题 | 自动化研究所_智能感知与计算研究中心 |
通讯作者 | Sun ZN(孙哲南) |
作者单位 | 1.University of Chinese Academy of Sciences 2.CRIPAC NLPR CASIA |
推荐引用方式 GB/T 7714 | Ren M,Wang YL,Sun ZN,et al. Dynamic Graph Representation for Occlusion Handling in Biometrics[C]. 见:. New York, USA. 2020-7-12. |
入库方式: OAI收割
来源:自动化研究所
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。