Pub Date : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963069
Debashis Mishra, Utpal Chandra De, I. Bose, Bishwojyoti Pradhan
Image thresholding is one essential feature of modern digital image processing, which is meant for the segmentation of image into several parts. It helps to understand the image and to detect particular objects from the image. There are various soft computing based image thresholding techniques evolved till date using advance tools such as fuzzy operator, genetic algorithm, swarm optimization etc. In this paper, Fish school search (FSS), a new swarm optimization technique is applied to find the optimized threshold value to segment the image. FSS mimics the fishes searching for food in group, considering an aquarium as search space. The proposed technique described in this paper shows optimized result comparing to traditional image thresholding technique.
图像阈值分割是现代数字图像处理的一个重要特征，它将图像分割成若干部分。它有助于理解图像并从图像中检测特定的物体。迄今为止，已有各种基于软计算的图像阈值处理技术，使用了模糊算子、遗传算法、群体优化等先进工具。本文将鱼群搜索(Fish school search, FSS)作为一种新的群体优化技术来寻找最优的阈值进行图像分割。FSS模拟鱼类在群体中寻找食物，将水族箱视为搜索空间。与传统的图像阈值分割技术相比，本文所提出的方法取得了较好的效果。
{"title":"Fish school search approach to find optimized thresholds in gray-scale image","authors":"Debashis Mishra, Utpal Chandra De, I. Bose, Bishwojyoti Pradhan","doi":"10.1109/ICCCNT.2014.6963069","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963069","url":null,"abstract":"Image thresholding is one essential feature of modern digital image processing, which is meant for the segmentation of image into several parts. It helps to understand the image and to detect particular objects from the image. There are various soft computing based image thresholding techniques evolved till date using advance tools such as fuzzy operator, genetic algorithm, swarm optimization etc. In this paper, Fish school search (FSS), a new swarm optimization technique is applied to find the optimized threshold value to segment the image. FSS mimics the fishes searching for food in group, considering an aquarium as search space. The proposed technique described in this paper shows optimized result comparing to traditional image thresholding technique.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123973110","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963038
Tian Chen, Bingdong Yang, Wei Wang, Birong Hao, Fuji Ren, Jun Liu, Yixin Wang
Under the condition of Built-off Self-test (BOST), a novel test data compression scheme based on position information coding is presented, which is targeting test data and test power consumption. The proposed scheme gets the next test stimuli by reversing some bits of the responses corresponding to the previous test vectors. During the process of bit flip, test power problem should be taken into account; both the shift power and capture power during the test should be limited in the scope of security. For shift power, need to modify the scan chain by adding blocking logic; and the capture power reduction through the test cube filling based on the response. Experimental results justify the efficacy of the proposed method in attaining test-data compression; the average compression ratio is 73.63% on the premise of capture power consumption reduced by 20%.
{"title":"A test data compression scheme based on position information coding","authors":"Tian Chen, Bingdong Yang, Wei Wang, Birong Hao, Fuji Ren, Jun Liu, Yixin Wang","doi":"10.1109/ICCCNT.2014.6963038","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963038","url":null,"abstract":"Under the condition of Built-off Self-test (BOST), a novel test data compression scheme based on position information coding is presented, which is targeting test data and test power consumption. The proposed scheme gets the next test stimuli by reversing some bits of the responses corresponding to the previous test vectors. During the process of bit flip, test power problem should be taken into account; both the shift power and capture power during the test should be limited in the scope of security. For shift power, need to modify the scan chain by adding blocking logic; and the capture power reduction through the test cube filling based on the response. Experimental results justify the efficacy of the proposed method in attaining test-data compression; the average compression ratio is 73.63% on the premise of capture power consumption reduced by 20%.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124707792","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963133
M. Parvin, E. Jafari, Reza Azizi
Wireless sensor networks consist of tiny sensors with some constraints particularly when the energy is concerned. In recent years, owing to their vast applications, sensor networks are devoted a great part of researches aiming at enhancing the network lifetime. Since there are a large number of nodes available in the environment of the network, one important factor reaching this aim will be to activate the minimum number of nodes to provide a secure coverage of the targets under surveillance. By so doing, the energy consumption among the nodes of the network is optimized. In this paper, we have presented a Multi-Armed Bandit Problem-Based Target Coverage Protocol, called MABTC, for Wireless Sensor Networks, which endeavors to recognize nodes which are higher in energy amount yet are more effective in the coverage of the targets of the network and sustain the coverage in a way that the energy consumption of the nodes is balanced and optimized. To assess, the proposed protocol is simulated using NS2 and the results are compared to those of some outstanding methods in the network coverage.
{"title":"A Multi-Armed Bandit Problem-Based Target Coverage Protocol for Wireless Sensor Network","authors":"M. Parvin, E. Jafari, Reza Azizi","doi":"10.1109/ICCCNT.2014.6963133","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963133","url":null,"abstract":"Wireless sensor networks consist of tiny sensors with some constraints particularly when the energy is concerned. In recent years, owing to their vast applications, sensor networks are devoted a great part of researches aiming at enhancing the network lifetime. Since there are a large number of nodes available in the environment of the network, one important factor reaching this aim will be to activate the minimum number of nodes to provide a secure coverage of the targets under surveillance. By so doing, the energy consumption among the nodes of the network is optimized. In this paper, we have presented a Multi-Armed Bandit Problem-Based Target Coverage Protocol, called MABTC, for Wireless Sensor Networks, which endeavors to recognize nodes which are higher in energy amount yet are more effective in the coverage of the targets of the network and sustain the coverage in a way that the energy consumption of the nodes is balanced and optimized. To assess, the proposed protocol is simulated using NS2 and the results are compared to those of some outstanding methods in the network coverage.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128300910","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963036
Dinesh Kumar Karunakaran, N. Mohankumar
Globalization of Integrated Circuits (IC's) in semiconductor industries has made them vulnerable to intentional alterations of the design. These intentional alterations to a design are called Hardware Trojans (HT's). Since many of the designs are outsourced for its fabrication, there is a lot of chance for altering its functionality. It is very important to detect these Trojans as it may raise serious concern about hardware trust, especially in the field of military and security applications. This paper considers the detection of combinational trojans using Gate Level Characterization (GLC) and is based on the measurement of side-channel parameters, especially leakage power. The leakage power for an entire circuit is being calculated for each input vector. The obtained measurements are formulated as linear equations in Linear Programming (LP) and are solved using LP solver.
{"title":"Malicious combinational Hardware Trojan detection by Gate Level Characterization in 90nm technology","authors":"Dinesh Kumar Karunakaran, N. Mohankumar","doi":"10.1109/ICCCNT.2014.6963036","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963036","url":null,"abstract":"Globalization of Integrated Circuits (IC's) in semiconductor industries has made them vulnerable to intentional alterations of the design. These intentional alterations to a design are called Hardware Trojans (HT's). Since many of the designs are outsourced for its fabrication, there is a lot of chance for altering its functionality. It is very important to detect these Trojans as it may raise serious concern about hardware trust, especially in the field of military and security applications. This paper considers the detection of combinational trojans using Gate Level Characterization (GLC) and is based on the measurement of side-channel parameters, especially leakage power. The leakage power for an entire circuit is being calculated for each input vector. The obtained measurements are formulated as linear equations in Linear Programming (LP) and are solved using LP solver.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128403302","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963070
Y. Abouelseoud
Signcryption is a well-known cryptographic primitive that achieves various security goals including confidentiality of communications, source authentication, and integrity of message contents and ensuring non-repudiation. In e-cash systems, customers prefer to spend their e-coins anonymously. Blind signatures have been developed to meet this requirement. In the present paper, two new blind signcryption schemes are proposed in order to combine the functionalities of both primitives in a single logical step. The first one is tailored for traditional public key infrastructures; while the second one is an identity-based scheme. The proposed schemes have been designed with an eye on applications to e-cash systems and thus overcoming shortcomings in earlier attempts in blind signcryption. The two schemes are computationally efficient promoting their use in practical scenarios. The schemes involve three parties. In e-cash scenarios, these are the bank, the e-coin acquirer (customer) and the merchant which deposits the e-coin in his bank account.
{"title":"New blind signcryption schemes with application to E-cash systems","authors":"Y. Abouelseoud","doi":"10.1109/ICCCNT.2014.6963070","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963070","url":null,"abstract":"Signcryption is a well-known cryptographic primitive that achieves various security goals including confidentiality of communications, source authentication, and integrity of message contents and ensuring non-repudiation. In e-cash systems, customers prefer to spend their e-coins anonymously. Blind signatures have been developed to meet this requirement. In the present paper, two new blind signcryption schemes are proposed in order to combine the functionalities of both primitives in a single logical step. The first one is tailored for traditional public key infrastructures; while the second one is an identity-based scheme. The proposed schemes have been designed with an eye on applications to e-cash systems and thus overcoming shortcomings in earlier attempts in blind signcryption. The two schemes are computationally efficient promoting their use in practical scenarios. The schemes involve three parties. In e-cash scenarios, these are the bank, the e-coin acquirer (customer) and the merchant which deposits the e-coin in his bank account.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128466478","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963077
K. Rakesh, S. Sunanda
Security and disaster alert dissemination showcase the key challenges faced by the fishing industry, mainly due to the lack of reliable communication means, and can pose serious threats to the lives of the fishermen. The fishing vessels, equipped with appropriate transceivers, can be considered as MANETs (Mobile Ad-hoc Networks) at sea, and communication can happen in a hop by hop manner. The availability of a visualization framework for such a system enables authorities on the shore to get information on vessel locations, their transmission ranges, and other information, in near real-time, and display them. The visualization framework will aid in selecting the most favorable routing algorithm and will help to track and locate the vessels. The system is designed to enable the users to access it through a web browser, and is developed using the latest web technologies such as HTML5, websockets and Google Maps API V3. The system architecture, implementation details and the results obtained are discussed in this paper.
安全和灾害警报传播显示了渔业面临的主要挑战，主要是由于缺乏可靠的通信手段，并可能对渔民的生命构成严重威胁。配备适当收发器的渔船可以被视为海上的manet(移动自组网)，通信可以以逐跳的方式进行。这种系统的可视化框架的可用性使岸上当局能够获得有关船舶位置、其传输范围和其他信息的信息，并以接近实时的方式显示它们。可视化框架将有助于选择最有利的路由算法，并有助于跟踪和定位船只。该系统旨在使用户能够通过web浏览器访问它，并使用最新的网络技术，如HTML5, websockets和Google Maps API V3开发。本文讨论了系统的体系结构、实现细节和所获得的结果。
{"title":"The development of a visualization framework for fishing vessels at sea","authors":"K. Rakesh, S. Sunanda","doi":"10.1109/ICCCNT.2014.6963077","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963077","url":null,"abstract":"Security and disaster alert dissemination showcase the key challenges faced by the fishing industry, mainly due to the lack of reliable communication means, and can pose serious threats to the lives of the fishermen. The fishing vessels, equipped with appropriate transceivers, can be considered as MANETs (Mobile Ad-hoc Networks) at sea, and communication can happen in a hop by hop manner. The availability of a visualization framework for such a system enables authorities on the shore to get information on vessel locations, their transmission ranges, and other information, in near real-time, and display them. The visualization framework will aid in selecting the most favorable routing algorithm and will help to track and locate the vessels. The system is designed to enable the users to access it through a web browser, and is developed using the latest web technologies such as HTML5, websockets and Google Maps API V3. The system architecture, implementation details and the results obtained are discussed in this paper.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127430449","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963004
Li Jijunnan, Gen Guohua, Liu Lunchun
This paper proposes a fracture surface matching algorithm based on integral invariants. We compute points' volume descriptor on multi-scale, search similar feature points to build matching constraint clusters. Extracting constrained cluster feature and giving a representation, according to convex and concave correspondence of cluster surface, it obtains initial matching cluster pairs. We use spatial geometric consistency constraint's vote method and search the maximum independent set to prune non-matching pairs, so this coarse registration becomes an optimization problem. At last two fragments can be precisely aligned by ICPIF method based on the result of coarse matching. Experimental results show that the algorithm can achieve better matching and reassemble.
{"title":"Virtual merging of fractured fragments based on constraint cluster","authors":"Li Jijunnan, Gen Guohua, Liu Lunchun","doi":"10.1109/ICCCNT.2014.6963004","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963004","url":null,"abstract":"This paper proposes a fracture surface matching algorithm based on integral invariants. We compute points' volume descriptor on multi-scale, search similar feature points to build matching constraint clusters. Extracting constrained cluster feature and giving a representation, according to convex and concave correspondence of cluster surface, it obtains initial matching cluster pairs. We use spatial geometric consistency constraint's vote method and search the maximum independent set to prune non-matching pairs, so this coarse registration becomes an optimization problem. At last two fragments can be precisely aligned by ICPIF method based on the result of coarse matching. Experimental results show that the algorithm can achieve better matching and reassemble.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116266426","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963047
Zhilin Li, Jian Tang, Xuejie Zhu, Caihong Kai
GNU Radio is a free and open-source software development toolkit that provides signal processing blocks to implement software radios. Through its operation and signal processing module, an ordinary PC can implement modern communication process, codec, time and frequency synchronization process in a flexible manner. Because of the high cost of traditional base station, people in low-populated and low-income rural areas cannot have access to the service of mobile communication system. Fortunately, SDR enables the quick and low-cost deployment of a simple GSM basestaion (BS) that provides short messages and voice communications. In this paper, we choose USRP1 as the hardware platform and realize the Um interface between mobile station and base-station of a GSM system by using OpenBTS, GNU Radio and Asterisk. More specifically, we build up a simple GSM base station that can provide automatic user-registration, short message and voice communication service for mobile users. We will introduce the system architecture of our USRP-based GSM base station, present the details of the implementation procedure for the construction. Furthermore, we perform extensive tests on the performance of the built GSM BS in the practical network environment, including the mean time between failure under empty-load and loaded scenario, the mean last time of a voice call, and so on. Test results show that the mean time between failure of our GSM station is 62.5 minutes and 42.5 minutes under empty-load and loaded scenario, respectively.
GNU Radio是一个免费的开源软件开发工具包，它提供了实现软件无线电的信号处理模块。通过其操作和信号处理模块，一台普通PC机可以灵活地实现现代通信过程、编解码、时频同步等过程。由于传统基站成本高，人口少、收入低的农村地区无法享受到移动通信系统的服务。幸运的是，SDR能够快速和低成本地部署提供短消息和语音通信的简单GSM基站(BS)。本文选择USRP1作为硬件平台，利用OpenBTS、GNU Radio和Asterisk实现GSM系统移动站与基站之间的Um接口。具体来说，我们建立了一个简单的GSM基站，可以为移动用户提供自动注册用户、短信和语音通信服务。本文将介绍我国基于usrp的GSM基站的系统架构，给出具体的建设实现步骤。此外，我们还在实际网络环境中对内置GSM BS的性能进行了广泛的测试，包括空负载和负载情况下的平均故障间隔时间、语音呼叫的平均最后一次时间等。测试结果表明，在空载和负载情况下，GSM站的平均故障间隔时间分别为62.5分钟和42.5分钟。
{"title":"Simple GSM base station based on universal software radio peripheral","authors":"Zhilin Li, Jian Tang, Xuejie Zhu, Caihong Kai","doi":"10.1109/ICCCNT.2014.6963047","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963047","url":null,"abstract":"GNU Radio is a free and open-source software development toolkit that provides signal processing blocks to implement software radios. Through its operation and signal processing module, an ordinary PC can implement modern communication process, codec, time and frequency synchronization process in a flexible manner. Because of the high cost of traditional base station, people in low-populated and low-income rural areas cannot have access to the service of mobile communication system. Fortunately, SDR enables the quick and low-cost deployment of a simple GSM basestaion (BS) that provides short messages and voice communications. In this paper, we choose USRP1 as the hardware platform and realize the Um interface between mobile station and base-station of a GSM system by using OpenBTS, GNU Radio and Asterisk. More specifically, we build up a simple GSM base station that can provide automatic user-registration, short message and voice communication service for mobile users. We will introduce the system architecture of our USRP-based GSM base station, present the details of the implementation procedure for the construction. Furthermore, we perform extensive tests on the performance of the built GSM BS in the practical network environment, including the mean time between failure under empty-load and loaded scenario, the mean last time of a voice call, and so on. Test results show that the mean time between failure of our GSM station is 62.5 minutes and 42.5 minutes under empty-load and loaded scenario, respectively.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"40 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122502272","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963018
Zhihong Ren, Zhenyong Wang, Qing Guo
The rateless codes is a forward error correction technology. Because it has arbitrary probability approaching Shannon limit and rateless characters, so it can be able to adapt to the variety of deep space communication features. This paper studied the rateless codes based file transfer protocols of the file transmission delays and investigate its capacity based ACK scheme in deep space communication. The objective of this paper is to demonstrate through experimental results that the existing TCP and CFDP protocols are far from satisfying deep space communication requirements, and the performance of rateless codes based file transfer protocols has obviously advantages in the aspects of reducing the transfer time and proposed a improvement to increasing the link capacity in the stationary erasure channel.
{"title":"Rateless codes based file delivery protocols in deep space communications","authors":"Zhihong Ren, Zhenyong Wang, Qing Guo","doi":"10.1109/ICCCNT.2014.6963018","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963018","url":null,"abstract":"The rateless codes is a forward error correction technology. Because it has arbitrary probability approaching Shannon limit and rateless characters, so it can be able to adapt to the variety of deep space communication features. This paper studied the rateless codes based file transfer protocols of the file transmission delays and investigate its capacity based ACK scheme in deep space communication. The objective of this paper is to demonstrate through experimental results that the existing TCP and CFDP protocols are far from satisfying deep space communication requirements, and the performance of rateless codes based file transfer protocols has obviously advantages in the aspects of reducing the transfer time and proposed a improvement to increasing the link capacity in the stationary erasure channel.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131139823","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963142
V. Murugesh, V. Arthy, V. Agalya
This paper presents a cellular neural network based edge detection of noisy images using Time-Multiplexing CNN Simulator. The experimental results of Time-Multiplexing CNN Simulator are compared with traditional edge detection operators Canny and Sobel. Simulation results show that the proposed simulator is accurately detecting the edge of noisy images.
{"title":"Edge detection of noisy images based on time-multiplexing CNN simulator","authors":"V. Murugesh, V. Arthy, V. Agalya","doi":"10.1109/ICCCNT.2014.6963142","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963142","url":null,"abstract":"This paper presents a cellular neural network based edge detection of noisy images using Time-Multiplexing CNN Simulator. The experimental results of Time-Multiplexing CNN Simulator are compared with traditional edge detection operators Canny and Sobel. Simulation results show that the proposed simulator is accurately detecting the edge of noisy images.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131514988","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
扫码关注我们
求助内容：
应助结果提醒方式：