{"title":"Facial expression analysis: A study on temporal models of facial action units","authors":"Samer S. Iskander, Mohamed T. El-Sonni","doi":"10.1109/ICENCO.2010.5720440","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720440","url":null,"abstract":"There is an increased interest in developing an automatic facial expression analysis to recognize and model real human faces. In this paper, a local model-based approach for extraction of facial feature points from 2D still images and feature points tracking in image sequences are presented. It presents an algorithm that extracts the local oriented edges of intransient facial features (eyebrows, eyes, nose and mouth) to get the facial features edge map and transient features such as wrinkles densities. Finally, two experimental studies within this research paper are performed. The first one aims for measuring the accuracy of the proposed system. The second one demonstrates the temporal models of permanent and transient features.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122689654","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":"Automotive software development and management","authors":"A. Shaout, Monika Arora, S. Awad","doi":"10.1109/ICENCO.2010.5720417","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720417","url":null,"abstract":"This paper highlights few of the challenges associated with developing, sustaining, managing and re-using embedded systems in a complex automotive environment. This paper will specifically focus on requirement management techniques, advances in modeling languages and use of Product Life Cycle Management (PLM) solutions to alleviate some of the challenges faced by the automotive industry today.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114739923","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":"Choosing the objective of optimal routing protocols in Delay Tolerant networks","authors":"T. Abdelkader, Kshirasagar Naik, A. Nayak","doi":"10.1109/ICENCO.2010.5720418","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720418","url":null,"abstract":"Networks in which nodes are sparsely distributed and, therefore, are disconnected for long periods of time, are termed Delay Tolerant networks (DTN). The intermittent connection, together, with the limited resources of mobile nodes, mainly power and memory, created a challenging environment for data networking in DTN. Routing protocols developed for DTN tend to discover and select the minimum end-to-end delay paths to destinations assuming that these paths provide the highest delivery rate. To achieve this goal, they spread many copies of the same packet, ignoring the limitedness of storage space and power sources. In this paper, we study this problem by building a mathematical model for optimal routing in DTN. We compare the results of implementing three objectives for this model: minimizing the end-to-end delay, minimizing the end-to-end number of hops, and maximizing the delivered messages. We study and analyze the impact of varying the buffer space, the traffic load and the packets time-to-live (TTL) on the three objectives. Results show that minimizing the number of hops provides higher delivery ratio than minimizing the delay, which contradicts the previous assumption. In addition, minimizing the number of hops significantly reduces the number of transmissions which results in saving energy.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115413443","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 novel method for throughput enhancement of adaptive OFDM in attenuated power line channels","authors":"M. Heggo, S. E. El Ramly, H.M. El Badawy","doi":"10.1109/ICENCO.2010.5720424","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720424","url":null,"abstract":"Communications over power line channels offer inexpensive and convenient solution for signal transmission; however power line channel suffers from multipath fading and frequency selectivity along with manmade burst impulsive noise. Data spread OFDM has been evolved as an efficient adaptive modulation that controls the power of each subcarrier according to its channel transfer function. This paper aims to present a novel method using data spread OFDM to achieve higher carrier to noise ratio (CNR) and lower bit error rate (BER) in highly attenuated power line channel conditions. The simulations prove that the proposed system outperforms the conventional one under harsh power line conditions.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114455515","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":"Pyramid-based multiresolution tiling for interactive viewing of remote sensing images","authors":"E. Hemayed, Eman M. Farghal, S. Shaheen","doi":"10.1109/ICENCO.2010.5720439","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720439","url":null,"abstract":"The size of remotely sensed imagery continues to grow at rapid rates with the advent of new high resolution sensors. Remote sensing images contain huge amount of geographical information that reflects the complexity of geographical features and spatial structures. Image mosaics covering large geographical regions at multiple resolutions are also becoming more prevalent. New techniques are needed to efficiently store and quickly retrieve such large datasets for interactive viewing on computers with physical memory many times smaller than the size of the data to be viewed. The pyramid data structure, known also as hierarchical architecture, provides a means of describing images at different level of details. In this paper, we are presenting a multiresolution tiling technique that uses Bounded Irregular Pyramid structure to represent in a compact form and store/retrieve remote sensing images for interactive viewing on a remote machine. In this study, the proposed representation, its encoding and decoding algorithms were developed and applied to remote sensing images; the fidelity and efficiency of the algorithms and their relationship with the spatial complexity of the images were evaluated.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126259234","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 new hybrid registration technique for dental panoramic X-ray images","authors":"N. Mekky, F. Abou-Chadi, S. Kishk","doi":"10.1109/ICENCO.2010.5720441","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720441","url":null,"abstract":"This paper presents a fast and fully automatic hybrid image registration technique using wavelet-based hierarchical approach. At low resolution level, mutual-information (MI) based registration using similarity transformation model is performed. At high resolution level, scale invariant feature transform (SIFT) based registration is applied to accelerate registration convergence and to achieve good computational efficiency using rough parameters extracted from MI. To remove outliers automatically a RANdom Sample And Consensus (RANSAC) algorithm is applied. A comparison between proposed technique with hybrid registration approach using MI and SIFT in the spatial domain and with three wavelet-based registration techniques is achieved: point mapping registration, SIFT-based registration, and MI-based hierarchical registration. The quality of the registration process was measured using the following criteria: normalized cross-correlation coefficient (NCCC), percentage relative root mean square error (PRRMSE), and run time. The application of the selected techniques to dental panoramic X-ray images has shown that proposed wavelet-based approach combining MI, SIFT, and RANSAC algorithm gives the best results and can be used efficiently for registration of X-ray images. It gave 0.7805 NCCC, 0.1040% PRRMSE, and 22 seconds run time.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115248601","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 rate-based scheme for minimizing the cost of wireless sensor networks","authors":"Mohamed Elsersy, M. Fattouche","doi":"10.1109/ICENCO.2010.5720430","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720430","url":null,"abstract":"Heterogeneity in wireless sensor network were discussed in previous work. Link heterogeneity in wireless sensor network is studied here to minimize the financial cost of the network. This paper introduces a technique for reducing the cost of static wireless sensor networks by replacing some of the nodes in the network that have both transmit and receive capability with transmit only nodes. During the network design phase, the optimal information flows that maximize network lifetime are calculated. The nodes that are not playing a significant role as relays for the traffic of other nodes are then selected to be replaced with a node that is transmit only. Network simulations illustrate that this technique can significantly reduce network cost with a relatively minor degradation in network lifetime.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122784494","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":"Comparative study of polyinstantiation models in MLS database","authors":"A. Sallam, Sayed M. Elrabie, O. Faragallah","doi":"10.1109/ICENCO.2010.5720444","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720444","url":null,"abstract":"Polyinstantiabtion provides the ability to create more versions of single information. It is used to prevent inference attacks. This paper explains the use of polyinstantiation in relational databases with multilevel security. Also, shows how polyinstantiation can be occurred and what types of polyinstantiation. The basic concepts of multilevel security database models are described and issues regarding the MLS such as semantics, decomposition and recovery algorithms are considered. A comparison of well-known multilevel security models (SeaView, Jajodia-Sandhu, Smith-Winslett, MLR, and Belief-Consistent Model) is given. The main problems such as semantic ambiguity caused by the lack of semantics or incomplete semantic definitions, proliferation problem, Restriction of the scope of an update and disbelief in a tuple are discussed","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129309584","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}
C. Reis, P. André, Rogerio Dionisio, B. Neto, A. Teixeira, A. Maziotis, C. Kouloumentas, C. Stamatiadis, M. Bougioukos, H. Avramopoulos, N. Calabretta, H. Dorren
{"title":"Experimental evaluation of all-optical asynchronous and synchronous memories","authors":"C. Reis, P. André, Rogerio Dionisio, B. Neto, A. Teixeira, A. Maziotis, C. Kouloumentas, C. Stamatiadis, M. Bougioukos, H. Avramopoulos, N. Calabretta, H. Dorren","doi":"10.1109/ICENCO.2010.5720420","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720420","url":null,"abstract":"We experimentally demonstrate the accuracy of an all-optical S-R latch and an optical S-R flip-flop based on hybrid integrated Mach-Zehnder Interferometers, with Semiconductor Optical Amplifier in each arm (MZI-SOA). The performance of both bistable devices will be studied and compared in terms of extinction ratio and switching times.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125373440","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}
E. Soltan, S. El-Rabaie, N. El-Fishawy, F. A. Abd El-Samie, Said Elkhamy
{"title":"Wavelet-based image interpolation with a least squares algorithm","authors":"E. Soltan, S. El-Rabaie, N. El-Fishawy, F. A. Abd El-Samie, Said Elkhamy","doi":"10.1109/ICENCO.2010.5720435","DOIUrl":"https://doi.org/10.1109/ICENCO.2010.5720435","url":null,"abstract":"A new digital image interpolation method that is performed in the wavelet domain with a least squares algorithm is presented in this paper. This method estimates wavelet coefficients in the high frequency sub-images of the estimated High-Resolution (HR) image from the Low-Resolution (LR) image using a least squares algorithm. An inverse wavelet transform is then performed for the synthesis of the HR image. Experimental results show that the proposed method outperforms other commonly used methods such as the bilinear, bicubic, and traditional least squares methods, objectively and subjectively.","PeriodicalId":436095,"journal":{"name":"2010 International Computer Engineering Conference (ICENCO)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130517492","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}