{"title":"Hybrid MPI/OpenMP implementation of PCA","authors":"Dalia S. Ibrahim, Salma Hamdy","doi":"10.1109/INTELCIS.2017.8260048","DOIUrl":null,"url":null,"abstract":"Most surveillance systems depend on fully automated face recognition applications. The main concern is achieving high accuracy in real time. Principle Component Analysis algorithm is used for reducing the number of variables and getting the maximum variance between low dimensional data. The proposed approaches focus on data partitioning to minimize the execution time of the algorithm by distributing data over a cluster with parallel computing architecture. The first approach achieves 2975X and 102X relatively faster than the sequential implementation in the training and recognition phases, respectively. However, the second approach achieves 74X relatively faster than the sequential implementation in the recognition phase.","PeriodicalId":321315,"journal":{"name":"2017 Eighth International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Eighth International Conference on Intelligent Computing and Information Systems (ICICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELCIS.2017.8260048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Most surveillance systems depend on fully automated face recognition applications. The main concern is achieving high accuracy in real time. Principle Component Analysis algorithm is used for reducing the number of variables and getting the maximum variance between low dimensional data. The proposed approaches focus on data partitioning to minimize the execution time of the algorithm by distributing data over a cluster with parallel computing architecture. The first approach achieves 2975X and 102X relatively faster than the sequential implementation in the training and recognition phases, respectively. However, the second approach achieves 74X relatively faster than the sequential implementation in the recognition phase.