M. Manikandan, K. Ratnavelu, P. Balasubramaniam, S. Ong
This paper deals with the synchronization problem of bidirectional associative memory (BAM) Cohen-Grossberg fuzzy cellular neural networks (CGFCNNs) with discrete time-varying and unbounded distributed delays. Some sufficient conditions are obtained to guarantee the robust synchronizationof BAM CGFCNNs with discrete time-varying and unbounded distributed delays subjected to parametric uncertainty by using Lyapunov-Krasovskii (LK) functional and Linear matrix inequality (LMI) approach.Sufficient criteria ensure that the error dynamics of considered system is globally asymptotically stable. Finally, numerical examples with simulations are given to show the efficacy of the derived results.
{"title":"Synchronization of BAM Cohen--Grossberg FCNNs with mixed time delays","authors":"M. Manikandan, K. Ratnavelu, P. Balasubramaniam, S. Ong","doi":"10.22111/IJFS.2021.5921","DOIUrl":"https://doi.org/10.22111/IJFS.2021.5921","url":null,"abstract":"This paper deals with the synchronization problem of bidirectional associative memory (BAM) Cohen-Grossberg fuzzy cellular neural networks (CGFCNNs) with discrete time-varying and unbounded distributed delays. Some sufficient conditions are obtained to guarantee the robust synchronizationof BAM CGFCNNs with discrete time-varying and unbounded distributed delays subjected to parametric uncertainty by using Lyapunov-Krasovskii (LK) functional and Linear matrix inequality (LMI) approach.Sufficient criteria ensure that the error dynamics of considered system is globally asymptotically stable. Finally, numerical examples with simulations are given to show the efficacy of the derived results.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90470643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The notion of consistency is used to estimate the quality of preference knowledge and its stability for reliable evaluation of decision alternatives. It is well-known that a set of strict consistency conditions are used to keep the rationality of preference intensities between compared elements. These requirements are not achievable in the real situations when decision maker has limited rationality and partially reliable preferences. In this study, we propose an approach to deriving consistency-driven preference degrees for such kind of situations. A preference degree is described by a Z-number to reflect imprecision and partial reliability of preference knowledge. An optimization problem with Z-number valued variables is used to formulate design of consistent preferences. A real-world decision making problem is considered to illustrate application of the proposed method and conduct comparison with an existing technique.
{"title":"(2007-6020) A consistency-driven approach to construction of Z-number-valued pairwise comparison matrices","authors":"R. Aliev, B. Guirimov, O. Huseynov, R. Aliyev","doi":"10.22111/IJFS.2021.6028","DOIUrl":"https://doi.org/10.22111/IJFS.2021.6028","url":null,"abstract":"The notion of consistency is used to estimate the quality of preference knowledge and its stability for reliable evaluation of decision alternatives. It is well-known that a set of strict consistency conditions are used to keep the rationality of preference intensities between compared elements. These requirements are not achievable in the real situations when decision maker has limited rationality and partially reliable preferences. In this study, we propose an approach to deriving consistency-driven preference degrees for such kind of situations. A preference degree is described by a Z-number to reflect imprecision and partial reliability of preference knowledge. An optimization problem with Z-number valued variables is used to formulate design of consistent preferences. A real-world decision making problem is considered to illustrate application of the proposed method and conduct comparison with an existing technique.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74759919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a new fuzzy multi-objective multi-product pipeline scheduling problem is introduced. The systemconsists of a single refinery, a unique distribution center, and a multi-product pipeline. Restrictions such as batchsizing, discharging rate, forbidden sequences, batch volumetric, etc. are considered. Due to the uncertain nature of real-world problems, some parameters of the system are considered as fuzzy values. Tardiness and earliness penalties are considered with a time dependent non-linear function. The basic aim of this scheduling problem is to achieve the optimal sequence for pumping batches of oil products to maximize the financial benefit and simultaneously sacrifice the customers with on-time delivery as a multi-objective problem. To tackle this problem, a two-stage methodology is proposed. In the first stage, the fuzzy formulation is converted to its equivalent crisp form by a credibility-based chance-constrained programming approach. In the second stage, the multi-objective crisp formulation is solved by some well-known approaches in the literature. Some test problems are generated and solved by the proposed approaches and the obtained Pareto-optimal solutions are analyzed and compared using some distance-based comparison metrics.
{"title":"(2004-5799) An interactive fuzzy programming approach for a new multi-objective multi-product oil pipeline scheduling problem","authors":"F. K. Goudarzi, H. Maleki, S. Niroomand","doi":"10.22111/IJFS.2021.5989","DOIUrl":"https://doi.org/10.22111/IJFS.2021.5989","url":null,"abstract":"In this paper, a new fuzzy multi-objective multi-product pipeline scheduling problem is introduced. The systemconsists of a single refinery, a unique distribution center, and a multi-product pipeline. Restrictions such as batchsizing, discharging rate, forbidden sequences, batch volumetric, etc. are considered. Due to the uncertain nature of real-world problems, some parameters of the system are considered as fuzzy values. Tardiness and earliness penalties are considered with a time dependent non-linear function. The basic aim of this scheduling problem is to achieve the optimal sequence for pumping batches of oil products to maximize the financial benefit and simultaneously sacrifice the customers with on-time delivery as a multi-objective problem. To tackle this problem, a two-stage methodology is proposed. In the first stage, the fuzzy formulation is converted to its equivalent crisp form by a credibility-based chance-constrained programming approach. In the second stage, the multi-objective crisp formulation is solved by some well-known approaches in the literature. Some test problems are generated and solved by the proposed approaches and the obtained Pareto-optimal solutions are analyzed and compared using some distance-based comparison metrics.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78842708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, an improved Type2-PCM clustering algorithm based on improved adaptive particle swarm optimization called Type2-PCM-IAPSO is proposed. Firstly, a new clustering algorithm called Type2-PCM is proposed. The Type2-PCM algorithm can solve the problems encountered by fuzzy c-means algorithm (FCM), Gustafson-Kessel algorithm (G-K), possibilistic c-means algorithm (PCM) and NPCM (sensitivity to noise or aberrant points and local minimal sensitivity). . . etc. Secondly, we combined our Type2-PCM algorithm with the improved adaptive particle swarm optimization algorithm (IAPSO) to ensure proper convergence to a local minimum of the objective function. The effectiveness of the two proposed algorithms Type2-PCM and Type2-PCM-IAPSO was tested on a system described by a different equation, Box-Jenkins gas furnace, dryer system and the convection system. The validation tests used showed good performance of these algorithms. However, their average square error test (MSE) shows a better behaviour of the Type2-PCM-IAPSO algorithm compared to the FCM, G-K, PCM, FCM-PSO, Type2-PCM-PSO, RKPFCM and RKPFCM-PSO algorithms.
{"title":"(2004-5811) Improved fuzzy clustering algorithm using adaptive particle swarm optimization for nonlinear system modeling and identification","authors":"L. Houcine, Mohamed Bouzbida, A. Chaari","doi":"10.22111/IJFS.2021.5987","DOIUrl":"https://doi.org/10.22111/IJFS.2021.5987","url":null,"abstract":"In this paper, an improved Type2-PCM clustering algorithm based on improved adaptive particle swarm optimization called Type2-PCM-IAPSO is proposed. Firstly, a new clustering algorithm called Type2-PCM is proposed. The Type2-PCM algorithm can solve the problems encountered by fuzzy c-means algorithm (FCM), Gustafson-Kessel algorithm (G-K), possibilistic c-means algorithm (PCM) and NPCM (sensitivity to noise or aberrant points and local minimal sensitivity). . . etc. Secondly, we combined our Type2-PCM algorithm with the improved adaptive particle swarm optimization algorithm (IAPSO) to ensure proper convergence to a local minimum of the objective function. The effectiveness of the two proposed algorithms Type2-PCM and Type2-PCM-IAPSO was tested on a system described by a different equation, Box-Jenkins gas furnace, dryer system and the convection system. The validation tests used showed good performance of these algorithms. However, their average square error test (MSE) shows a better behaviour of the Type2-PCM-IAPSO algorithm compared to the FCM, G-K, PCM, FCM-PSO, Type2-PCM-PSO, RKPFCM and RKPFCM-PSO algorithms.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90860050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-03DOI: 10.22111/ijfs.2020.31572.5443
D. Mahla, S. Agarwal
Data Envelopment Analysis (DEA) is a multi-criteria technique based on linear programming to deal with many real-life problems, mostly in nonprofit organizations. The slacks-based measure (SBM) model is one of the DEA model used to assess the relative efficiencies of decision-making units (DMUs). The SBM DEA model directly used input slacks and output slacks to determine the relative efficiency of DMUs. In order to deal with qualitative or uncertain data, a fuzzy SBM DEA model is used to assess the performance of DMUs in this study. The credibility measure approach, transform the fuzzy SBM DEA model into a crisp linear programming model at different credibility levels is used. The results came from the fuzzy DEA model are more rational to the real-world situation than the conventional DEA model. In the end, the data of Indian oil refineries is collected, and the efficiency behavior of the companies obtained by applying the proposed model for its numerical illustration.
{"title":"A credibility approach on fuzzy slacks based measure (SBM) DEA model","authors":"D. Mahla, S. Agarwal","doi":"10.22111/ijfs.2020.31572.5443","DOIUrl":"https://doi.org/10.22111/ijfs.2020.31572.5443","url":null,"abstract":"Data Envelopment Analysis (DEA) is a multi-criteria technique based on linear programming to deal with many real-life problems, mostly in nonprofit organizations. The slacks-based measure (SBM) model is one of the DEA model used to assess the relative efficiencies of decision-making units (DMUs). The SBM DEA model directly used input slacks and output slacks to determine the relative efficiency of DMUs. In order to deal with qualitative or uncertain data, a fuzzy SBM DEA model is used to assess the performance of DMUs in this study. The credibility measure approach, transform the fuzzy SBM DEA model into a crisp linear programming model at different credibility levels is used. The results came from the fuzzy DEA model are more rational to the real-world situation than the conventional DEA model. In the end, the data of Indian oil refineries is collected, and the efficiency behavior of the companies obtained by applying the proposed model for its numerical illustration.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85562916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fuzzy closure operators play a significant role in fuzzy order theory. This paper aims to further enrich and improve the study of fuzzy closure operators. Based on the work of Belohlavek and Yao, we shall continue to study the relative properties of fuzzy closure operators. First, we shall consider the extensions of $L$-subsets via fuzzy closure operators. Then we give an application of fuzzy closure operators, that is, by fuzzy closure operators we shall prove that the category CFPos of complete fuzzy posets and their fuzzy-join preserving maps is a reflective full subcategory of FPos, where FPos denotes the category of fuzzy posets and their fuzzy-existing-join preserving maps.
{"title":"Fuzzy closure operators and their applications","authors":"S. W. Han, R. R. Wang","doi":"10.22111/IJFS.2021.5873","DOIUrl":"https://doi.org/10.22111/IJFS.2021.5873","url":null,"abstract":"Fuzzy closure operators play a significant role in fuzzy order theory. This paper aims to further enrich and improve the study of fuzzy closure operators. Based on the work of Belohlavek and Yao, we shall continue to study the relative properties of fuzzy closure operators. First, we shall consider the extensions of $L$-subsets via fuzzy closure operators. Then we give an application of fuzzy closure operators, that is, by fuzzy closure operators we shall prove that the category CFPos of complete fuzzy posets and their fuzzy-join preserving maps is a reflective full subcategory of FPos, where FPos denotes the category of fuzzy posets and their fuzzy-existing-join preserving maps.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73070522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Aghamohagheghi, S. M. Hashemi, R. Tavakkoli-Moghaddam
This paper introduces a new decision support framework for transport projects appraisal, which is based on the multi-criteria decision analysis (MCDA) and the cost-benefit analysis (CBA) to address both monetary and non-monetary characteristics of the problem at the same time. Substantial inaccuracies are present while obtaining non-monetary and monetary inputs to the MCDA and the CBA, respectively. To provide the MCDA part of the framework with uncertainty, an interval-valued Pythagorean fuzzy set (IVPFS) is used as an attractive uncertain modeling tool. Additionally, a new multi-attribute group decision-making (MAGDM) method with partially known attribute weights and unknown expert weights under the IVPFS environment is proposed to find the best sustainable transport project from the non-monetary criteria point of view. Furthermore, a novel uncertainty modeling tool, namely an interval-valued Pythagorean trapezoidal fuzzy set, is introduced to address ill-known quantities and inaccuracies that exist in the estimation of monetary impacts. Finally, this framework is used to handle a real case study of a complex decision process of finding the best transport project to fund several candidate projects. This approach has made it possible to handle the decision process from economic, social, environmental points of view at the same time. The result of this case study shows that the decision-making framework can be used as a valuable decision support tool. Moreover, it is shown that the presented framework can be applied to effectively support appraisals of transport projects.
{"title":"An advanced decision support framework to assess sustainable transport projects using a new uncertainty modeling tool: Interval-valued Pythagorean trapezoidal fuzzy numbers","authors":"M. Aghamohagheghi, S. M. Hashemi, R. Tavakkoli-Moghaddam","doi":"10.22111/IJFS.2021.5871","DOIUrl":"https://doi.org/10.22111/IJFS.2021.5871","url":null,"abstract":"This paper introduces a new decision support framework for transport projects appraisal, which is based on the multi-criteria decision analysis (MCDA) and the cost-benefit analysis (CBA) to address both monetary and non-monetary characteristics of the problem at the same time. Substantial inaccuracies are present while obtaining non-monetary and monetary inputs to the MCDA and the CBA, respectively. To provide the MCDA part of the framework with uncertainty, an interval-valued Pythagorean fuzzy set (IVPFS) is used as an attractive uncertain modeling tool. Additionally, a new multi-attribute group decision-making (MAGDM) method with partially known attribute weights and unknown expert weights under the IVPFS environment is proposed to find the best sustainable transport project from the non-monetary criteria point of view. Furthermore, a novel uncertainty modeling tool, namely an interval-valued Pythagorean trapezoidal fuzzy set, is introduced to address ill-known quantities and inaccuracies that exist in the estimation of monetary impacts. Finally, this framework is used to handle a real case study of a complex decision process of finding the best transport project to fund several candidate projects. This approach has made it possible to handle the decision process from economic, social, environmental points of view at the same time. The result of this case study shows that the decision-making framework can be used as a valuable decision support tool. Moreover, it is shown that the presented framework can be applied to effectively support appraisals of transport projects.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80801010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The cross-migrativity has been investigated for families of certain aggregation operators, such as t-norms, t-subnorms and uninorms. In this paper, we aim to study the cross-migrativity property for semi-t-operators, which are generalizations of t-operators by omitting commutativity. Specifically, we give all solutions of the cross-migrativity equation for all possible combinations of semi-t-operators. Moreover, it is shown that if a semi-t-operator F is alpha-cross-migrative over another semi-t-operator G, then G must be a semi-nullnorm except one case. Finally, it is pointed out that the cross-migrativity property between two semi-t-operators is always determined by their underlying operators except a few cases.
{"title":"The cross-migrativity equation with respect to semi-t-operators","authors":"Y. Y. Zhao, F. Qin","doi":"10.22111/IJFS.2021.5869","DOIUrl":"https://doi.org/10.22111/IJFS.2021.5869","url":null,"abstract":"The cross-migrativity has been investigated for families of certain aggregation operators, such as t-norms, t-subnorms and uninorms. In this paper, we aim to study the cross-migrativity property for semi-t-operators, which are generalizations of t-operators by omitting commutativity. Specifically, we give all solutions of the cross-migrativity equation for all possible combinations of semi-t-operators. Moreover, it is shown that if a semi-t-operator F is alpha-cross-migrative over another semi-t-operator G, then G must be a semi-nullnorm except one case. Finally, it is pointed out that the cross-migrativity property between two semi-t-operators is always determined by their underlying operators except a few cases.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91227858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A geometric programming problem subject to bipolar max-product fuzzy relation equation constraints is studied in this paper. Some necessary and sufficient conditions are given for its solution existence. A lower and upper bound on the solution set of its feasible domain is obtained. Some sufficient conditions are proposed to determine some its optimal components without its resolution. A modified branch-and-bound method is extended to solve the problem. Moreover, an efficient algorithm is proposed to solve the problem based on the simplification operations and the modified branch-and-bound method. Its computational complexity is carefully analyzed. Some examples are given to show the importance of the problem and to illustrate the process of the algorithm. Finally, an analytic and comparative study is done to show the efficiency of the simplification procedures.
{"title":"A new algorithm for geometric optimization with a single-term exponent constrained by bipolar fuzzy relation equations","authors":"Samaneh Aliannezhadi, Ali Abbasi Molai","doi":"10.22111/IJFS.2021.5879","DOIUrl":"https://doi.org/10.22111/IJFS.2021.5879","url":null,"abstract":"A geometric programming problem subject to bipolar max-product fuzzy relation equation constraints is studied in this paper. Some necessary and sufficient conditions are given for its solution existence. A lower and upper bound on the solution set of its feasible domain is obtained. Some sufficient conditions are proposed to determine some its optimal components without its resolution. A modified branch-and-bound method is extended to solve the problem. Moreover, an efficient algorithm is proposed to solve the problem based on the simplification operations and the modified branch-and-bound method. Its computational complexity is carefully analyzed. Some examples are given to show the importance of the problem and to illustrate the process of the algorithm. Finally, an analytic and comparative study is done to show the efficiency of the simplification procedures.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76953392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Research in the area of Internet of things (IoT) and cloud computing has gained a considerable attention in today's world of information technology (IT). Data compression and security are increasingly appreciated due to their imperative roles in online data sharing and transfer in multimedia networks. Hence, image compression is focused on reducing data redundancy and saving memory and transmission bandwidth. Because of the increased entropy of coded images, it is difficult to reduce the amount of lossless information after encryption using the existing methods. Accordingly, using the hybrid Huffman coding algorithm, it is possible to guarantee the security and verification of information. Therefore, an efficient compression method is proposed that combines fuzzy logic with Huffman coding. In this method, coding is based on Hoffman code, which is statistically independent and defines fuzzy logic-based weighting functions for the frequency of the existing symbols in data to generate efficient code for compression. Fuzzy logic is then coded to provide a secure information mapping on the information codes. In this proposed system, the key information is coded using the special key of that information and the data is embedded using the data encryption key and data in the receiver are decoded using the same key. Here, different compression techniques are compared with Huffman coding. The simulation is performed under matlab2017b software. The results show that a good compression rate is achieved, there is no significant difference between the decoded and original images and compression ratio in the image is increased to over 40%.
{"title":"Hybrid data compression using fuzzy logic and Huffman coding in secure IOT","authors":"S. Nosratian, M. Moradkhani, M. Tavakoli","doi":"10.22111/IJFS.2021.5875","DOIUrl":"https://doi.org/10.22111/IJFS.2021.5875","url":null,"abstract":"Research in the area of Internet of things (IoT) and cloud computing has gained a considerable attention in today's world of information technology (IT). Data compression and security are increasingly appreciated due to their imperative roles in online data sharing and transfer in multimedia networks. Hence, image compression is focused on reducing data redundancy and saving memory and transmission bandwidth. Because of the increased entropy of coded images, it is difficult to reduce the amount of lossless information after encryption using the existing methods. Accordingly, using the hybrid Huffman coding algorithm, it is possible to guarantee the security and verification of information. Therefore, an efficient compression method is proposed that combines fuzzy logic with Huffman coding. In this method, coding is based on Hoffman code, which is statistically independent and defines fuzzy logic-based weighting functions for the frequency of the existing symbols in data to generate efficient code for compression. Fuzzy logic is then coded to provide a secure information mapping on the information codes. In this proposed system, the key information is coded using the special key of that information and the data is embedded using the data encryption key and data in the receiver are decoded using the same key. Here, different compression techniques are compared with Huffman coding. The simulation is performed under matlab2017b software. The results show that a good compression rate is achieved, there is no significant difference between the decoded and original images and compression ratio in the image is increased to over 40%.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76397957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：