{"title":"Fuzzy framework for joint segmentation and registration of brain MRI with prior information","authors":"M. El-Melegy, H. Mokhtar","doi":"10.1109/ICCES.2010.5674904","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674904","url":null,"abstract":"This paper introduces a fuzzy framework for the simultaneous segmentation and registration of MRI datasets. The framework utilizes prior information which may be available about the class center and class's pixels distribution through the datasets. The algorithm is evaluated using phantom and real medical MRI brain volume. The results show that the algorithm has considerable accuracy for segmentation and affine registration. The algorithm needs a small number of iterations to reach convergence compared with other similar algorithms.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127412991","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":"Real-time object tracking using color-based Kalman particle filter","authors":"A. Abdel-Hadi","doi":"10.1109/ICCES.2010.5674880","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674880","url":null,"abstract":"Robust real-time tracking of non-rigid object is a challenging task. Particle filtering has proven very successful for non-linear and non-Gaussian estimation problems. In this paper, a method for real-time tracking of moving objects which is characterized by a color probability distribution is presented. We applied Kaiman particle filter (KPF) to color-based tracking. This KPF is a particle filter including the principle of Kalman filter. We modified this KPF for color-based tracking. This modified KPF can approximate the probabilistic density of the position of the tracked object properly and needs fewer particles for tracking than conventional particle filters and previous Kalman particle filter methods. We made experiments to confirm effectiveness of this method.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229180","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":"Enhancing iris recognition system performance","authors":"A. I. Desoky, H. Ali, Nahla B. Abdel-Hamid","doi":"10.1109/ICCES.2010.5674902","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674902","url":null,"abstract":"Biometrics has become more and more important in security applications. In comparison with many other biometrie features, iris recognition has very high recognition accuracy. Successful iris recognition matching depends on how similar the stored template in database is compared with the introduced template. The main objective of this paper is to introduce a high performance scheme for iris recognition system in which a set of iris images of a given eye are fused to generate a final template. This will not only reduce the storage capacity requirements but also enhance the system's speed during the matching process. The performance of both the proposed algorithm and the overall system will be assessed","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125404419","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":"Design and implementation of a controller for automated driver evaluation","authors":"Ashok Kumar, Neeharikha Gogineni, Swapna Gogineni","doi":"10.1109/ICCES.2010.5674834","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674834","url":null,"abstract":"In the USA, a supervisor accompanies a driver during drivers-licensing road test to evaluate the driver's performance. The work in this paper envisions a system in which the supervisor can be replaced by a decision-making system, and proposes a controller for such application. By using the device proposed in this paper, the need for another person to accompany the driver can possibly be avoided, thus saving manpower. Having a device that can evaluate the performance of a driver automatically will help such motive. In order to achieve this goal, it is assumed that a few key automation technologies such as sensors, computing and communication systems will be used. The proposed device uses sensors to collect the data from the road and environment outside the vehicle. There is a fixed test path that will be fed into the device and the driver will be given the directions throughout the test. The device evaluates the performance of the driver continuously and keeps track of the number of errors the driver made. Finally it declares whether the driver passed or failed the road test based on the number of the mistakes.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125914166","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":"Flash memory SSD based DBMS for high performance computing embedded and multimedia systems","authors":"S. S. Rizvi, Tae-Sun Chung","doi":"10.1109/ICCES.2010.5674850","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674850","url":null,"abstract":"Flash memory based large capacity SSDs open the doors on high performance computing applications by offering remarkable throughput and amazing reliability. However, flash memory hardware characteristics like erase-before-write and limited endurance cycles do not allow disk based schemes implication directly. For employing such schemes, we need to revise them on some level to make them effective for flash media. Regarding, the researchers have devoted considerable efforts to implement the DBMSs on flash for fast retrieval of data that is bit indolent using file systems. However, previous techniques require huge main memory space and high computational power for data processing. This paper proposes an advanced DBMS architecture using key sequenced data set, virtual sequential access method and multilevel indexing for flash memory SSD based performance oriented embedded and multimedia applications. Basic database operations plus space reclamation and memory wear-leveling are achieved by taking flash characteristics into account carefully. Main memory based buffer management is implemented to increase throughput and for efficient media utilization. Comprehensive performance evaluations using two modern benchmarks prove less overhead with high reliability and outstanding throughput for flash SSD based DBMSs compare to HDD.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122756254","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}
A. Hussein, S. Yousef, S. Al-Khayatt, O. Arabeyyat
{"title":"An efficient weighted distributed clustering algorithm for mobile ad hoc networks","authors":"A. Hussein, S. Yousef, S. Al-Khayatt, O. Arabeyyat","doi":"10.1109/ICCES.2010.5674857","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674857","url":null,"abstract":"Clustering approach is an important research topic for MANETs and widely used in efficient network management, hierarchical routing protocol design, network modeling, Quality of Service, etc. Many researchers' recent focus has been on clustering management which is one of the fundamental problems in mobile ad hoc networks. The main objective of clustering in mobile ad-hoc network environments is how can an optimal clusterhead be elected and how can the optimal number of clusters be achieved through division without degrading the whole network's performance. In this paper, we propose new weighted distributed clustering algorithm, called CBMD. It takes into consideration the parameters: connectivity (C), residual battery power (B), average mobility (M), and distance (D) of the nodes to choose locally optimal clusterheads. The goals of this algorithm are maintaining stable clustering structure with a lowest number of clusters formed, to minimise the overhead for the clustering formation and maintenance and to maximise the lifespan of mobile nodes in the system. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusters formed, reaffiliation count and numbers of clusterhead changes. Results show that our algorithm performs better than existing ones and is also tuneable to different kinds of network conditions.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121635810","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":"Challenges and design issues of an Arabic web crawler","authors":"M. Abdeen, M. Tolba","doi":"10.1109/ICCES.2010.5674854","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674854","url":null,"abstract":"The world-wide-web has become the favorite destiny of information seekers across the globe. With its massive amount of information that includes billions of web pages, information for just about any topic is a click-of-finger away. The Arabic web represents an important portion of the web. With Arabic as the 5th most spoken language in the world and with the increasing number of Arabic internet users at exponential rates, it is becoming important to make the Arabic web content available. Many search engines exist such as Google, Msn, and Yahoo. However, these search engines are not designed with proper consideration of the Arabic language and its special nature. This paper presents some of the work while developing an Arabic search engine. The web crawler is the focus of this paper. We present important challenges and design issues of the design of a distributed web crawler for the Arabic search engine we are developing. We also uncover some of the facts about the Arabic web.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115389768","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}
A. Alenany, H. Shang, Mohamed I Soliman, I. Ziedan
{"title":"Subspace identification with prior steady-state information","authors":"A. Alenany, H. Shang, Mohamed I Soliman, I. Ziedan","doi":"10.1109/ICCES.2010.5674833","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674833","url":null,"abstract":"In system identification, the quality of data is important for obtaining good models, but there are situations where the available data are highly corrupted with noise. However, some prior information about the system to be identified, such as dc gain and settling time, may be available to obtain improved model identification despite data noise. In this paper, a subspace identification scheme incorporating known dc gain is investigated. The prior process information is incorporated into system identification through using the least square with the equality constraint that the sum of impulse response parameters is equal to the dc gain. In comparison with the existing approaches, the proposed identification strategy provides unbiased parameter estimations, is applicable to Multi-Input Multi-Output (MIMO) systems, and is computationally efficient.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896308","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":"Ranking distributed uncertain database systems: Discussion and analysis","authors":"A. El-Desouky, H. Ali, Yousry M. Abdul-Azeem","doi":"10.1109/ICCES.2010.5674872","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674872","url":null,"abstract":"Large databases with uncertainty became more common in many applications. Ranking queries are essential tools to process these databases and return only the most relevant answers of a query, based on a scoring function. Many approaches were proposed to study and analyze the problem of efficiently answering such ranking queries. Managing distributed uncertain database is also an important issue. In fact ranking queries in such systems are an open challenge. The main objective of this paper is to discuss ranking in distributed uncertain database along with its issued problems. Starting with uncertain data representation, query processing and query types in such systems are discussed along with their challenges and open research area. Top-k query is presented with its properties, as a ranking technique in uncertain data environment, mentioning distributed top-k and distributed ranking problems.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116002555","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":"Evaluation of cross layer QoS aproachs for improving voice quality over multi-rate WLANs","authors":"M. F. Tuysuz, H. A. Mantar","doi":"10.1109/ICCES.2010.5674893","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674893","url":null,"abstract":"Voice over IP (VoIP) applications over wireless local area networks (WLANs) has become increasingly popular in recent years. However, due to some performance related topics like existence of multi-rate transmission or channel conditions, it has to be placed under control continuously to prevent possible performance losses. In case of any deterioration on the wireless link conditions, IEEE 802.11 PHY/MAC specifications allow mobile nodes to select a proper transmission rate to optimize bit transmission. However, if a node selects lower transmission rate, packet losses and delays increase due to multi-rate effect. Therefore, all active calls have a general degradation. Besides, Jitter buffering is also one of the most important performance metrics of VoIP over WLANs and has to be taken into account to maximize the perceived voice quality. In this paper, we propose and evaluate our cross layer based Adaptive Codec and Frame size Modification algorithm (ACFM) with related algorithms for the optimization of maximum throughput and voice quality on multi-rate WLANs.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116953117","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}