基于金字塔注意网络的双卷积神经网络分类器用于基于图像的亲属关系验证

IF 0.3 Q4 COMPUTER SCIENCE, CYBERNETICS Acta Cybernetica Pub Date : 2023-06-02 DOI:10.14232/actacyb.296355
R. F. Rachmadi, I. Purnama, S. M. S. Nugroho, Y. Suprapto
{"title":"基于金字塔注意网络的双卷积神经网络分类器用于基于图像的亲属关系验证","authors":"R. F. Rachmadi, I. Purnama, S. M. S. Nugroho, Y. Suprapto","doi":"10.14232/actacyb.296355","DOIUrl":null,"url":null,"abstract":"A family is the smallest entity that formed the world with specific characteristics. The characteristics of a family are that the member can/may share some similar DNA and leads to similar physical appearances, including similar facial features. This paper proposed a dual convolutional neural network (CNN) with a pyramid attention network for image-based kinship verification problems. The dual CNN classifier is formed by paralleling the FaceNet CNN architecture followed by family-aware features extraction network and three final fully-connected layers. A channel-wise pyramid attention network is added after the last convolutional layers of FaceNet CNN architecture. The family-aware features extraction network is used to learn family-aware features using the SphereFace loss function. The final features used to classify the kin/non-kin pair are joint aggregation features between the pyramid attention features and family-aware features. At the end of the fully connected layer, a softmax loss layer is attached to learn kinship verification via binary classification problems. To analyze the performance of our proposed classifier, we performed experiments heavily on the Family in The Wild (FIW) kinship verification dataset. The FIW kinship verification dataset is the largest dataset for kinship verification currently available. Experiments of the FIW dataset show that our proposed classifier can achieve the highest average accuracy of 68.05% on a single classifier scenario and 68.73% on an ensemble classifier scenario which is comparable with other state-of-the-art methods. ","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2023-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dual Convolutional Neural Network Classifier with Pyramid Attention Network for Image-Based Kinship Verification\",\"authors\":\"R. F. Rachmadi, I. Purnama, S. M. S. Nugroho, Y. Suprapto\",\"doi\":\"10.14232/actacyb.296355\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A family is the smallest entity that formed the world with specific characteristics. The characteristics of a family are that the member can/may share some similar DNA and leads to similar physical appearances, including similar facial features. This paper proposed a dual convolutional neural network (CNN) with a pyramid attention network for image-based kinship verification problems. The dual CNN classifier is formed by paralleling the FaceNet CNN architecture followed by family-aware features extraction network and three final fully-connected layers. A channel-wise pyramid attention network is added after the last convolutional layers of FaceNet CNN architecture. The family-aware features extraction network is used to learn family-aware features using the SphereFace loss function. The final features used to classify the kin/non-kin pair are joint aggregation features between the pyramid attention features and family-aware features. At the end of the fully connected layer, a softmax loss layer is attached to learn kinship verification via binary classification problems. To analyze the performance of our proposed classifier, we performed experiments heavily on the Family in The Wild (FIW) kinship verification dataset. The FIW kinship verification dataset is the largest dataset for kinship verification currently available. Experiments of the FIW dataset show that our proposed classifier can achieve the highest average accuracy of 68.05% on a single classifier scenario and 68.73% on an ensemble classifier scenario which is comparable with other state-of-the-art methods. \",\"PeriodicalId\":42512,\"journal\":{\"name\":\"Acta Cybernetica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Cybernetica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14232/actacyb.296355\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybernetica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14232/actacyb.296355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

摘要

家庭是构成具有特定特征的世界的最小实体。一个家庭的特征是成员可以/可能拥有一些相似的DNA,并导致相似的外貌,包括相似的面部特征。本文提出了一种具有金字塔关注网络的双卷积神经网络(CNN)来解决基于图像的亲属关系验证问题。双CNN分类器由并行FaceNet CNN架构,然后是家族感知特征提取网络和三个最终的全连接层组成。在FaceNet CNN架构的最后一层卷积层之后,添加了一个通道式金字塔注意力网络。家族感知特征提取网络利用SphereFace损失函数学习家族感知特征。最后用于分类亲缘/非亲缘对的特征是金字塔注意特征和家族意识特征之间的联合聚集特征。为了分析我们提出的分类器的性能,我们在Family in the Wild (FIW)亲属关系验证数据集上进行了大量实验。FIW亲属关系验证数据集是目前可用的最大的亲属关系验证数据集。FIW数据集的实验表明,我们提出的分类器在单个分类器场景下可以达到68.05%的最高平均准确率,在集成分类器场景下可以达到68.73%的最高平均准确率,与其他最先进的方法相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dual Convolutional Neural Network Classifier with Pyramid Attention Network for Image-Based Kinship Verification
A family is the smallest entity that formed the world with specific characteristics. The characteristics of a family are that the member can/may share some similar DNA and leads to similar physical appearances, including similar facial features. This paper proposed a dual convolutional neural network (CNN) with a pyramid attention network for image-based kinship verification problems. The dual CNN classifier is formed by paralleling the FaceNet CNN architecture followed by family-aware features extraction network and three final fully-connected layers. A channel-wise pyramid attention network is added after the last convolutional layers of FaceNet CNN architecture. The family-aware features extraction network is used to learn family-aware features using the SphereFace loss function. The final features used to classify the kin/non-kin pair are joint aggregation features between the pyramid attention features and family-aware features. At the end of the fully connected layer, a softmax loss layer is attached to learn kinship verification via binary classification problems. To analyze the performance of our proposed classifier, we performed experiments heavily on the Family in The Wild (FIW) kinship verification dataset. The FIW kinship verification dataset is the largest dataset for kinship verification currently available. Experiments of the FIW dataset show that our proposed classifier can achieve the highest average accuracy of 68.05% on a single classifier scenario and 68.73% on an ensemble classifier scenario which is comparable with other state-of-the-art methods. 
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Acta Cybernetica
Acta Cybernetica COMPUTER SCIENCE, CYBERNETICS-
CiteScore
1.10
自引率
0.00%
发文量
17
期刊介绍: Acta Cybernetica publishes only original papers in the field of Computer Science. Manuscripts must be written in good English.
期刊最新文献
Integer Programming Based Optimization of Power Consumption for Data Center Networks Refined Fuzzy Profile Matching Corner-Based Implicit Patches Towards Abstraction-based Probabilistic Program Analysis Dual Convolutional Neural Network Classifier with Pyramid Attention Network for Image-Based Kinship Verification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1