2013 9th International Computer Engineering Conference (ICENCO)最新文献_第3页

Three different classifiers for facial age estimation based on K-nearest neighbor 基于k近邻的面部年龄估计的三种不同分类器

2013 9th International Computer Engineering Conference (ICENCO) Pub Date : 2013-12-01 DOI: 10.1109/ICENCO.2013.6736476

A. Tharwat, A. M. Ghanem, A. Hassanien

{"title":"Three different classifiers for facial age estimation based on K-nearest neighbor","authors":"A. Tharwat, A. M. Ghanem, A. Hassanien","doi":"10.1109/ICENCO.2013.6736476","DOIUrl":"https://doi.org/10.1109/ICENCO.2013.6736476","url":null,"abstract":"The exact age estimation is often treated as a classification problem; while it can be formulated as a regression problem. In this article, three different classifiers based on KNN classifier's concept for facial age estimation were designed and developed to achieve high efficiency calculation of facial age estimation. In the first classifier, we adopt KNN-distance approach to calculate minimum distance between test face image and all instances belong to the class that has the highest number of nearest samples. Additionally, in the second classifier a modified-KNN version was proposed and the classifier scoring results interpolated to calculate the exact age estimation. Furthermore, KNN-regression classifier as third classifier that used to combine the classification and regression approaches to improve the accuracy of the age estimation system. Moreover, we compared age estimation errors under two situations: case 1, age estimation is performed without discrimination between males and females (gender unknown); and case 2, age estimation is performed for males and females separately (gender known). Results of experiments conducted on well know benchmark FG-NET Database show the effectiveness of the proposed approach.","PeriodicalId":256564,"journal":{"name":"2013 9th International Computer Engineering Conference (ICENCO)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128109869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 20

Improving prediction accuracy of Matrix Factorization based Network coordinate systems 提高基于矩阵分解的网络坐标系预测精度

2013 9th International Computer Engineering Conference (ICENCO) Pub Date : 2013-12-01 DOI: 10.1109/ICENCO.2013.6736486

Walaa Saber, R. Rizk, H. Harb

引用次数: 1

A new security protocol using hybrid cryptography algorithms 一种采用混合密码算法的新型安全协议

2013 9th International Computer Engineering Conference (ICENCO) Pub Date : 2013-12-01 DOI: 10.1109/ICENCO.2013.6736485

Yasmin Alkady, Mohmed I. Habib, R. Rizk

{"title":"A new security protocol using hybrid cryptography algorithms","authors":"Yasmin Alkady, Mohmed I. Habib, R. Rizk","doi":"10.1109/ICENCO.2013.6736485","DOIUrl":"https://doi.org/10.1109/ICENCO.2013.6736485","url":null,"abstract":"A group of sensor nodes deployed in particular environment constitutes a wireless sensor network (WSN). At times the WSN can be even deployed in a very sensitive area where the security becomes a great problem. The present asymmetric encryption methods and symmetric encryption methods can offer the security levels but with many limitations. For instance key maintenance is a great problem faced in symmetric encryption methods and less security level is the problem of asymmetric encryption methods even though key maintenance is easy. A hybrid encryption method that combines both symmetric and asymmetric key can provide high security with minimized key maintenance. In this paper, a new security protocol using combination of both symmetric and asymmetric cryptographic techniques is proposed. This protocol provides three cryptographic primitives, integrity, confidentiality and authentication. It is a hybrid encryption method where elliptical curve cryptography (ECC) and advanced encryption (AES) are combined to provide node encryption. XOR-DUAL RSA algorithm is considered for authentication and (MD5) for integrity. The results show that the proposed hybrid cryptographic algorithm gives better performance in terms of computation time and the size of cipher text.","PeriodicalId":256564,"journal":{"name":"2013 9th International Computer Engineering Conference (ICENCO)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128832181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 37

Identification of weed seeds species in mixed sample with wheat grains using SIFT algorithm 基于SIFT算法的小麦混样杂草种子种类识别

2013 9th International Computer Engineering Conference (ICENCO) Pub Date : 2013-12-01 DOI: 10.1109/ICENCO.2013.6736468

M. Wafy, Hashem Ibrahim, E. Kamel

引用次数: 9

An online parallel CRC32 realization for Hybrid Memory Cube protocol 混合存储立方体协议的在线并行CRC32实现

2013 9th International Computer Engineering Conference (ICENCO) Pub Date : 2013-12-01 DOI: 10.1109/ICENCO.2013.6736466

K. Salah

{"title":"An online parallel CRC32 realization for Hybrid Memory Cube protocol","authors":"K. Salah","doi":"10.1109/ICENCO.2013.6736466","DOIUrl":"https://doi.org/10.1109/ICENCO.2013.6736466","url":null,"abstract":"Hybrid Memory Cube (HMC) is a revolutionary standard in DRAM architecture based on 3D integration. It provides marvelous concurrency and reduced latency. HMC uses CRC32 for data integrity, but conventional Serial CRC calculation is very slow and has long latencies, here we propose three methods to implement parallel CRC to be very fast. The first method uses symbolic toolbox in MATLAB to generate the final equations of the CRC, and then these equations are exported to VERILOG so that we are able to calculate it in only one clock cycle. The second method is depending on using an existing tool that can generate parallel CRC but this tool has a limitation on the input data width as it is less than the maximum allowed data width in HMC which is 1152 bits, so we were able to find a work around method that enable us to calculate CRC32 for large data widthwith this tool. The third method is based on using the polynomial mathematics for CRC, as the CRC can be calculated using long division method. Method 1 latency is one clock cycle, Method 2 latency is 2 clock cycles, and method 3 latency is 37 clock cycles compared to serial CRC which latency is 1152 clock cycles.","PeriodicalId":256564,"journal":{"name":"2013 9th International Computer Engineering Conference (ICENCO)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124974552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1