{"title":"1DLBP and PCA for face recognition","authors":"Amir Benzaoui, A. Boukrouche","doi":"10.1109/ISPS.2013.6581486","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581486","url":null,"abstract":"A new algorithm for face recognition is proposed in this work, this algorithm is mainly based on LBP texture analysis in one dimensional space 1DLBP and Principal Component Analysis PCA as a technique for dimensionalities reduction. The extraction of the face's features is inspired from the principal that the human visual system combines between local and global features to differentiate between people. Starting from this assumption, the facial image is decomposed into several blocks with different resolution, and each decomposed block is projected in one dimensional space. Next, the proposed descriptor 1DLBP is applied for each projected block. Then, the resulting vectors will be concatenated in one global vector. Finley, Principal Component Analysis is used to reduce the dimensionalities of the global vectors and to keep only the pertinent information for each person. The experimental results applied on AR database have showed that the proposed descriptor 1DLBP combined with PCA have given a very significant improvement at the recognition rate and the false alarm rate compared with other methods of face recognition, and a good effectiveness against to deferent external factors as: illumination, rotations and noise.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126473945","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":"Ontology-based evaluation of fuzzy bipolar conjunctive queries over relational databases","authors":"Nouredine Tamani, L. Lietard, D. Rocacher","doi":"10.1109/ISPS.2013.6581490","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581490","url":null,"abstract":"In the wake of flexible querying system, proposed in [26], [28], [29], in which the bipolarity of the form “and if possible” is used as means to express user preferences over relational databases and ontologies (fuzzy bipolar DLR-Lite), we introduce in this paper the user query evaluation process, under the extension of our flexible querying framework to bipolar conditions of the form “or else” [20], [19]. Queries addressed to our system are bipolar conjunctive queries made of a conjunction of atoms corresponding to concepts of an ontology. The proposed evaluation process is carried out in two main steps. The former consists of query derivation to compute complementary queries, based on substitutions of query's atoms involved in fuzzy bipolar subsumptions expressed in the considered bipolar ontology. The latter deals with the translation of the obtained set of queries from the first step into bipolar SQLf statements, which are finally evaluated over a bipolar relational database managed by PostgreSQLf DBMS extended to bipolar datatypes and functions. Three algorithms are then developed in order to perform applicable substitutions, to derive corresponding complementary queries and to translate them into Bipolar SQLf statements. The feasibility of the approach is shown through a prototype developed in the field of multimodal transport systems.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133138082","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":"Mapping SysML to modelica to validate wireless sensor networks non-functional requirements","authors":"Samir Berrani, A. Hammad, H. Mountassir","doi":"10.1109/ISPS.2013.6581484","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581484","url":null,"abstract":"Wireless Sensor Networks (WSN) have registered a large success in the scientific and industrial communities for their broad application domains. Furthermore, the WSN specification is a complex task considering to their distributed and embedded nature and the strong interactions between their hardware and software parts. Moreover, most of approaches use semi-formal methods to design systems and generally simulation to validate their properties in order to produce models without errors and conform to the system specifications. In this context, we propose a Model Driven Architecture (MDA) approach to improve the verification of the WSN properties. This approach combines the advantages of the System Modeling Language (SysML) and the Modelica language which promote the reusability and improve the development process. In this work, we specify a model transformation from SysML static, dynamic and requirement diagrams to their corresponding elements in Modelica. Thanks to the SysML requirement diagram which is transformed into Modelica properties (constraints), we propose a technique using dynamic tests to verify WSN properties. We have used the Topcased platform to implement our approach 1 and chosen a crossroads monitoring system which is based on wireless sensors to illustrate it. Besides, we have verified and validated some wireless sensors properties of the studied system.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129609858","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 combined approach using meta-heuristic and mathematical operators for images segmentation","authors":"Bidi Noria, Fizazi Hadria","doi":"10.1109/ISPS.2013.6581477","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581477","url":null,"abstract":"In this paper we propose a multi-agent approach based on the combination of a meta-heuristic approach with mathematical operators for image segmentation. Our model used resolution, edge and region agents. The role of resolution agent is to describe the contents of the image using multiple representations with decreasing resolution while the edge agent detects edges in one level of resolution images. Region agent makes use of spider's webs to detect different regions. The proposed approach has been implemented in the JADE agent platform over synthetic and a satellite image. An unsupervised measure was used to improve the effectiveness of our model.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130276170","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":"Hardware and software consideration to use near real time MSG-SEVIRI and NOAA-AVHRR images","authors":"A. Hassini, A. Belbachir","doi":"10.1109/ISPS.2013.6581487","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581487","url":null,"abstract":"The SEVIRI (Spinning Enhanced Visible and Infrared Imager) sensor on the MSG-2 satellite provides an image every 15 minutes, so the development of a system that can exploit the temporal behavior of the observations of terrestrial half-disc, is crucial for these near-real-time applications. To validate the processing results, we need to use some others sensors, like AVHRR (Advanced Very High Resolution Radiometer) for NOAA-19 satellite. A terrestrial station is required to collect and follow the temporal, spectral, and space evolution of the treated topic of interest. In this research, we realized a ground station, to receive daily data from either HRIT (High Rate Image Transmission from METEOSAT-9 geostationary satellite baptized MSG-2), HRPT and APT (High Resolution Picture Transmission and Automatic Picture Transmission from NOAA-19 polar satellite) real time satellite data transmissions. A motorized dish antenna is used to receive HRPT images. In the APT system, a fixed omnidirectional antenna is used. Some results of acquisition and treatment (by our MSGViewer and PCNOAA developed softwares) are described in this paper. After calibrating each data, we have developed various thematic products, such as, terrestrial Albedo, brightness temperature and others treatments. The data gathered is useful in many remote sensing applications. In this work, we are arrived to receive in real time the APT and the HRPT format of the NOAA-19 satellite and HRIT format from MSG-2 satellite. Different combinations between visible and infrared bands based on images that the NOAA satellite and MSG-2 has obtained through its AVHRR Radiometer and SEVIRI Imager.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133949028","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":"SA-SPKC: Secure and efficient aggregation scheme for wireless sensor networks using stateful public key cryptography","authors":"Merad Boudia Omar Rafik, F. Mohammed","doi":"10.1109/ISPS.2013.6581500","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581500","url":null,"abstract":"Data aggregation in wireless sensor networks (WSNs) provides a great reduction of energy consumption. The limited resources of sensor nodes make the choice of an encryption algorithm very important for providing security for data aggregation. Asymmetric cryptography involves large ciphertexts and heavy computations but solves, on the other hand, the problem of key distribution of symmetric one. The latter provides smaller ciphertexts and speed computations. Also, the recent researches have shown that achieving the end-to-end confidentiality and the end-to-end integrity at the same is a challenging task. In this paper, we propose (SA-SPKC), a novel security protocol which addresses both security services for WSNs, and where only the base station can verify the individual data and identify the malicious node. Our scheme is based on stateful public key encryption (StPKE). The latter combines the best features of both kinds of encryption along with state in order to reduce the computation overhead. Our analysis shows the security and the efficiency of our scheme for WSNs.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132960262","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 massively parallel ESB","authors":"Ridha Benosman, Kamel Barkaoui, Yves Albrieux","doi":"10.1109/ISPS.2013.6581499","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581499","url":null,"abstract":"Enterprise Service Bus (ESB) is an SOA-based software architecture for business application integration in distributed and heterogeneous environments. The proposed solutions so commercial as open source offer the same set of basic services such as message transformation, message routing, security. However, none of them take advantage of the multicore/multiprocessor technologies which make plausible the massively parallel processing. In this paper, we describe a new ESB architecture denoted Massively Parallel Application Bus (MPAB) which meets this challenge.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129304410","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}