Pub Date : 2016-11-01DOI: 10.1109/AICCSA.2016.7945820
F. Essa, K. Jambi, A. Fattouh, Hassanin M. Al-Barhamtoshy, Maher Khemakhem, A. Al-Ghamdi
The continuous evolution of new technologies and devices encourage researchers and specialists, in learning and E-learning domain, to take advantage of them in order to enhance learning and E-learning tasks. Due to its flexibility and some other benefits compared to the conventional learning, E-learning gained a lot from the field of learning and training. Cloud computing presents today a very important low-cost infrastructure which can respond to all kinds of software and hardware user needs. In this paper, we propose a federated E-learning cloud system capable of enhancing, substantially, the quality of E-learning by using the mixed reality technology. Actually, our system is intended to be used by any learner including those having some special needs (talent and smart peoples). One of the attractive sides of the proposed system is its capability to use existing courses and learning objects provided on the Internet in order to deliver them to the end-user in a customized manner. The proposed system is intended to be built on a federated cloud infrastructure as a set of ubiquitous services that can be accessed by any user.
{"title":"A fedearted E-learning cloud system based on mixed reality","authors":"F. Essa, K. Jambi, A. Fattouh, Hassanin M. Al-Barhamtoshy, Maher Khemakhem, A. Al-Ghamdi","doi":"10.1109/AICCSA.2016.7945820","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945820","url":null,"abstract":"The continuous evolution of new technologies and devices encourage researchers and specialists, in learning and E-learning domain, to take advantage of them in order to enhance learning and E-learning tasks. Due to its flexibility and some other benefits compared to the conventional learning, E-learning gained a lot from the field of learning and training. Cloud computing presents today a very important low-cost infrastructure which can respond to all kinds of software and hardware user needs. In this paper, we propose a federated E-learning cloud system capable of enhancing, substantially, the quality of E-learning by using the mixed reality technology. Actually, our system is intended to be used by any learner including those having some special needs (talent and smart peoples). One of the attractive sides of the proposed system is its capability to use existing courses and learning objects provided on the Internet in order to deliver them to the end-user in a customized manner. The proposed system is intended to be built on a federated cloud infrastructure as a set of ubiquitous services that can be accessed by any user.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127838725","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945652
I. Lassoued, E. Zagrouba, Y. Chahir
Action recognition is actually considered as one of the most challenging areas in computer vision domain. In this paper, we propose a new approach based on utilization of motion boundaries to generate Motion Stable Shape (MSS) features to describe human actions in videos. In fact, we have considered actions as a set of human poses. Temporal evolution of each human pose is modeled by a set of new MSS feature's. Motion stable shapes of considered poses are defined by specific regions located at the borders of movements. Our modelisation is composed of different steps. First, a volume of optical flow frames highlighting the principal motions in poses is substracted. Then, motion boundaries are computed from the previous optical flow frames. Finally, maximally Stable Extremal Regions (MSER) are applied to motion boundaries frames in order to obtain MSS features. To predict classes of different human actions, the MSS features are combined with a standard bag-of-words representation. To prove the efficiency of our developed model, we have performed a set of experiments on four datasets: Weizmann, KTH, UFC and Hollywood. Obtained experimental results show that the proposed approach significantly outperforms state-of-the-art methods.
{"title":"A new approach of action recognition based on Motion Stable Shape (MSS) features","authors":"I. Lassoued, E. Zagrouba, Y. Chahir","doi":"10.1109/AICCSA.2016.7945652","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945652","url":null,"abstract":"Action recognition is actually considered as one of the most challenging areas in computer vision domain. In this paper, we propose a new approach based on utilization of motion boundaries to generate Motion Stable Shape (MSS) features to describe human actions in videos. In fact, we have considered actions as a set of human poses. Temporal evolution of each human pose is modeled by a set of new MSS feature's. Motion stable shapes of considered poses are defined by specific regions located at the borders of movements. Our modelisation is composed of different steps. First, a volume of optical flow frames highlighting the principal motions in poses is substracted. Then, motion boundaries are computed from the previous optical flow frames. Finally, maximally Stable Extremal Regions (MSER) are applied to motion boundaries frames in order to obtain MSS features. To predict classes of different human actions, the MSS features are combined with a standard bag-of-words representation. To prove the efficiency of our developed model, we have performed a set of experiments on four datasets: Weizmann, KTH, UFC and Hollywood. Obtained experimental results show that the proposed approach significantly outperforms state-of-the-art methods.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115183751","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945694
Asma Hamed, Hella Kaffel Ben Ayed
Mobile applications have access to users' data. This raises a potential privacy concern since users' personal information is collected and revealed to third parties without their consent. In this paper we propose a proactive user-oriented approach towards users' awareness of the privacy risk involved with granting permissions to Android applications. We present a dynamic privacy scoring model that assesses the risk to users' privacy associated to an application which requires a set of permissions. The parameters of this model are the severity and the relative importance of permissions and their interactions. Severity is evaluated according to a standard severity assessment method. The relative importance is estimated according to an analytic method. An experimental study on a set of 64 applications has been conducted. Association rules between permissions have been identified by using a data mining algorithm.
{"title":"Privacy risk assessment and users' awareness for mobile apps permissions","authors":"Asma Hamed, Hella Kaffel Ben Ayed","doi":"10.1109/AICCSA.2016.7945694","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945694","url":null,"abstract":"Mobile applications have access to users' data. This raises a potential privacy concern since users' personal information is collected and revealed to third parties without their consent. In this paper we propose a proactive user-oriented approach towards users' awareness of the privacy risk involved with granting permissions to Android applications. We present a dynamic privacy scoring model that assesses the risk to users' privacy associated to an application which requires a set of permissions. The parameters of this model are the severity and the relative importance of permissions and their interactions. Severity is evaluated according to a standard severity assessment method. The relative importance is estimated according to an analytic method. An experimental study on a set of 64 applications has been conducted. Association rules between permissions have been identified by using a data mining algorithm.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115486992","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945632
Zohra Amekraz, M. Youssef
Spot Instance Market is the most recent advancement in cloud computing business models. It is introduced by Amazon's Elastic Compute Cloud (Amazon EC2) in order to utilize its idle resources more efficiently. The main characteristic of spot instance is its dynamic pricing. The hourly price for a spot instance fluctuates depending on the supply and demand for cloud resources. Users across the globe can bid for a spot instance using an online auction platform. The auction platform determines the current market price, a.k.a. “Spot price” and the users whose bids are above the spot price obtain the instance. Amazon publicizes current spot price but does not disclose how it is determined. The major challenge for the users in this new business model is to predict the spot price before bidding. In this paper, we propose a new spot price forecasting model based on chaos theory. The proposed method makes use of chaos time series analysis to verify the chaotic feature of Amazon spot price and to perform a prediction using Adaptive Neural Fuzzy Inference System (ANFIS). We perform extensive simulation experiments using real spot price traces and show that the proposed method can be a bright merit to predict Amazon spot price.
{"title":"Prediction of Amazon spot price based on chaos theory using ANFIS model","authors":"Zohra Amekraz, M. Youssef","doi":"10.1109/AICCSA.2016.7945632","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945632","url":null,"abstract":"Spot Instance Market is the most recent advancement in cloud computing business models. It is introduced by Amazon's Elastic Compute Cloud (Amazon EC2) in order to utilize its idle resources more efficiently. The main characteristic of spot instance is its dynamic pricing. The hourly price for a spot instance fluctuates depending on the supply and demand for cloud resources. Users across the globe can bid for a spot instance using an online auction platform. The auction platform determines the current market price, a.k.a. “Spot price” and the users whose bids are above the spot price obtain the instance. Amazon publicizes current spot price but does not disclose how it is determined. The major challenge for the users in this new business model is to predict the spot price before bidding. In this paper, we propose a new spot price forecasting model based on chaos theory. The proposed method makes use of chaos time series analysis to verify the chaotic feature of Amazon spot price and to perform a prediction using Adaptive Neural Fuzzy Inference System (ANFIS). We perform extensive simulation experiments using real spot price traces and show that the proposed method can be a bright merit to predict Amazon spot price.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115307765","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945741
Bruno Miguel Nogueira de Souza, J. Facon
Fire detection is a very important task to save human lives and ecological systems. On literature, several fire detection methods use a color mapping function to help on detection process. In this context, we propose a new method based on fire probabilistic color mapping. Using Entropy rules was possible to improve the metric rates. We also numerically evaluate the quality of published fire segmentation techniques and the new one using some segmentation metrics onto two datasets: one for training and test with 226 images and second with 110 images for test. With better performance than compared methods in True Positive (81.33%), Accuracy (89.90%), F-Measure (82.58%) and True Negative rates for not-fire images (98.16%), the results show that our proposed method is more accurate for extracting fire region, indicating the effectiveness contribution of our fire probabilistic color mapping using entropy.
{"title":"A fire color mapping-based segmentation: Fire pixel segmentation approach","authors":"Bruno Miguel Nogueira de Souza, J. Facon","doi":"10.1109/AICCSA.2016.7945741","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945741","url":null,"abstract":"Fire detection is a very important task to save human lives and ecological systems. On literature, several fire detection methods use a color mapping function to help on detection process. In this context, we propose a new method based on fire probabilistic color mapping. Using Entropy rules was possible to improve the metric rates. We also numerically evaluate the quality of published fire segmentation techniques and the new one using some segmentation metrics onto two datasets: one for training and test with 226 images and second with 110 images for test. With better performance than compared methods in True Positive (81.33%), Accuracy (89.90%), F-Measure (82.58%) and True Negative rates for not-fire images (98.16%), the results show that our proposed method is more accurate for extracting fire region, indicating the effectiveness contribution of our fire probabilistic color mapping using entropy.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132055216","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945619
A. Dahbi, S. Jabri, Y. Balouki, T. Gadi
Datamining is the process of extracting interesting information of patterns from large databases. One of the most important datamining task and well-researched is the association rules mining. It aims to find the interesting correlation and relations among sets of items in the transaction databases. One of the main problems related to the discovery of these associations that a decision maker faces is the huge number of association rules extracted. Various measures propose to evaluate the extracted association rules. Currently there is no optimal measure, and there is no measure is better than others. To solve this challenge we propose an approach based on dominance relation aiming to find a good compromise without favoring or excluding any measures by applying a value to each rule which permit to ranking them. The experiments performed on benchmark datasets, show a significant performance of the proposed approach.
{"title":"A new method for ranking association rules with multiple criteria based on dominance relation","authors":"A. Dahbi, S. Jabri, Y. Balouki, T. Gadi","doi":"10.1109/AICCSA.2016.7945619","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945619","url":null,"abstract":"Datamining is the process of extracting interesting information of patterns from large databases. One of the most important datamining task and well-researched is the association rules mining. It aims to find the interesting correlation and relations among sets of items in the transaction databases. One of the main problems related to the discovery of these associations that a decision maker faces is the huge number of association rules extracted. Various measures propose to evaluate the extracted association rules. Currently there is no optimal measure, and there is no measure is better than others. To solve this challenge we propose an approach based on dominance relation aiming to find a good compromise without favoring or excluding any measures by applying a value to each rule which permit to ranking them. The experiments performed on benchmark datasets, show a significant performance of the proposed approach.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132078375","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945640
Mohcine Bouksim, F. R. Zakani, K. Arhid, T. Gadi, M. Aboulfatah
Despite several decades of research into 3D segmentation techniques and a diversity of methods and approaches proposed in the literature, comparing and evaluating the quality of this segmentation method is still a challenging task to achieve. In this paper, an objective evaluation metric suitable for evaluation of 3D segmentation quality and based on the Ochiai index, is proposed to enrich the stat of the art of this kind of method. In the proposed work, we adapt the Ochiai index to be able to compare an automatic segmentation with a ground truth one. The main added value of our method is the ability to treat regular and irregular meshes along with the ability to compare one automatic segmentation with many reference segmentations, these two functionalities, improve the performance of the proposed method and add more reliability to the obtained scores. Several experimental tests and a comparison with some commonly used methods have been made to show the potential and the performance of this approach.
{"title":"Evaluation of 3D mesh segmentation using a weighted version of the Ochiai index","authors":"Mohcine Bouksim, F. R. Zakani, K. Arhid, T. Gadi, M. Aboulfatah","doi":"10.1109/AICCSA.2016.7945640","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945640","url":null,"abstract":"Despite several decades of research into 3D segmentation techniques and a diversity of methods and approaches proposed in the literature, comparing and evaluating the quality of this segmentation method is still a challenging task to achieve. In this paper, an objective evaluation metric suitable for evaluation of 3D segmentation quality and based on the Ochiai index, is proposed to enrich the stat of the art of this kind of method. In the proposed work, we adapt the Ochiai index to be able to compare an automatic segmentation with a ground truth one. The main added value of our method is the ability to treat regular and irregular meshes along with the ability to compare one automatic segmentation with many reference segmentations, these two functionalities, improve the performance of the proposed method and add more reliability to the obtained scores. Several experimental tests and a comparison with some commonly used methods have been made to show the potential and the performance of this approach.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128325855","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945698
Myriam Jaouadi, L. Romdhane
Detecting influential nodes in social networks represents an essential issue for various applications to identify users that may maximize the influence of information in such networks. Several methods have been proposed to solve this problem often khown as influence maximization problem. However, most of them focused on the structure of the network and ignored the semantic aspect. Besides, these methods are parametric, they require the number k of influential elements in a deterministic manner. In this paper, we propose a parameterless algorithm called DIN (Detecting Influential Nodes in social networks) that combines the structure and the semantic aspect. The main idea of our proposal is to detect communities with overlap, modelize the semantic of each community then select influential elements. Experimental results on computer-generated artificial graphs demonstrate that DIN is efficient for identifying influential nodes, compared with two newly known proposals.
检测社交网络中的影响节点是各种应用程序识别可能最大限度地发挥此类网络中信息影响的用户的关键问题。已经提出了几种方法来解决这个问题，通常被称为影响最大化问题。然而，它们大多关注网络的结构，而忽略了语义方面的研究。此外，这些方法是参数化的，它们以确定性的方式要求影响元素的数量k。在本文中，我们提出了一种无参数的算法，称为DIN (detection influence Nodes In social networks)，它结合了结构和语义方面。我们提出的主要思想是检测有重叠的社区，对每个社区的语义建模，然后选择有影响的元素。在计算机生成的人工图上的实验结果表明，与两种新提出的方法相比，DIN在识别影响节点方面是有效的。
{"title":"DIN: An efficient algorithm for detecting influential nodes in social graphs using network structure and attributes","authors":"Myriam Jaouadi, L. Romdhane","doi":"10.1109/AICCSA.2016.7945698","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945698","url":null,"abstract":"Detecting influential nodes in social networks represents an essential issue for various applications to identify users that may maximize the influence of information in such networks. Several methods have been proposed to solve this problem often khown as influence maximization problem. However, most of them focused on the structure of the network and ignored the semantic aspect. Besides, these methods are parametric, they require the number k of influential elements in a deterministic manner. In this paper, we propose a parameterless algorithm called DIN (Detecting Influential Nodes in social networks) that combines the structure and the semantic aspect. The main idea of our proposal is to detect communities with overlap, modelize the semantic of each community then select influential elements. Experimental results on computer-generated artificial graphs demonstrate that DIN is efficient for identifying influential nodes, compared with two newly known proposals.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130641196","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945636
A. Benaini, Achraf Berrajaa, J. Boukachour, M. Oudani
A parallel genetic algorithm (GA) implemented on GPU clusters is proposed to solve the Uncapacitated Single Allocation Hub Location problem. The GA uses binary and integer encoding with genetic operators adapted to this problem. Our GA is improved by initially locating hubs at middle nodes. In our implementation we use the power of the GPU to compute in parallel several initial solutions, varying the number of hubs. The obtained experimental results compared with the best known solutions on all benchmarks. They show that our approach outperforms most well-known heuristics in terms of solution quality and time execution. Also it allowed to solve instances problem unsolved before.
{"title":"Parallel genetic algorithm for the uncapacited single allocation hub location problem on GPU","authors":"A. Benaini, Achraf Berrajaa, J. Boukachour, M. Oudani","doi":"10.1109/AICCSA.2016.7945636","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945636","url":null,"abstract":"A parallel genetic algorithm (GA) implemented on GPU clusters is proposed to solve the Uncapacitated Single Allocation Hub Location problem. The GA uses binary and integer encoding with genetic operators adapted to this problem. Our GA is improved by initially locating hubs at middle nodes. In our implementation we use the power of the GPU to compute in parallel several initial solutions, varying the number of hubs. The obtained experimental results compared with the best known solutions on all benchmarks. They show that our approach outperforms most well-known heuristics in terms of solution quality and time execution. Also it allowed to solve instances problem unsolved before.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127541967","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 : 2016-11-01DOI: 10.1109/AICCSA.2016.7945738
Rania Boujelbene, Y. Jemaa, M. Zribi
We present in this paper a new biorthogonal wavelet transforms using splines performed in a “lifting” manner. Specifically, polynomial splines of different order were used in the lifting constructions. We study the influence of the order of filters using polynomial splines on image compression in order to choose the best wavelet transforms. In addition, a comparative study of these transforms is done firstly with the biorthogonal B9/7 transform which is frequently used in image compression and secondly with the existing B-spline based transforms. We show through experimental results that our proposed wavelet transforms outperform the existing ones in image compression.
{"title":"Toward an optimal B-spline wavelet transform for image compression","authors":"Rania Boujelbene, Y. Jemaa, M. Zribi","doi":"10.1109/AICCSA.2016.7945738","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945738","url":null,"abstract":"We present in this paper a new biorthogonal wavelet transforms using splines performed in a “lifting” manner. Specifically, polynomial splines of different order were used in the lifting constructions. We study the influence of the order of filters using polynomial splines on image compression in order to choose the best wavelet transforms. In addition, a comparative study of these transforms is done firstly with the biorthogonal B9/7 transform which is frequently used in image compression and secondly with the existing B-spline based transforms. We show through experimental results that our proposed wavelet transforms outperform the existing ones in image compression.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126761309","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
扫码关注我们
求助内容：
应助结果提醒方式：