The 10th IEEE International Symposium on Signal Processing and Information Technology最新文献

{"title":"Enhancing iris recognition system performance using templates fusion","authors":"A. I. Desoky, H. Ali, Nahla B. Abdel-Hamid","doi":"10.1109/ISSPIT.2010.5711758","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711758","url":null,"abstract":"Iris recognition has very high recognition accuracy in comparison with many other biometric features. Many algorithms have been proposed to improve the performance of iris recognition. This paper proposes an iris recognition algorithm in which a set of iris images of a given eye are fused to generate a final template using the most consistent feature data. Features consistency weight matrix is determined according the noise level presented in the considered images. Such an algorithm has the capability of reducing the amount of data storage and accelerate the matching process. Simulation studies are made to test the validity of the proposed algorithm. The results obtained ensure the superior of such algorithm over any other one.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117164187","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}

{"title":"Learning electronics using image processing techniques for describing circuits to blind students","authors":"B. G. Zapirain, A. M. Zorrilla, I. Ruiz, A. Muro","doi":"10.1109/ISSPIT.2010.5711764","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711764","url":null,"abstract":"Electronics in Engineering Degrees has pedagogical resources as documentation that are not accessible to blind or visually disabled students because they can just have a text to speech conversion of the paragraphs but not a circuits schematics to speech conversion. This work presents a open source algorithm integrated in a tool compatible with OppenOffice who applies digital image processing and computer vision techniques to any circuits schematics included in the document and provides an intelligent and automatic textual description of both the sequence of electronic components and the position in the general schematics in order to make it accessible to blind people. Lecturers and teachers will be able to create teaching materials with common applications such as Pspice or Oregano, and then they will convert the charts into accessible-content figures in a very easy way. The screen reader will let them navigate around the graph in order to access the information of a concrete element in it. Assessment has been done with real trials and a satisfaction survey.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128060739","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}

{"title":"A list detection with partial SIC based on reciprocal lattice-reduction in MIMO systems","authors":"Wei Hou, T. Fujino","doi":"10.1109/ISSPIT.2010.5711795","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711795","url":null,"abstract":"This paper proposed a detection method combined the list detection with partial successive interference cancellation (SIC) based on the reciprocal lattice-reduction in MIMO system. List detection is an effective detection method for improving the performance of MIMO signal detection, but the computational expense depending on the list length is the bottleneck. To reduce the complexity of the list detection, we apply the SIC detection to calculate the partial soft estimated signals, then the rest of soft estimated signals are detected by the list detection. It also can mitigate the error propagation of SIC. Through the use of the proposed detection method, the BER performances are nearly ML detector for the 4×4 MIMO system and improved about 1.5–2dB at a BER of 10−5 for the 8×8 MIMO system compared with the reciprocal lattice reduction (LR) MMSE detector.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115855061","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}

{"title":"Manifolds for training set selection through outlier detection","authors":"A. S. Tolba","doi":"10.1109/ISSPIT.2010.5711754","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711754","url":null,"abstract":"The effect of the training set on supervised classifier performance has always been overlooked. This paper provides a new approach for training set cleaning based on the concept of outlier detection to help build sound class models during the training of supervised classifiers. Outliers in a training set result in classifier performance deterioration and slow convergence. For training set cleaning, the proposed technique transforms non-linear relationships between high dimensional patterns into a simple geometric relationship. The Isometric pattern Mapping (ISOMAP) is used to embed the high dimensional training set patterns to a low-dimensional manifold. The dispersion of mapped points will be used to locate the outliers and measure their outlyingness. Several experiments on real data sets show the promising performance of the proposed technique.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127414704","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}

{"title":"Accelerating the Nussinov RNA folding algorithm with CUDA/GPU","authors":"Dar-jen Chang, C. Kimmer, Ming Ouyang","doi":"10.1109/ISSPIT.2010.5711746","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711746","url":null,"abstract":"Graphics processing units (GPU) on commodity video cards have evolved into powerful computational devices. The RNA secondary structure arises from the primary structure and a backbone of canonical, Watson-Crick base pairings (A-U, C-G), and to a lesser extent, the G-U pairing. Early computational work by Nussinov formulated the problem of RNA secondary structure prediction as a maximization of the number of paired bases, which led to a simplified problem amenable to a dynamic programming solution for O(n3) serial time. This article describes a GPU implementation of the Nussinov dynamic programming. Computation results show that the GPU implementation is up to 290 times faster than the CPU.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116181619","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}

{"title":"Robust methods for hand gesture spotting and recognition using Hidden Markov Models and Conditional Random Fields","authors":"M. Elmezain, A. Al-Hamadi, S. Sadek, B. Michaelis","doi":"10.1109/ISSPIT.2010.5711749","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711749","url":null,"abstract":"This paper proposes an automatic method that handles hand gesture spotting and recognition simultaneously. To spot meaningful gestures of numbers (0–9) accurately, a stochastic method for designing a non-gesture model with Hidden Markov Models (HMMs) versus Conditional Random Fields (CRFs) is proposed without training data. The non-gesture model provides a confidence measure that is used as an adaptive threshold to find the start and the end point of meaningful gestures, which are embedded in the input video stream. To reduce the states number of the non-gesture model with HMMs, similar probability distributions states are merged based on relative entropy measure. Additionally, the weights of self-transition feature functions are increased for short gesture to further improve the accuracy of gesture spotting and recognition with CRFs. Experimental results show that; the proposed method can successfully spot and recognize meaningful gestures with 93.31% and 90.49% reliability for HMMs and CRFs respectively. In addition, the model inference by HMMs are faster and the saving time is 66.42% using relative entropy. The reliability of CRFs method is improved from 86.12% to 90.49% using short gesture detector.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115697984","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}

{"title":"Computer networks resilience challenges: Routing protocols","authors":"Y. Khalil, Adel Said Elmaghraby","doi":"10.1109/ISSPIT.2010.5711719","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711719","url":null,"abstract":"Computer networks are the core of the cyberinfrastucture and are endangered by malicious activities and natural disasters. These threats stress the need for a resilient computer networks to ensure business operational continuity and optimum performance. Several aspects affect computer network resilience level such as network topology, routing protocols, and others. This paper demonstrates Redundancy, Fault Tolerance and Resilience concepts within the computer network domain to illustrate the computer networks resilience goals. It also proposes a set of parameters to evaluate routing protocols' resilience. Results showed that the compounded use of throughput rate, convergence time, and routing protocol table size can be used as to evaluate the routing protocols behavior towards the computer networks resilience.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"273 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114243722","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}

{"title":"Rank aggregation algorithm using particle swarm optimization for metasearch engines","authors":"M. Faheem, E. Sallam, T. Eltobely, M. Elhamshary","doi":"10.1109/ISSPIT.2010.5711737","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711737","url":null,"abstract":"Rank aggregation is the algorithm that generates a consensus ranking from a given set of rankings from different sources. Rank aggregation algorithm has been found in many applications in web including metasearch and spam fighting. The proposed rank aggregation algorithm is called footrule optimal aggregation (FOA) because it is based upon optimizing the spearman footrule distance using particle swarm optimization. The proposed rank aggregation algorithm is implemented as a part of a complete metasearch engine. In order to ensure the effectiveness of our proposed rank aggregation algorithm, we compare the results obtained by our proposed PSO based algorithm with that obtained by the classical Borda's count method. The obtained result shows that our proposed rank aggregation method is better than the classical Borda's based method in two sides. The first side, our proposed PSO based algorithm gives lower footrule distance value than results obtained by Borda's based method for the same query .The second side, our method satisfy Condorcet criteria whereas, the Borda's based algorithm does not. On the other hand, the Borda's based rank aggregation algorithm has relatively lower running time than our proposed PSO based one.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116436762","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}

{"title":"A general framework for remote laboratory access: A standarization point of view","authors":"Yasser H. Elawady, A. S. Tolba","doi":"10.1109/ISSPIT.2010.5711755","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711755","url":null,"abstract":"Laboratory work, in the disciplines of engineering and physical sciences, has a strong impact on students' learning outcomes and it is considered to be at the heart of learning. Hardware experimental environment is usually treated as an exclusive resource for single user usage. However, the actual test run time is rather short and most of the time is wasted leaving these costly resources idle. With the increased usage of electronic kits in the educational laboratories, and the need for training a huge number of students on these kits, a cost-effective solution is the development of general framework for remote lab access. Such laboratories are very convenient and effective for learning hardware design concepts and elaborating hardware-based graduation projects. This paper addresses the hardware (HW) and software (SW) tools necessary for building a general framework for remote laboratory access. The proposed system allows performing experiments remotely across the Internet via web interface as well as locally in the classroom. In addition, it introduces enhancements for the remote lab activities leading to improving its performance and makes the data transfer more secure.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132041231","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}

{"title":"An enhanced e-learning ecosystem based on an integration between cloud computing and Web2.0","authors":"Shimaa Ouf, Mona M. Nasr, Y. Helmy","doi":"10.1109/ISSPIT.2010.5711721","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711721","url":null,"abstract":"What we know is less important than our capacity to continue to learn more until e-learning appeared. While e-learning technology has matured considerably since its inception, there are still many problems that practitioners find when come to implementing e-learning. Today's knowledge society of the 21st century requires a flexible learning environment which is capable to adapt according to teaching and learning objectives, students' profiles and preferences for information and communication technologies and services. Advances in technology offer new opportunities in enhancing teaching and learning. Many advances in learning technologies are taking place throughout the world. The new technologies enable individuals to personalize the environment in which they work or learn, utilizing a range of tools to meet their interests and needs. Research community has believed that an e-learning ecosystem is the next generation e-learning but has faced challenges in optimizing resource allocations, dealing with dynamic demands on getting information and knowledge anywhere and anytime, handling rapid storage growth requirements, cost controlling and greater flexibility. Additionally, e-learning ecosystems need to improve its infrastructure, which can devote the required computation and storage resources for e-learning ecosystems. So, we need flourish, growing, up-to-date and strong infrastructure e-learning ecosystems in a productive and cost-effective way to be able to face rapidly-changing environments. In this paper, an e-learning ecosystem (ELES) which supports modern technologies is introduced and implemented. An integration between cloud computing and Web 2.0 technologies and services will be used to support the development of e-learning ecosystems; cloud computing as an adoptable technology for many of the organizations with its dynamic scalability and usage of virtualized resources as a service through the Internet. Web 2.0 brings new instruments help building dynamic e-learning ecosystem on the web.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126517387","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}