World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering最新文献
Passive design responds to improve indoor thermal comfort and minimize the energy consumption. The present research analyzed the how efficiently passive solar technologies generate heating and cooling and provide the system integration for domestic applications. In addition to this, the aim of this study is to increase the efficiency of solar systems system with integration some innovation and optimization. As a result, outputs of the project might start a new sector to provide environmentally friendly and cheap cooling for domestic use.
{"title":"Passive Solar Techniques to Improve Thermal Comfort and Reduce Energy Consumption of Domestic Use","authors":"Naci Kalkan, I. Dagtekin","doi":"10.5281/ZENODO.1123672","DOIUrl":"https://doi.org/10.5281/ZENODO.1123672","url":null,"abstract":"Passive design responds to improve indoor thermal comfort and minimize the energy consumption. The present research analyzed the how efficiently passive solar technologies generate heating and cooling and provide the system integration for domestic applications. In addition to this, the aim of this study is to increase the efficiency of solar systems system with integration some innovation and optimization. As a result, outputs of the project might start a new sector to provide environmentally friendly and cheap cooling for domestic use.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87686554","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-01-01DOI: 10.17706/IJCCE.2016.5.5.358-366
Chih-Hung Wang, Pei-Jyun Lu
The major concept of certificateless cryptosystem is to remove the certificate in public-key cryptosystem and solve the key escrow drawback in the ID-based scheme. For the privacy protection in the public cloud environment, the proxy re-encryption scheme was developed to allow a semi-trusted proxy to transform a ciphertext under one person’s public key into other ciphertext under another person’s public key without decryption. Nowadays, many related applications of certificateless proxy re-encryption scheme have been proposed. However, most of certificateless proxy re-encryption schemes allow only a single receiver, which means for more receivers, re-transforming the ciphertext multiple times is needed. This paper introduces a novel notion of proxy re-encryption in which the sender can broadcast the re-encrypted ciphertext to a group of receivers through the proxy’s assistance based on certificateless public key cryptography. The proposed scheme has the property of constant-size re-encryption key and ciphertext, and is particularly suitable for the application executing in the enormous cloud networking.
{"title":"Certificateless Broadcast Proxy Re-encryption With Group-Oriented Model","authors":"Chih-Hung Wang, Pei-Jyun Lu","doi":"10.17706/IJCCE.2016.5.5.358-366","DOIUrl":"https://doi.org/10.17706/IJCCE.2016.5.5.358-366","url":null,"abstract":"The major concept of certificateless cryptosystem is to remove the certificate in public-key cryptosystem and solve the key escrow drawback in the ID-based scheme. For the privacy protection in the public cloud environment, the proxy re-encryption scheme was developed to allow a semi-trusted proxy to transform a ciphertext under one person’s public key into other ciphertext under another person’s public key without decryption. Nowadays, many related applications of certificateless proxy re-encryption scheme have been proposed. However, most of certificateless proxy re-encryption schemes allow only a single receiver, which means for more receivers, re-transforming the ciphertext multiple times is needed. This paper introduces a novel notion of proxy re-encryption in which the sender can broadcast the re-encrypted ciphertext to a group of receivers through the proxy’s assistance based on certificateless public key cryptography. The proposed scheme has the property of constant-size re-encryption key and ciphertext, and is particularly suitable for the application executing in the enormous cloud networking.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76162596","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-01-01DOI: 10.17706/ijcce.2016.5.3.206-214
A. Bellaachia, Deema Alathel, Dc Washington, America
Recommender systems have become extremely popular in recent years due to their ability to predict a user’s preference or rating of a certain item by analyzing similar users in the network. Trust-based recommender systems generate these predictions by using an explicitly issued trust between the users. In this paper we propose a recommendation algorithm called Averaged Localized Trust-Based Ant Recommender (ALT-BAR) that follows the methodology applied by Ant Colony Optimization algorithms to increase the accuracy of predictions in recommender systems, especially for cold start users. Cold start users are considered challenging to deal with in any recommender system because of the few ratings they have in their profiles. ALT-BAR reinforces the significance of trust between users, to overcome the lack of ratings, by modifying the way the initial pheromone levels of edges are calculated to reflect each edge’s associated trust level. An appropriate initialization of pheromone in ant algorithms in general can guarantee a proper convergence of the system to the optimal solution. ALT-BAR’s approach allows the ants to expand their search scope in the solution space to find ratings for cold start users while exploiting discovered good solutions for the sake of heavy raters. When compared to other algorithms in the literature, ALT-BAR proved to be extremely successful in enhancing the prediction accuracy and coverage for cold start users while still maintaining fairly good results for heavy raters.
{"title":"Improving the Recommendation Accuracy for Cold Start Users in Trust-Based Recommender Systems","authors":"A. Bellaachia, Deema Alathel, Dc Washington, America","doi":"10.17706/ijcce.2016.5.3.206-214","DOIUrl":"https://doi.org/10.17706/ijcce.2016.5.3.206-214","url":null,"abstract":"Recommender systems have become extremely popular in recent years due to their ability to predict a user’s preference or rating of a certain item by analyzing similar users in the network. Trust-based recommender systems generate these predictions by using an explicitly issued trust between the users. In this paper we propose a recommendation algorithm called Averaged Localized Trust-Based Ant Recommender (ALT-BAR) that follows the methodology applied by Ant Colony Optimization algorithms to increase the accuracy of predictions in recommender systems, especially for cold start users. Cold start users are considered challenging to deal with in any recommender system because of the few ratings they have in their profiles. ALT-BAR reinforces the significance of trust between users, to overcome the lack of ratings, by modifying the way the initial pheromone levels of edges are calculated to reflect each edge’s associated trust level. An appropriate initialization of pheromone in ant algorithms in general can guarantee a proper convergence of the system to the optimal solution. ALT-BAR’s approach allows the ants to expand their search scope in the solution space to find ratings for cold start users while exploiting discovered good solutions for the sake of heavy raters. When compared to other algorithms in the literature, ALT-BAR proved to be extremely successful in enhancing the prediction accuracy and coverage for cold start users while still maintaining fairly good results for heavy raters.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77780944","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-01-01DOI: 10.17706/IJCCE.2016.5.6.441-454
Kevin Benton, L. Camp, T. Kelley, M. Swany
Source IP address spoofing is still a significant problem on today’s Internet. Recent DDoS attacks, which combined source IP spoofing and amplifying UDP services, have resulted in attack traffic volumes exceeding hundreds of gigabits per second. In this work we argue that the ingress packet filtering solutions proposed in BCP 38 more than 13 years ago have failed to solve the issue due to fundamental incentive misalignment. We present an SDN implementation of feasible path reverse path forwarding which tier 2 ISPs could implement using OpenFlow switches at peering points with no impact to the performance of their routers. We show how an SDN solution can handle error cases more gracefully than current reverse path forwarding implementations. We illustrate that this proposal is well-aligned with the economic incentives of the adopting parties and furthermore does not require ubiquitous adoption to create network-wide immunity. We describe our open code implementation on OpenFlow. Finally, we discuss the limitations of this filtering approach.
{"title":"Filtering Source-Spoofed IP Traffic Using Feasible Path Reverse Path Forwarding with SDN","authors":"Kevin Benton, L. Camp, T. Kelley, M. Swany","doi":"10.17706/IJCCE.2016.5.6.441-454","DOIUrl":"https://doi.org/10.17706/IJCCE.2016.5.6.441-454","url":null,"abstract":"Source IP address spoofing is still a significant problem on today’s Internet. Recent DDoS attacks, which combined source IP spoofing and amplifying UDP services, have resulted in attack traffic volumes exceeding hundreds of gigabits per second. In this work we argue that the ingress packet filtering solutions proposed in BCP 38 more than 13 years ago have failed to solve the issue due to fundamental incentive misalignment. We present an SDN implementation of feasible path reverse path forwarding which tier 2 ISPs could implement using OpenFlow switches at peering points with no impact to the performance of their routers. We show how an SDN solution can handle error cases more gracefully than current reverse path forwarding implementations. We illustrate that this proposal is well-aligned with the economic incentives of the adopting parties and furthermore does not require ubiquitous adoption to create network-wide immunity. We describe our open code implementation on OpenFlow. Finally, we discuss the limitations of this filtering approach.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89946868","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-01-01DOI: 10.17706/IJCCE.2016.5.5.302-310
Lei Zhu, Xiaochen Liu, Lu Yu, Xinrong Wu
Communication networks play such a critical role in modern society that any failures in these networks are intolerable. In this study, we focus on the influence of network congestion and build a model to study the dynamics of cascading failures in communication networks. Investigation of the relationship between the initial allocation of efficiency among edges and the damage caused by cascading failures shows that a higher initial efficiency may lead to more severe consequence in case of cascading failures. We also investigate the influence of the size of the router’s buffer. Because the correct buffer size can alleviate network congestion to some extent, it is able to enhance the robustness of the network against cascading failures.
{"title":"Model of Cascading Failures for Communication Networks","authors":"Lei Zhu, Xiaochen Liu, Lu Yu, Xinrong Wu","doi":"10.17706/IJCCE.2016.5.5.302-310","DOIUrl":"https://doi.org/10.17706/IJCCE.2016.5.5.302-310","url":null,"abstract":"Communication networks play such a critical role in modern society that any failures in these networks are intolerable. In this study, we focus on the influence of network congestion and build a model to study the dynamics of cascading failures in communication networks. Investigation of the relationship between the initial allocation of efficiency among edges and the damage caused by cascading failures shows that a higher initial efficiency may lead to more severe consequence in case of cascading failures. We also investigate the influence of the size of the router’s buffer. Because the correct buffer size can alleviate network congestion to some extent, it is able to enhance the robustness of the network against cascading failures.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75461965","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-01-01DOI: 10.17706/IJCCE.2016.5.5.311-320
W. Lim, W. Yeoh
For sequential learning in Radial Basis Function (RBF) Networks, there is a requirement for dynamic selection of threshold because a constant threshold is inadequate to accommodate functions of varying amplitudes. In this paper, a new criterion is defined for the dynamic selection of the Euclidean output deviation threshold. Its effect on the learning process experienced by RBF networks with regard to functions of variable amplitude is shown. This improved network can automatically select a suitable threshold for its own supervised learning depending on the objective parameters set to achieve certain accuracy level of the desired output. This paper also proposes further automation to neuron growing and pruning within Radial Basis Function (RBF) neural networks. The proposed dynamic threshold selection technique has shown significant improvement in achieving stable neuron growth rate in dealing with signal amplitude variation.
{"title":"Dynamic Threshold Selection for Sequential Learning in Radial Basis Function Networks","authors":"W. Lim, W. Yeoh","doi":"10.17706/IJCCE.2016.5.5.311-320","DOIUrl":"https://doi.org/10.17706/IJCCE.2016.5.5.311-320","url":null,"abstract":"For sequential learning in Radial Basis Function (RBF) Networks, there is a requirement for dynamic selection of threshold because a constant threshold is inadequate to accommodate functions of varying amplitudes. In this paper, a new criterion is defined for the dynamic selection of the Euclidean output deviation threshold. Its effect on the learning process experienced by RBF networks with regard to functions of variable amplitude is shown. This improved network can automatically select a suitable threshold for its own supervised learning depending on the objective parameters set to achieve certain accuracy level of the desired output. This paper also proposes further automation to neuron growing and pruning within Radial Basis Function (RBF) neural networks. The proposed dynamic threshold selection technique has shown significant improvement in achieving stable neuron growth rate in dealing with signal amplitude variation.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79036419","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-01-01DOI: 10.17706/ijcce.2016.5.3.215-221
R. Al-Jarrah, M. Al-Jarrah, H. Roth
The aerial robots represent an interested and rich area of research because they are very useful to perform complex tasks such as localization and tracking targets. To develop blimp system that is appropriate in diversity scenarios, an intelligent control with high autonomy degree is required. Therefore, we design blimp robot based on embedded system; then, we present several fuzzy sets models that should deal with autonomous, navigation and visual tracking problems. These models are empirically designed by combining the possibilities distributions theory with fuzzy logic. Thus, this paper addresses the problem of tracking robots in parallel with achieving the cooperative behavior based on computer vision system and artificial intelligent control to improve the efficiency of such system. In addition, considering use of wireless sensor networks for estimation multi-targets locations and the distances between them is presented.
{"title":"WSNs and on-Board Visual Fuzzy Servoing on Blimp Robot for Tracking Purposes","authors":"R. Al-Jarrah, M. Al-Jarrah, H. Roth","doi":"10.17706/ijcce.2016.5.3.215-221","DOIUrl":"https://doi.org/10.17706/ijcce.2016.5.3.215-221","url":null,"abstract":"The aerial robots represent an interested and rich area of research because they are very useful to perform complex tasks such as localization and tracking targets. To develop blimp system that is appropriate in diversity scenarios, an intelligent control with high autonomy degree is required. Therefore, we design blimp robot based on embedded system; then, we present several fuzzy sets models that should deal with autonomous, navigation and visual tracking problems. These models are empirically designed by combining the possibilities distributions theory with fuzzy logic. Thus, this paper addresses the problem of tracking robots in parallel with achieving the cooperative behavior based on computer vision system and artificial intelligent control to improve the efficiency of such system. In addition, considering use of wireless sensor networks for estimation multi-targets locations and the distances between them is presented.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88998873","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-01-01DOI: 10.17706/IJCCE.2016.5.2.130-140
S. Bakhtyar, J. Holmgren, J. Persson
An electronic waybill (e-Waybill) is a service whose purpose is to replace the paper waybill, which is a paper documents that traditionally follows a consignment during transport. An important purp ...
{"title":"Technical requirements of the e-waybill service","authors":"S. Bakhtyar, J. Holmgren, J. Persson","doi":"10.17706/IJCCE.2016.5.2.130-140","DOIUrl":"https://doi.org/10.17706/IJCCE.2016.5.2.130-140","url":null,"abstract":"An electronic waybill (e-Waybill) is a service whose purpose is to replace the paper waybill, which is a paper documents that traditionally follows a consignment during transport. An important purp ...","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85316623","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-01-01DOI: 10.17706/IJCCE.2016.5.5.321-330
Yi-Shan Lin, Chun-Liang Lee, Yaw-Chung Chen
Network applications have been developed quickly during recent years, and communications between these applications involve a large quantity of data transfer through high speed networks. Deep packet inspection (DPI) becomes indispensable to ensure network application-aware security. One of the DPI services is the signature-based network intrusion detection system (NIDS), in which the implementation on software platforms has become a trend due to the advantages of high programmability and low cost. Recently, the graphic processing units (GPU) is commonly used to accelerate the packet processing because of its superior parallel processing power. Since delivering all packets to GPU causes high data transfer latency and consequently restricts the overall performance, our previous study proposed a mechanism, HPMA, to reduce the effect of transfer bottleneck and achieve higher processing speed. In this paper, we introduce an enhancement of HPMA, a capability-based hybrid CPU/GPU pattern matching algorithm (CHPMA). A preliminary experiment shows that the CHPMA not only performs as efficient as the HPMA in most cases, but also obtains higher performance gain than the HPMA under unfavorable conditions.
{"title":"A Capability-Based Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection","authors":"Yi-Shan Lin, Chun-Liang Lee, Yaw-Chung Chen","doi":"10.17706/IJCCE.2016.5.5.321-330","DOIUrl":"https://doi.org/10.17706/IJCCE.2016.5.5.321-330","url":null,"abstract":"Network applications have been developed quickly during recent years, and communications between these applications involve a large quantity of data transfer through high speed networks. Deep packet inspection (DPI) becomes indispensable to ensure network application-aware security. One of the DPI services is the signature-based network intrusion detection system (NIDS), in which the implementation on software platforms has become a trend due to the advantages of high programmability and low cost. Recently, the graphic processing units (GPU) is commonly used to accelerate the packet processing because of its superior parallel processing power. Since delivering all packets to GPU causes high data transfer latency and consequently restricts the overall performance, our previous study proposed a mechanism, HPMA, to reduce the effect of transfer bottleneck and achieve higher processing speed. In this paper, we introduce an enhancement of HPMA, a capability-based hybrid CPU/GPU pattern matching algorithm (CHPMA). A preliminary experiment shows that the CHPMA not only performs as efficient as the HPMA in most cases, but also obtains higher performance gain than the HPMA under unfavorable conditions.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91511072","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-01-01DOI: 10.17706/IJCCE.2016.5.5.341-349
Zheng-Guang Xie, Hong-wei Huang, Xu Cai
Anumberofsparserecoveryapproacheshaveappearedintheliterature based on Orthogonal Matching Pursuit (OMP) algorithms because of its low computationalComplexity. Thismanuscriptintroducesanoveladaptive forward-back greedy approach, called Dual Threshold Matching Pursuit (DTMP), which select atoms based on two appropriate thresholds. During forward atom increasing process, DTMP picks out new candidate atoms based on the forward threshold under Restricted Isometry Constant (RIC) condition. In backward atom decreasing process, DTMP deletes wrong atoms based on the backward threshold according tothe principal of energy concentration. Like forward-backward pursuit (FBP), DTMP does not need the sparsity level in contrast to the Subspace Pursuit (SP) or Compressive Sampling Matching pursuit (CoSa MP) algorithms. Experimental results show that the reconstruction accuracy of DTMP surpasses SP, FBP and other greedy algorithms obviously and its complexity is comparable with those of OMP and SP.
{"title":"Matching Pursuit for Sparse Signal Reconstruction Based on Dual Thresholds","authors":"Zheng-Guang Xie, Hong-wei Huang, Xu Cai","doi":"10.17706/IJCCE.2016.5.5.341-349","DOIUrl":"https://doi.org/10.17706/IJCCE.2016.5.5.341-349","url":null,"abstract":"Anumberofsparserecoveryapproacheshaveappearedintheliterature based on Orthogonal Matching Pursuit (OMP) algorithms because of its low computationalComplexity. Thismanuscriptintroducesanoveladaptive forward-back greedy approach, called Dual Threshold Matching Pursuit (DTMP), which select atoms based on two appropriate thresholds. During forward atom increasing process, DTMP picks out new candidate atoms based on the forward threshold under Restricted Isometry Constant (RIC) condition. In backward atom decreasing process, DTMP deletes wrong atoms based on the backward threshold according tothe principal of energy concentration. Like forward-backward pursuit (FBP), DTMP does not need the sparsity level in contrast to the Subspace Pursuit (SP) or Compressive Sampling Matching pursuit (CoSa MP) algorithms. Experimental results show that the reconstruction accuracy of DTMP surpasses SP, FBP and other greedy algorithms obviously and its complexity is comparable with those of OMP and SP.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88209546","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}
World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：