Diyah Utami Kusumaning Putri, Aina Musdholifah, Faizal Makhrus, Viet-Hang Duong, Phuong Thi Le, Bo-Wei Chen, Jia-Ching Wang
{"title":"基于脊正则化的稀疏复矩阵分解的遮挡人脸识别","authors":"Diyah Utami Kusumaning Putri, Aina Musdholifah, Faizal Makhrus, Viet-Hang Duong, Phuong Thi Le, Bo-Wei Chen, Jia-Ching Wang","doi":"10.1109/ISPACS51563.2021.9651107","DOIUrl":null,"url":null,"abstract":"Matrix factorization is a method for dimensionality reduction which plays an important role in pattern recognition and data analysis. This work exploits the usefulness of our proposed complex matrix factorization (CMF) with ridge regularization (SCMF-L2) in occluded face recognition. Experiments on occluded face recognition reveal that the SCMF-L2 method provides the best recognition result among all the nonnegative matrix factorization (NMF) and CMF methods. The proposed method also reaches the stopping condition and converge much faster than the other NMF and CMF methods.","PeriodicalId":359822,"journal":{"name":"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Occluded Face Recognition Using Sparse Complex Matrix Factorization with Ridge Regularization\",\"authors\":\"Diyah Utami Kusumaning Putri, Aina Musdholifah, Faizal Makhrus, Viet-Hang Duong, Phuong Thi Le, Bo-Wei Chen, Jia-Ching Wang\",\"doi\":\"10.1109/ISPACS51563.2021.9651107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Matrix factorization is a method for dimensionality reduction which plays an important role in pattern recognition and data analysis. This work exploits the usefulness of our proposed complex matrix factorization (CMF) with ridge regularization (SCMF-L2) in occluded face recognition. Experiments on occluded face recognition reveal that the SCMF-L2 method provides the best recognition result among all the nonnegative matrix factorization (NMF) and CMF methods. The proposed method also reaches the stopping condition and converge much faster than the other NMF and CMF methods.\",\"PeriodicalId\":359822,\"journal\":{\"name\":\"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPACS51563.2021.9651107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS51563.2021.9651107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Occluded Face Recognition Using Sparse Complex Matrix Factorization with Ridge Regularization
Matrix factorization is a method for dimensionality reduction which plays an important role in pattern recognition and data analysis. This work exploits the usefulness of our proposed complex matrix factorization (CMF) with ridge regularization (SCMF-L2) in occluded face recognition. Experiments on occluded face recognition reveal that the SCMF-L2 method provides the best recognition result among all the nonnegative matrix factorization (NMF) and CMF methods. The proposed method also reaches the stopping condition and converge much faster than the other NMF and CMF methods.