Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354025
Amina Bengag, Mohamed El boukhari
Vehicular Ad Hoc Networks (VANETs) is a subclass of the Mobile Ad Hoc Networks, which do not rely on a preexisting infrastructure, in which each node participates in routing by forwarding data for other nodes. The main purpose of VANET is to provide road traffic safety for the drivers in addition to make a comfortable driving environment. Although the big challenge in VANET in contract to MANET is to design a routing protocols more suitable to route packets efficiently to their final destination, in spite of the high speed of vehicles, frequent disconnection and the highly changeable topology. In this paper we discussed, the details of conventional routing protocols designed for VANETs, their advantages and weaknesses and also highlights the open issues that remain to be addressed.
{"title":"Classification and comparison of routing protocols in VANETs","authors":"Amina Bengag, Mohamed El boukhari","doi":"10.1109/ISACV.2018.8354025","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354025","url":null,"abstract":"Vehicular Ad Hoc Networks (VANETs) is a subclass of the Mobile Ad Hoc Networks, which do not rely on a preexisting infrastructure, in which each node participates in routing by forwarding data for other nodes. The main purpose of VANET is to provide road traffic safety for the drivers in addition to make a comfortable driving environment. Although the big challenge in VANET in contract to MANET is to design a routing protocols more suitable to route packets efficiently to their final destination, in spite of the high speed of vehicles, frequent disconnection and the highly changeable topology. In this paper we discussed, the details of conventional routing protocols designed for VANETs, their advantages and weaknesses and also highlights the open issues that remain to be addressed.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127561074","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354075
Yassine Karouani, Ziyati Elhoussaine
Vehicular traffic has become an important research area because of its specific features and applications as road safety and efficient traffic management. Vehicles should be carry enough of communication systems, onboard computing facilities, storage, and increased geographical monitoring. Hence, several technologies have been deployed to promote Vehicular traffic management. Since this work, Ant Colony Optimization (ACO) algorithm that's based on the apache Spark is in parallel to settle the (TSP) Traveling Salesman Problem. To achieve the parallelization of the phase of solution construction in ant colony optimization, a class of ants was encapsulated to a resilient distributed dataset and the corresponding transformation operators were given. The comparison results between MapReduce based ant colony algorithm and the proposed algorithm under the same experimental environment show that the algorithm proposed notably enhance the optimization speed at least ten times than the MapReduce one.
{"title":"Efficient spark-based framework for solving the traveling salesman problem using a distributed swarm intelligence method","authors":"Yassine Karouani, Ziyati Elhoussaine","doi":"10.1109/ISACV.2018.8354075","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354075","url":null,"abstract":"Vehicular traffic has become an important research area because of its specific features and applications as road safety and efficient traffic management. Vehicles should be carry enough of communication systems, onboard computing facilities, storage, and increased geographical monitoring. Hence, several technologies have been deployed to promote Vehicular traffic management. Since this work, Ant Colony Optimization (ACO) algorithm that's based on the apache Spark is in parallel to settle the (TSP) Traveling Salesman Problem. To achieve the parallelization of the phase of solution construction in ant colony optimization, a class of ants was encapsulated to a resilient distributed dataset and the corresponding transformation operators were given. The comparison results between MapReduce based ant colony algorithm and the proposed algorithm under the same experimental environment show that the algorithm proposed notably enhance the optimization speed at least ten times than the MapReduce one.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131785299","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354061
Charqi Mohammed, Tissir El Houssaine, Ouahi Mohamed, Chaibi Noureddine
In this paper we focus on robust stability for uncertain discrete-time switched Systems with Time-varying Delay and linear fractional perturbations for arbitrary switching law. Firstly, a new matrix inequality considering uncertainties is introduced and proved. By means of it, new sufficient conditions of asymptotic stability for nominal switched system are proposed by using switched Lyapunov function. The conditions are dependent on the minimum and maximum delay bounds and are established in a form of a set of strict linear matrix inequalities (LMIs). Furthermore, slack variables are introduced for more relaxation. Finally, some numerical examples are provided to demonstrate the effectiveness of the proposed approach and to compare the obtained results with the existing literature ones.
{"title":"Robust stability of uncertain discrete-time switched systems with time-varying delay","authors":"Charqi Mohammed, Tissir El Houssaine, Ouahi Mohamed, Chaibi Noureddine","doi":"10.1109/ISACV.2018.8354061","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354061","url":null,"abstract":"In this paper we focus on robust stability for uncertain discrete-time switched Systems with Time-varying Delay and linear fractional perturbations for arbitrary switching law. Firstly, a new matrix inequality considering uncertainties is introduced and proved. By means of it, new sufficient conditions of asymptotic stability for nominal switched system are proposed by using switched Lyapunov function. The conditions are dependent on the minimum and maximum delay bounds and are established in a form of a set of strict linear matrix inequalities (LMIs). Furthermore, slack variables are introduced for more relaxation. Finally, some numerical examples are provided to demonstrate the effectiveness of the proposed approach and to compare the obtained results with the existing literature ones.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133130158","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354043
K. Sellamy, Y. Fakhri, S. Boulaknadel, A. Moumen, K. Hafed, H. Jamil, Y. Lakhrissi
View the large amount of data presented in the web pages, there is a great focus of different organizations and companies, to gather this information to use them in their best interest. This is achieved through Web mining which uses the techniques and algorithms of Data Mining to extract information and knowledge directly from the Web. The Web data mining is not only focused on the achievement of commercial information, but it is also used by various organization to make the good predictions and decisions in a different areas. The present paper deals with primary discussion of web mining, it focuses on a short presentation of web data mining its techniques, tools and applications. Then, we will propose an approach for the cross-analysis between the skills acquired in university training and the skills sought by employers in Morocco.
{"title":"Web mining techniques and applications: Literature review and a proposal approach to improve performance of employment for young graduate in Morocco","authors":"K. Sellamy, Y. Fakhri, S. Boulaknadel, A. Moumen, K. Hafed, H. Jamil, Y. Lakhrissi","doi":"10.1109/ISACV.2018.8354043","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354043","url":null,"abstract":"View the large amount of data presented in the web pages, there is a great focus of different organizations and companies, to gather this information to use them in their best interest. This is achieved through Web mining which uses the techniques and algorithms of Data Mining to extract information and knowledge directly from the Web. The Web data mining is not only focused on the achievement of commercial information, but it is also used by various organization to make the good predictions and decisions in a different areas. The present paper deals with primary discussion of web mining, it focuses on a short presentation of web data mining its techniques, tools and applications. Then, we will propose an approach for the cross-analysis between the skills acquired in university training and the skills sought by employers in Morocco.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133387958","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354059
H. Amakdouf, A. Zouhri, M. El Mallahi, A. Tahiri, H. Qjidaa
The discrete orthogonal moments such as 3D Krawtchouk moments are effective for 3D object recognition. The translation scaling and rotation invariants of 3D Krawtchouk moments are attained either by normalizing the 3D object or with using a combination of the corresponding invariants of 3D geometric moments. However, the extraction of these moments is not founded on these polynomial. In this work, we suggest a new approach to extract the translation scaling and rotation invariants of 3D Krawtchouk moments directly from these polynomials. The performance of the suggested approach is tested using 3D object. Numerical simulations show that the 3D Krawtchouk moments are invariant under 3D translation scaling and rotation. Moreover, the rapidity of the suggested approach is faster than traditional methods.
{"title":"Translation Scaling and rotation invariants of 3D Krawtchouk moments","authors":"H. Amakdouf, A. Zouhri, M. El Mallahi, A. Tahiri, H. Qjidaa","doi":"10.1109/ISACV.2018.8354059","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354059","url":null,"abstract":"The discrete orthogonal moments such as 3D Krawtchouk moments are effective for 3D object recognition. The translation scaling and rotation invariants of 3D Krawtchouk moments are attained either by normalizing the 3D object or with using a combination of the corresponding invariants of 3D geometric moments. However, the extraction of these moments is not founded on these polynomial. In this work, we suggest a new approach to extract the translation scaling and rotation invariants of 3D Krawtchouk moments directly from these polynomials. The performance of the suggested approach is tested using 3D object. Numerical simulations show that the 3D Krawtchouk moments are invariant under 3D translation scaling and rotation. Moreover, the rapidity of the suggested approach is faster than traditional methods.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124516209","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354020
Meriem Adraoui, A. Retbi, M. K. Idrissi, S. Bennani
The purpose of this study is to detect at-risk students in online discussion forums in the platform Moodle. In this context, this paper presents a simulation study with a large database centralized on 4000 learners and 117988 interactions to evaluate students. To achieve our goal, we are used Gephi as a social network learning analytics tool to visualize the learners social network graphs and to implement three algorithms of layout and clustering to identify the learning community in order to predict the students' status (At-risk or safe). Finally, we discussed the result of each algorithm to improve the best one.
{"title":"Network visualization algorithms to evaluate students in online discussion forums: A simulation study","authors":"Meriem Adraoui, A. Retbi, M. K. Idrissi, S. Bennani","doi":"10.1109/ISACV.2018.8354020","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354020","url":null,"abstract":"The purpose of this study is to detect at-risk students in online discussion forums in the platform Moodle. In this context, this paper presents a simulation study with a large database centralized on 4000 learners and 117988 interactions to evaluate students. To achieve our goal, we are used Gephi as a social network learning analytics tool to visualize the learners social network graphs and to implement three algorithms of layout and clustering to identify the learning community in order to predict the students' status (At-risk or safe). Finally, we discussed the result of each algorithm to improve the best one.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129819961","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354057
Zineb Lamghari, M. Radgui, R. Saidi, M. D. Rahmani
Improving business processes and maintaining acceptable levels of performance are main factors in the success of any organization. Related to BPM (Business Process Management) [1] approaches, a variety of methodologies and techniques are available. These approaches include business process improvement methodologies (BPIM) [2] and process mining [3]. Actually, with BPM life cycle a continuous methodology of improvement business processes is defined, starting by the design phase and ending with the optimize phase. In this paper, we present a new vision BPM life cycle whose content differs from the classical one [4]. On each phase, we define a set of improvement indicators. These indicators recast business processes for best optimization results.
{"title":"A set of indicators for BPM life cycle improvement","authors":"Zineb Lamghari, M. Radgui, R. Saidi, M. D. Rahmani","doi":"10.1109/ISACV.2018.8354057","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354057","url":null,"abstract":"Improving business processes and maintaining acceptable levels of performance are main factors in the success of any organization. Related to BPM (Business Process Management) [1] approaches, a variety of methodologies and techniques are available. These approaches include business process improvement methodologies (BPIM) [2] and process mining [3]. Actually, with BPM life cycle a continuous methodology of improvement business processes is defined, starting by the design phase and ending with the optimize phase. In this paper, we present a new vision BPM life cycle whose content differs from the classical one [4]. On each phase, we define a set of improvement indicators. These indicators recast business processes for best optimization results.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130938655","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354084
K. Sehairi, F. Chouireb, J. Meunier
This paper presents an intelligent video-based fall detection system. First, the silhouette of a person is extracted using a background subtraction technique, then a set of features is measured to define if a fall happened, for that a new technique is presented to estimate the head position, and a finite state machine (FSM) is used in the aim to compute the vertical velocity of the head. This algorithm is tested on the L2ei dataset where more than 2700 frames have been labelled in order to train three different classifiers. The results show that our system can predict the correct class with an accuracy that can reach up to 99.61% with a maximum global error of 1.5%.
{"title":"Elderly fall detection system based on multiple shape features and motion analysis","authors":"K. Sehairi, F. Chouireb, J. Meunier","doi":"10.1109/ISACV.2018.8354084","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354084","url":null,"abstract":"This paper presents an intelligent video-based fall detection system. First, the silhouette of a person is extracted using a background subtraction technique, then a set of features is measured to define if a fall happened, for that a new technique is presented to estimate the head position, and a finite state machine (FSM) is used in the aim to compute the vertical velocity of the head. This algorithm is tested on the L2ei dataset where more than 2700 frames have been labelled in order to train three different classifiers. The results show that our system can predict the correct class with an accuracy that can reach up to 99.61% with a maximum global error of 1.5%.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126250512","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354072
Abderrazak Chahi, Issam El Khadiri, Y. El merabet, Y. Ruichek, R. Touahni
Feature engineering is a key factor of machine learning applications. It is a fundamental process in writer identification of handwriting, which is an active and challenging field of research for many years. We propose a conceptually computationally efficient, yet simple and fast local descriptor referred to as Block Wise Local Binary Count (BW-LBC) for offline text-independent writer identification of handwritten documents. Proposed BW-LBC operator, which characterizes the writing style of each writer, is applied to a set of connected components extracted and cropped from scanned handwriting samples (documents or set of words/text lines) where each labeled component is seen as a texture image. The feature vectors computed from the components in all the writing samples are then fed to the 1NN (Nearest Neighbor) classifier to identify the writer of the query documents. Simulated experiments are performed on three challenging and publicly available handwritten databases (IFN/ENIT, AHTID/MW, and CVL) containing handwritten texts in Arabic and English languages, respectively. Experimental results show that our proposed system combined with BW-LBC descriptor demonstrate superior performance on the Arabic script and competitive performance on the English one against the old and recent writer identification systems of the state-of-the-art.
{"title":"Effective feature descriptor-based new framework for off-line text-independent writer identification","authors":"Abderrazak Chahi, Issam El Khadiri, Y. El merabet, Y. Ruichek, R. Touahni","doi":"10.1109/ISACV.2018.8354072","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354072","url":null,"abstract":"Feature engineering is a key factor of machine learning applications. It is a fundamental process in writer identification of handwriting, which is an active and challenging field of research for many years. We propose a conceptually computationally efficient, yet simple and fast local descriptor referred to as Block Wise Local Binary Count (BW-LBC) for offline text-independent writer identification of handwritten documents. Proposed BW-LBC operator, which characterizes the writing style of each writer, is applied to a set of connected components extracted and cropped from scanned handwriting samples (documents or set of words/text lines) where each labeled component is seen as a texture image. The feature vectors computed from the components in all the writing samples are then fed to the 1NN (Nearest Neighbor) classifier to identify the writer of the query documents. Simulated experiments are performed on three challenging and publicly available handwritten databases (IFN/ENIT, AHTID/MW, and CVL) containing handwritten texts in Arabic and English languages, respectively. Experimental results show that our proposed system combined with BW-LBC descriptor demonstrate superior performance on the Arabic script and competitive performance on the English one against the old and recent writer identification systems of the state-of-the-art.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130444899","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}
Pub Date : 2018-04-01DOI: 10.1109/ISACV.2018.8354009
Nora Mouhib, Slimane Bah, A. Berrado
IT systems are often designed without a deep understanding of the organization business, which they are intended to support. This leads to the automation of processes but does not meet user requirements. Moreover, software projects are often broken down into simple parts to facilitate the development process. Regrettably, throughout the integration phase, the sum of the parts does not equal the whole. The Viable System Model (VSM) is a useful framework to overcome these common difficulties. It is a well-known and widely used thinking tool for managers when working with organizations as viable systems. In this paper, we will highlight its role in understanding the organization complexity and designing an integrated information system.
{"title":"The viable system model driven the organization and the information system design","authors":"Nora Mouhib, Slimane Bah, A. Berrado","doi":"10.1109/ISACV.2018.8354009","DOIUrl":"https://doi.org/10.1109/ISACV.2018.8354009","url":null,"abstract":"IT systems are often designed without a deep understanding of the organization business, which they are intended to support. This leads to the automation of processes but does not meet user requirements. Moreover, software projects are often broken down into simple parts to facilitate the development process. Regrettably, throughout the integration phase, the sum of the parts does not equal the whole. The Viable System Model (VSM) is a useful framework to overcome these common difficulties. It is a well-known and widely used thinking tool for managers when working with organizations as viable systems. In this paper, we will highlight its role in understanding the organization complexity and designing an integrated information system.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"43 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114033465","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：