Correlated noise is studied in the context of distributed sensing problems. Previous work has examined the problem of performing distributed estimation in the presence of sensor defects. These defects disrupt sensor measurements but allow the other subsystems of the sensor node to operate normally. Provably optimal and fully distributed estimation algorithms exist for this scenario. A series of computer simulation experiments was conducted to measure how these estimation algorithms are affected by the presence of correlations between various random quantities in the problem setup. Numerical results demonstrate that, in particular network configurations, correlations between sensor defects and communication links can practically alter the performance of distributed estimation algorithms.
{"title":"Performance of Distributed Sensing Algorithms with Correlated Noise and Defective Sensors","authors":"M. Sterling","doi":"10.1145/3158233.3159344","DOIUrl":"https://doi.org/10.1145/3158233.3159344","url":null,"abstract":"Correlated noise is studied in the context of distributed sensing problems. Previous work has examined the problem of performing distributed estimation in the presence of sensor defects. These defects disrupt sensor measurements but allow the other subsystems of the sensor node to operate normally. Provably optimal and fully distributed estimation algorithms exist for this scenario. A series of computer simulation experiments was conducted to measure how these estimation algorithms are affected by the presence of correlations between various random quantities in the problem setup. Numerical results demonstrate that, in particular network configurations, correlations between sensor defects and communication links can practically alter the performance of distributed estimation algorithms.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91397504","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}
Costas arrays are special permutation patterns with various applications in communications and signal processing. Their construction is a difficult combinatorial problem and only a handful of constructions are known. Little is known about those arrays that are not generated by the existing methods. This paper presents an algorithm for the construction of sequences that obey the distinct difference constraints imposed by the Costas array problem. The algorithm is based upon the abstract linear dependence properties of various sets of simple integral vectors and their permutations. The algorithm shows that the entire Costas array problem is most naturally expressed in terms of a simple stack data structure. Simulations of the algorithm are evaluated with a linearity metric on the sequences produced.
{"title":"A Linear Dependence Based Construction Related to Costas Arrays","authors":"M. Sterling","doi":"10.1145/3023924.3023934","DOIUrl":"https://doi.org/10.1145/3023924.3023934","url":null,"abstract":"Costas arrays are special permutation patterns with various applications in communications and signal processing. Their construction is a difficult combinatorial problem and only a handful of constructions are known. Little is known about those arrays that are not generated by the existing methods. This paper presents an algorithm for the construction of sequences that obey the distinct difference constraints imposed by the Costas array problem. The algorithm is based upon the abstract linear dependence properties of various sets of simple integral vectors and their permutations. The algorithm shows that the entire Costas array problem is most naturally expressed in terms of a simple stack data structure. Simulations of the algorithm are evaluated with a linearity metric on the sequences produced.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91397709","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}
Currently, pose variations and irregular movements are the main constraints in the tracking of the non-rigid object. In order to avoid the inaccurate location or the failure of tracking the non-rigid object, a novel tracking method combining particle filter and Mean Shift algorithm is proposed. The motion segmentation is used to correct particle filter's estimation error of the non-rigid target, which improves the efficiency, as well as the robustness of the algorithm against noises. The normalized correlation coefficient is calculated to determine whether to update the template of Mean Shift algorithm. We also test the algorithm on the open popular datasets. Results prove that the algorithm presented in this work shows better results in both aspects of effectiveness and efficiency than the method combining CAMShift algorithm with Kalman filter.
{"title":"Real-time Tracking of Non-rigid Objects","authors":"Sheng Wei, Ren Jianxin","doi":"10.1145/3023924.3023944","DOIUrl":"https://doi.org/10.1145/3023924.3023944","url":null,"abstract":"Currently, pose variations and irregular movements are the main constraints in the tracking of the non-rigid object. In order to avoid the inaccurate location or the failure of tracking the non-rigid object, a novel tracking method combining particle filter and Mean Shift algorithm is proposed. The motion segmentation is used to correct particle filter's estimation error of the non-rigid target, which improves the efficiency, as well as the robustness of the algorithm against noises. The normalized correlation coefficient is calculated to determine whether to update the template of Mean Shift algorithm. We also test the algorithm on the open popular datasets. Results prove that the algorithm presented in this work shows better results in both aspects of effectiveness and efficiency than the method combining CAMShift algorithm with Kalman filter.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91395754","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-02-03DOI: 10.1109/ICICES.2014.7034147
Bhavna Pise, N. Chavhan
In wireless sensor network data gathering is one of the main applications. In data collection energy saving is the main issue as limited battery life of the sensor node is a issue to resolve so to reduce the energy consumption of sensor nodes a concept of mobile node is introduced. In this concept sensor nodes are static where the sink nodes are movable which collects the data from the static sensor node process and transfer the data to base station. For improving the sink mobility, the mobality pattern of the sink should be decided, so that sink can follow the path and gather the data efficiently also in less time. SinkTrail and SinkTrails, two energy efficient proactive data reporting protocols which are used to select the shortest path in case of sink mobility.
{"title":"Strategy of SinkTrail protocol for energy efficient data gathering in wireless sensor network","authors":"Bhavna Pise, N. Chavhan","doi":"10.1109/ICICES.2014.7034147","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034147","url":null,"abstract":"In wireless sensor network data gathering is one of the main applications. In data collection energy saving is the main issue as limited battery life of the sensor node is a issue to resolve so to reduce the energy consumption of sensor nodes a concept of mobile node is introduced. In this concept sensor nodes are static where the sink nodes are movable which collects the data from the static sensor node process and transfer the data to base station. For improving the sink mobility, the mobality pattern of the sink should be decided, so that sink can follow the path and gather the data efficiently also in less time. SinkTrail and SinkTrails, two energy efficient proactive data reporting protocols which are used to select the shortest path in case of sink mobility.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91479995","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-02-01DOI: 10.1109/ICICES.2014.7034046
G. Priya, B. Senthil
In this paper, PTS scheme is combined with Alamouti SFBC for PAPR reduction in MIMO-OFDM systems without side information. In the existing system, the modulated symbols are first multiplied by U different phase sequences resulting in U modified data blocks. This technique is termed as SLM technique. Then the Alamouti SFBC scheme is applied to the resulting block where there is no phase change made in the first antenna block and the data block for the second antenna is multiplied by the phase sequence. Finally IFFT is computed for both the antennas and then PAPR is computed for both the antennas. Then the minimum PAPR is selected and transmitted on both the antennas. Here the number of antennas used in the transmitter side is 2.
{"title":"An efficient scheme for PAPR reduction in Alamouti MIMO-OFDM systems","authors":"G. Priya, B. Senthil","doi":"10.1109/ICICES.2014.7034046","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034046","url":null,"abstract":"In this paper, PTS scheme is combined with Alamouti SFBC for PAPR reduction in MIMO-OFDM systems without side information. In the existing system, the modulated symbols are first multiplied by U different phase sequences resulting in U modified data blocks. This technique is termed as SLM technique. Then the Alamouti SFBC scheme is applied to the resulting block where there is no phase change made in the first antenna block and the data block for the second antenna is multiplied by the phase sequence. Finally IFFT is computed for both the antennas and then PAPR is computed for both the antennas. Then the minimum PAPR is selected and transmitted on both the antennas. Here the number of antennas used in the transmitter side is 2.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75411499","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-02-01DOI: 10.1109/ICICES.2014.7033967
E. Kodhai, P. Bharathi
In a low time to live based wireless network, the node drops all its energy before actually transferring the data given to it. This serves as a drawback where the data is not transferred completely resulting in bandwidth wastage and improper message delivery. To address this problem we formulate new routing techniques by which the data from one part is scheduled to reach the destination based on the computed time to live and available bandwidth. Other than forming a routing tree which may fail when overhearing occurs, split the data and place them into appropriate bandwidths where the bandwidth wastage is minimal. Therefore the process is divided into two steps: Identifying the throughput and the mean bandwidth, initiate the data such that a least amount of bandwidth is wasted. In this method, the routing must be updated every six sees, with respect to the time to live (computed) of the node. The node energy is the tedious process which can be further enhanced by controlling the node between active and sleep state. The problems of link failure, denial of service can be rectified in this process.
{"title":"An optimized bandwidth allocation scheme in relay node for concentrated WSNs","authors":"E. Kodhai, P. Bharathi","doi":"10.1109/ICICES.2014.7033967","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033967","url":null,"abstract":"In a low time to live based wireless network, the node drops all its energy before actually transferring the data given to it. This serves as a drawback where the data is not transferred completely resulting in bandwidth wastage and improper message delivery. To address this problem we formulate new routing techniques by which the data from one part is scheduled to reach the destination based on the computed time to live and available bandwidth. Other than forming a routing tree which may fail when overhearing occurs, split the data and place them into appropriate bandwidths where the bandwidth wastage is minimal. Therefore the process is divided into two steps: Identifying the throughput and the mean bandwidth, initiate the data such that a least amount of bandwidth is wasted. In this method, the routing must be updated every six sees, with respect to the time to live (computed) of the node. The node energy is the tedious process which can be further enhanced by controlling the node between active and sleep state. The problems of link failure, denial of service can be rectified in this process.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75239685","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-02-01DOI: 10.1109/ICICES.2014.7033901
Ranjani V, Sangeetha S K B Asst
In this paper, data transfer is done using the ZigBee networks which is of low implementation cost. In the previous ZigBee network model, the tree topology was used to construct the wireless sensor network for delivering the data that utilized large amount of resources and caused delivery failures due to the node movement. Thus, we first review the `in degree' of nodes in traditional way and address packet loss by calculating capacity of nodes. Next, mobility and coverage problems are presented. Finally, we comment on many issues like complexity in order to simulate more interest in large unexplored areas.
{"title":"Wireless data transmission in ZigBee using indegree and throughput optimization","authors":"Ranjani V, Sangeetha S K B Asst","doi":"10.1109/ICICES.2014.7033901","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033901","url":null,"abstract":"In this paper, data transfer is done using the ZigBee networks which is of low implementation cost. In the previous ZigBee network model, the tree topology was used to construct the wireless sensor network for delivering the data that utilized large amount of resources and caused delivery failures due to the node movement. Thus, we first review the `in degree' of nodes in traditional way and address packet loss by calculating capacity of nodes. Next, mobility and coverage problems are presented. Finally, we comment on many issues like complexity in order to simulate more interest in large unexplored areas.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78703518","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-02-01DOI: 10.1109/ICICES.2014.7033806
D. Priya, G. Singaravel
The geographic location data are taken as the analysis for zone of influence. The Morphological processing technique erosion followed by dilation is used to convert the single point to zonal map via skeletonization. We demonstrate this approach to converting the temperature data available at specific location in a spatially disseminated zonal map that are suggested by equal temperature in a map.
{"title":"Creation of zonal map from point data using morphological opening by skeletonization","authors":"D. Priya, G. Singaravel","doi":"10.1109/ICICES.2014.7033806","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033806","url":null,"abstract":"The geographic location data are taken as the analysis for zone of influence. The Morphological processing technique erosion followed by dilation is used to convert the single point to zonal map via skeletonization. We demonstrate this approach to converting the temperature data available at specific location in a spatially disseminated zonal map that are suggested by equal temperature in a map.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75131821","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-02-01DOI: 10.1109/ICICES.2014.7033950
R. Murugeswari, Dr. S. Radhakrishnan
Disasters around the globe have caused a tremendous loss of lives, severe damage to the property and the environment as well as an incredible shock to the survivors. Robust communication during the emergency rescue operations are of paramount of importance. In this article, we proposed flexible network architecture for Emergency situation using Wireless Mesh Network (WMN). This paper proposes a Report Message Forwarding Algorithm (REPMSGFW), a location based on demand QoS routing algorithm for reliable delivery of data for the first responder in the disaster recovery. The simulation results demonstrate that our proposed REPMSGFW algorithm performs better than traditional schemes in terms of average delay, packet delivery ratio and Normalized routing load.
{"title":"Reliable data delivery for emergency and disaster recovery in wireless mesh network","authors":"R. Murugeswari, Dr. S. Radhakrishnan","doi":"10.1109/ICICES.2014.7033950","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033950","url":null,"abstract":"Disasters around the globe have caused a tremendous loss of lives, severe damage to the property and the environment as well as an incredible shock to the survivors. Robust communication during the emergency rescue operations are of paramount of importance. In this article, we proposed flexible network architecture for Emergency situation using Wireless Mesh Network (WMN). This paper proposes a Report Message Forwarding Algorithm (REPMSGFW), a location based on demand QoS routing algorithm for reliable delivery of data for the first responder in the disaster recovery. The simulation results demonstrate that our proposed REPMSGFW algorithm performs better than traditional schemes in terms of average delay, packet delivery ratio and Normalized routing load.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81421864","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-02-01DOI: 10.1109/ICICES.2014.7033743
S. Simonthomas, N. Thulasi, P. Asharaf
Glaucoma is the second leading cause of blindness worldwide. It is a disease in which fluid pressure in the eye increases continuously, damaging the optic nerve and causing vision loss. Computational decision support systems for the early detection of glaucoma can help prevent this complication. The retinal optic nerve fibre layer can be assessed using optical coherence tomography, scanning laser polarimetry, and Heidelberg retina tomography scanning methods. In this paper, we present a novel method for glaucoma detection using an Haralick Texture Features from digital fundus images. K Nearest Neighbors (KNN) classifiers are used to perform supervised classification. Our results demonstrate that the Haralick Texture Features has Database and classification parts, in Database the image has been loaded and Gray Level Co-occurrence Matrix (GLCM) and thirteen haralick features are combined to extract the image features, performs better than the other classifiers and correctly identifies the glaucoma images with an accuracy of more than 98%. The impact of training and testing is also studied to improve results. The software for this algorithm has been developed in MATLAB for Feature extraction and classification. Our proposed novel features are clinically significant and can be used to detect glaucoma accurately.
{"title":"Automated diagnosis of glaucoma using Haralick texture features","authors":"S. Simonthomas, N. Thulasi, P. Asharaf","doi":"10.1109/ICICES.2014.7033743","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033743","url":null,"abstract":"Glaucoma is the second leading cause of blindness worldwide. It is a disease in which fluid pressure in the eye increases continuously, damaging the optic nerve and causing vision loss. Computational decision support systems for the early detection of glaucoma can help prevent this complication. The retinal optic nerve fibre layer can be assessed using optical coherence tomography, scanning laser polarimetry, and Heidelberg retina tomography scanning methods. In this paper, we present a novel method for glaucoma detection using an Haralick Texture Features from digital fundus images. K Nearest Neighbors (KNN) classifiers are used to perform supervised classification. Our results demonstrate that the Haralick Texture Features has Database and classification parts, in Database the image has been loaded and Gray Level Co-occurrence Matrix (GLCM) and thirteen haralick features are combined to extract the image features, performs better than the other classifiers and correctly identifies the glaucoma images with an accuracy of more than 98%. The impact of training and testing is also studied to improve results. The software for this algorithm has been developed in MATLAB for Feature extraction and classification. Our proposed novel features are clinically significant and can be used to detect glaucoma accurately.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84284858","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
扫码关注我们
求助内容：
应助结果提醒方式：