Pub Date : 2009-09-01DOI: 10.1109/YCICT.2009.5382438
Yongxin Zhong, Jianguo Huang, Jing Han
The hostile seawater channel condition poses research challenges of designing reliable and efficient communication protocols for underwater acoustic sensor networks. Especially, long propagation delay of acoustic waves in water makes networks poor performance. Due to low channel utilization of traditional TDMA protocol, in this paper, we present a new medium access control (MAC) protocol called I-TDMA, which interleaves data packets in empty time axis by taking advantage of long propagation delay in underwater channel. The proposed scheme improves channel utilization, and simulation tests on OPNET radio modeler show that I-TDMA has much higher throughput and lower delay than traditional TDMA protocol.
{"title":"A TDMA MAC protocol for underwater acoustic sensor networks","authors":"Yongxin Zhong, Jianguo Huang, Jing Han","doi":"10.1109/YCICT.2009.5382438","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382438","url":null,"abstract":"The hostile seawater channel condition poses research challenges of designing reliable and efficient communication protocols for underwater acoustic sensor networks. Especially, long propagation delay of acoustic waves in water makes networks poor performance. Due to low channel utilization of traditional TDMA protocol, in this paper, we present a new medium access control (MAC) protocol called I-TDMA, which interleaves data packets in empty time axis by taking advantage of long propagation delay in underwater channel. The proposed scheme improves channel utilization, and simulation tests on OPNET radio modeler show that I-TDMA has much higher throughput and lower delay than traditional TDMA protocol.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127412092","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382409
Lili Xu, S. Luo
Hard exudates in retinal images are one of the most prevalent earliest signs of diabetic retinopathy. The accurate identification of hard exudates is of increasing importance in the early detection of diabetic retinopathy. In this paper, we present a novel method to identify hard exudates from digital retinal images. A feature combination based on stationary wavelet transform (SWT) and gray level co-occurrence matrix (GLCM) is used to characterize hard exudates candidates. An optimized support vector machine (SVM) with Gaussian radial basis function is employed as a classifier. A sample dataset consisting of 50 hard exudates candidates is used for identifying hard exudates. With the optimal SVM parameters, the classification accuracy of 84%, sensitivity of 88% and specificity of 80% are obtained.
{"title":"Support vector machine based method for identifying hard exudates in retinal images","authors":"Lili Xu, S. Luo","doi":"10.1109/YCICT.2009.5382409","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382409","url":null,"abstract":"Hard exudates in retinal images are one of the most prevalent earliest signs of diabetic retinopathy. The accurate identification of hard exudates is of increasing importance in the early detection of diabetic retinopathy. In this paper, we present a novel method to identify hard exudates from digital retinal images. A feature combination based on stationary wavelet transform (SWT) and gray level co-occurrence matrix (GLCM) is used to characterize hard exudates candidates. An optimized support vector machine (SVM) with Gaussian radial basis function is employed as a classifier. A sample dataset consisting of 50 hard exudates candidates is used for identifying hard exudates. With the optimal SVM parameters, the classification accuracy of 84%, sensitivity of 88% and specificity of 80% are obtained.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129085118","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382431
Ning Zhang, Qixiang Ye, Jianbin Jiao
In this paper, we propose a method for fast pedestrian detection in images/videos. Multi-scale orientated (MSO) features are proposed to represent coarse pedestrian contour, on which Adaboost classifiers are trained for pedestrian coarse location. In the fine detection, histogram of oriented gradient (HOG) features and SVM classifiers are employed to precisely classify pedestrians and non-pedestrians. The coarse-to-fine scheme can bring out not only a higher speed but also the elimination of smooth image regions that are prone to be falsely detection as positives by strong classifiers. The strong classifier SVM in the fine detection make the detection robust to variance of pedestrian pattern. Experiments validates the proposed method.
{"title":"Fast pedestrain detection with cascade classifiers","authors":"Ning Zhang, Qixiang Ye, Jianbin Jiao","doi":"10.1109/YCICT.2009.5382431","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382431","url":null,"abstract":"In this paper, we propose a method for fast pedestrian detection in images/videos. Multi-scale orientated (MSO) features are proposed to represent coarse pedestrian contour, on which Adaboost classifiers are trained for pedestrian coarse location. In the fine detection, histogram of oriented gradient (HOG) features and SVM classifiers are employed to precisely classify pedestrians and non-pedestrians. The coarse-to-fine scheme can bring out not only a higher speed but also the elimination of smooth image regions that are prone to be falsely detection as positives by strong classifiers. The strong classifier SVM in the fine detection make the detection robust to variance of pedestrian pattern. Experiments validates the proposed method.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132037948","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382324
Mariam Zabihi, H. M. Naimi, P. Masoumi
In this paper, a new structural for Phase Locked Loop based on adding a non linear element is introduced. The proposed PLL, denoted by NPLL, is similar to the standard PLL except that it incorporates a nonlinear element in its loop. The proposed NPLL enhancements speed and stability of system by adjusting direct gain. Assess the performance of the proposed structure, various tests performed and results compared standard phase locked loop . Many tests, results of several of which are reported in this paper, show the superior performance of the NPLL.
{"title":"A novel fast locking PLLs based on mathematical element","authors":"Mariam Zabihi, H. M. Naimi, P. Masoumi","doi":"10.1109/YCICT.2009.5382324","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382324","url":null,"abstract":"In this paper, a new structural for Phase Locked Loop based on adding a non linear element is introduced. The proposed PLL, denoted by NPLL, is similar to the standard PLL except that it incorporates a nonlinear element in its loop. The proposed NPLL enhancements speed and stability of system by adjusting direct gain. Assess the performance of the proposed structure, various tests performed and results compared standard phase locked loop . Many tests, results of several of which are reported in this paper, show the superior performance of the NPLL.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123394851","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382382
P. Meng, L. Hang, Wei Yang, Zhili Chen
Translation-Based Steganography(TBS) is a kind of famous text steganography. In this paper we examine the robustness of TBS and give an effective detection algorithm for TBS. Our algorithm can not only distinguish between natural language text and stego-text which was generated by TBS, but also can distinguish between machine translated text and stego-text. The detection accuracy increases as the text size increases. When the text size is larger than 60 sentences, the detection accuracy is greater than 92%.
{"title":"Attacks on Translation Based Steganography","authors":"P. Meng, L. Hang, Wei Yang, Zhili Chen","doi":"10.1109/YCICT.2009.5382382","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382382","url":null,"abstract":"Translation-Based Steganography(TBS) is a kind of famous text steganography. In this paper we examine the robustness of TBS and give an effective detection algorithm for TBS. Our algorithm can not only distinguish between natural language text and stego-text which was generated by TBS, but also can distinguish between machine translated text and stego-text. The detection accuracy increases as the text size increases. When the text size is larger than 60 sentences, the detection accuracy is greater than 92%.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125149028","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382323
Qing He, Guoqi Li
A method to analyze the properties of ultrasonic transducer is proposed. The method is based on Hilbert-Huang Transform. The signals derived from ultrasonic transducer will be decomposed by empirical mode decomposition, and then the intrinsic mode functions can be obtained. So the marginal spectrum of each intrinsic mode functions will be calculated. The marginal spectrum offers a measure of total amplitude (or energy) contribution from each frequency value. Using those marginal spectrums and intrinsic mode functions, the amplitude and frequency properties of ultrasonic transducer can be analyzed. The proposed method was applied to analyze the properties of two ultrasonic transducers in experiment, and the results show that it is effective.
{"title":"Hilbert-Huang Transform and its application in ultrasonic transducer analysis","authors":"Qing He, Guoqi Li","doi":"10.1109/YCICT.2009.5382323","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382323","url":null,"abstract":"A method to analyze the properties of ultrasonic transducer is proposed. The method is based on Hilbert-Huang Transform. The signals derived from ultrasonic transducer will be decomposed by empirical mode decomposition, and then the intrinsic mode functions can be obtained. So the marginal spectrum of each intrinsic mode functions will be calculated. The marginal spectrum offers a measure of total amplitude (or energy) contribution from each frequency value. Using those marginal spectrums and intrinsic mode functions, the amplitude and frequency properties of ultrasonic transducer can be analyzed. The proposed method was applied to analyze the properties of two ultrasonic transducers in experiment, and the results show that it is effective.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131136902","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382417
Yubo Jia, Chengwei Huang, Hao Cai
Agent oriented software development is new research area in the field of software engineering. It is a promising approach for developing applications in complex domain. In recent years, multiple agent-oriented methodologies were introduced. However, it is difficult to select a methodology for a specific project, and their application is still limited due to their lack of maturity and standardization. Comparing some prominent agent-oriented methodologies and evaluating their strengths and weakness plays an important role in improving them. This paper presents a comparison and evaluation of three prominent agent-oriented methodologies: MaSE, Gaia, and Tropos. It is perfomed based upon a framework which addresses four major areas: concepts and properties, modelling techniques, process, and pragmatics. The results are discussed and presented.
{"title":"A comparison of three agent-oriented software development methodologies: MaSE, Gaia, and Tropos","authors":"Yubo Jia, Chengwei Huang, Hao Cai","doi":"10.1109/YCICT.2009.5382417","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382417","url":null,"abstract":"Agent oriented software development is new research area in the field of software engineering. It is a promising approach for developing applications in complex domain. In recent years, multiple agent-oriented methodologies were introduced. However, it is difficult to select a methodology for a specific project, and their application is still limited due to their lack of maturity and standardization. Comparing some prominent agent-oriented methodologies and evaluating their strengths and weakness plays an important role in improving them. This paper presents a comparison and evaluation of three prominent agent-oriented methodologies: MaSE, Gaia, and Tropos. It is perfomed based upon a framework which addresses four major areas: concepts and properties, modelling techniques, process, and pragmatics. The results are discussed and presented.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134348685","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}
In this paper, the augmented forms of the quadrature Kalman filter (QKF) and cubature Kalman filter (CKF) are presented for estimating the nonlinear dynamic systems. The QKF and CKF are modified by forming an augmented state variable, which concatenates the state and noise components together, so that the effect of process and measurement noises can be used to better capture the odd-order moment information. The simulation results demonstrate the improved performance of the augmented form over the nonaugmented form. Besides, the performance and the execution time of the three kinds of nonlinear filters is also compared in the augmented form and nonaugmented form.
{"title":"The augmented form of cubature Kalman filter and quadrature Kalman filter for additive noise","authors":"Pengfei Li, Jianping Yu, Mingjie Wan, Jianjun Huang, Jingxiong Huang","doi":"10.1109/YCICT.2009.5382364","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382364","url":null,"abstract":"In this paper, the augmented forms of the quadrature Kalman filter (QKF) and cubature Kalman filter (CKF) are presented for estimating the nonlinear dynamic systems. The QKF and CKF are modified by forming an augmented state variable, which concatenates the state and noise components together, so that the effect of process and measurement noises can be used to better capture the odd-order moment information. The simulation results demonstrate the improved performance of the augmented form over the nonaugmented form. Besides, the performance and the execution time of the three kinds of nonlinear filters is also compared in the augmented form and nonaugmented form.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117000278","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382446
Wang Jing, Luo Feng, Wu Shunjun, Fu Shaofeng
An improved genetic algorithm based on multiple population evolving is presented and applied to the optimization of orthogonal coded signal group for MIMO radar systems. According to the fitness of individuals, the population is divided into three groups and different evolving strategies are applied to every sub-population. The inosculation to all sub-population is actualized. This algorithm can strengthen and preserve the diversity of population. Meanwhile it can enhance the constringency speed and overcome the precocity of GA. Simulation results show that the improved genetic algorithm is effective and the optimized signal can used in MIMO radar.
{"title":"The optimization of orthogonal coded signal group based on multiple population evolving strategies","authors":"Wang Jing, Luo Feng, Wu Shunjun, Fu Shaofeng","doi":"10.1109/YCICT.2009.5382446","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382446","url":null,"abstract":"An improved genetic algorithm based on multiple population evolving is presented and applied to the optimization of orthogonal coded signal group for MIMO radar systems. According to the fitness of individuals, the population is divided into three groups and different evolving strategies are applied to every sub-population. The inosculation to all sub-population is actualized. This algorithm can strengthen and preserve the diversity of population. Meanwhile it can enhance the constringency speed and overcome the precocity of GA. Simulation results show that the improved genetic algorithm is effective and the optimized signal can used in MIMO radar.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115126073","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382325
M. Damrudi, K. J. Aval
In this paper we introduce a new architecture which is called Diamond. This architecture has new techniques for interconnection among processors. We also present a new sorting algorithm on it. This algorithm which we name it NOD (Neighborhood sort On Diamond), sorts n data with 7/4n processors. The aim of issued architecture and algorithm is to reduce the cost of sorting by using a simple architecture and a simple way of sorting. There are architectures and sorting algorithms that are used but we always endeavor to find new and optimal ones. The algorithm on the issued architecture sorts data elements using 7/4n processors with a running time of O(n) . Our architecture is heterogeneous and uses cheaper processors more than expensive ones. Though, this architecture makes a tradeoff between number of processors and their cost.
{"title":"Diamond architecture with NOD sorting","authors":"M. Damrudi, K. J. Aval","doi":"10.1109/YCICT.2009.5382325","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382325","url":null,"abstract":"In this paper we introduce a new architecture which is called Diamond. This architecture has new techniques for interconnection among processors. We also present a new sorting algorithm on it. This algorithm which we name it NOD (Neighborhood sort On Diamond), sorts n data with 7/4n processors. The aim of issued architecture and algorithm is to reduce the cost of sorting by using a simple architecture and a simple way of sorting. There are architectures and sorting algorithms that are used but we always endeavor to find new and optimal ones. The algorithm on the issued architecture sorts data elements using 7/4n processors with a running time of O(n) . Our architecture is heterogeneous and uses cheaper processors more than expensive ones. Though, this architecture makes a tradeoff between number of processors and their cost.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115161957","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}