Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931518
P. Honeine, F. Mourad, Maya Kallas, H. Snoussi, H. Amoud, C. Francis
The rapid growth in biomedical sensors, low-power circuits and wireless communications has enabled a new generation of wireless sensor networks: the body area networks. These networks are composed of tiny, cheap and low-power biomed-ical nodes, mainly dedicated for healthcare monitoring applications. The objective of these applications is to ensure a continuous monitoring of vital parameters of patients, while giving them the freedom of motion and thereby better quality of healthcare. This paper shows a comparison of body area networks to the wireless sensor networks. In particular, it shows how body area networks borrow and enhance ideas from wireless sensor networks. A study of energy consumption and heat absorption problems is developed for illustration.
{"title":"Wireless sensor networks in biomedical: Body area networks","authors":"P. Honeine, F. Mourad, Maya Kallas, H. Snoussi, H. Amoud, C. Francis","doi":"10.1109/WOSSPA.2011.5931518","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931518","url":null,"abstract":"The rapid growth in biomedical sensors, low-power circuits and wireless communications has enabled a new generation of wireless sensor networks: the body area networks. These networks are composed of tiny, cheap and low-power biomed-ical nodes, mainly dedicated for healthcare monitoring applications. The objective of these applications is to ensure a continuous monitoring of vital parameters of patients, while giving them the freedom of motion and thereby better quality of healthcare. This paper shows a comparison of body area networks to the wireless sensor networks. In particular, it shows how body area networks borrow and enhance ideas from wireless sensor networks. A study of energy consumption and heat absorption problems is developed for illustration.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126936326","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931435
S. Aouaouda, M. T. Khadir, G. Mourot, J. Ragot
This article proposes a linearization technique for an activated sludge reactor model. Starting with a reduced model using three state variables related to the organic substrate, biomass and oxygen concentrations; the linearization approach is developed and validated. In a first step, sensitivity analysis is used to evaluate the model output sensitivity to changes with respect to the model input variables. The input variables identified as non-influent, can then be discarded, leading to a model simplification. In a second step, locally valid linear model are derived. The linearization is based on approximation of nonlinear terms by linear combinations of variables of interest. In the third step the unknown parameters in the linear terms are identified using an evolutionary algorithm. The main advantage of the proposed strategy is that it conserves the global structure of the original model. The obtained linear model allows easier studies of the state estimation and control schemes problems.
{"title":"Systematic simplification methodology applied to an activated sludge reactor model","authors":"S. Aouaouda, M. T. Khadir, G. Mourot, J. Ragot","doi":"10.1109/WOSSPA.2011.5931435","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931435","url":null,"abstract":"This article proposes a linearization technique for an activated sludge reactor model. Starting with a reduced model using three state variables related to the organic substrate, biomass and oxygen concentrations; the linearization approach is developed and validated. In a first step, sensitivity analysis is used to evaluate the model output sensitivity to changes with respect to the model input variables. The input variables identified as non-influent, can then be discarded, leading to a model simplification. In a second step, locally valid linear model are derived. The linearization is based on approximation of nonlinear terms by linear combinations of variables of interest. In the third step the unknown parameters in the linear terms are identified using an evolutionary algorithm. The main advantage of the proposed strategy is that it conserves the global structure of the original model. The obtained linear model allows easier studies of the state estimation and control schemes problems.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115541094","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931515
M. Esseghir
One of the major concerns in wireless sensor networks is improving the network lifetime. In this paper, we propose an implementation of energy-based dynamic routing protocol. This implementation achieves efficient traffic load balancing, which leads to network lifetime maximization. We give a simple example to illustrate how do work our energy-based dynamic routing implementation. Simulation results show our proposal efficiency when compared to static routing.
{"title":"An implementation of energy-based dynamic routing for wireless sensor networks","authors":"M. Esseghir","doi":"10.1109/WOSSPA.2011.5931515","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931515","url":null,"abstract":"One of the major concerns in wireless sensor networks is improving the network lifetime. In this paper, we propose an implementation of energy-based dynamic routing protocol. This implementation achieves efficient traffic load balancing, which leads to network lifetime maximization. We give a simple example to illustrate how do work our energy-based dynamic routing implementation. Simulation results show our proposal efficiency when compared to static routing.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"38 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117279498","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931477
R. Khelifi, M. Adel, S. Bourennane, A. Moussaoui
In this paper, we present a new approach for multi-spectral texture classification. Therefore, we aim to add spectral information to classical texture analysis methods that only treat gray-level spatial variations. To achieve this goal, we propose a Spatial and Spectral Gray Level Dependence Method (SSGLDM) in order to extend the concept of spatial gray level dependence method by assuming texture joint information between spectral bands. In addition, the new texture features measurement related to (SSGLDM) which define the image properties have been also proposed. Extensive experiments have been carried out on many multispectral images for use in prostate cancer diagnosis and quantitative results showed the efficiency of this method compared to the Gray Level Co-occurrence Matrix (GLCM). The results indicate a significant improvement in classification accuracy.
{"title":"Generalized gray level dependence method for prostate cancer classification","authors":"R. Khelifi, M. Adel, S. Bourennane, A. Moussaoui","doi":"10.1109/WOSSPA.2011.5931477","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931477","url":null,"abstract":"In this paper, we present a new approach for multi-spectral texture classification. Therefore, we aim to add spectral information to classical texture analysis methods that only treat gray-level spatial variations. To achieve this goal, we propose a Spatial and Spectral Gray Level Dependence Method (SSGLDM) in order to extend the concept of spatial gray level dependence method by assuming texture joint information between spectral bands. In addition, the new texture features measurement related to (SSGLDM) which define the image properties have been also proposed. Extensive experiments have been carried out on many multispectral images for use in prostate cancer diagnosis and quantitative results showed the efficiency of this method compared to the Gray Level Co-occurrence Matrix (GLCM). The results indicate a significant improvement in classification accuracy.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128795922","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931412
M. Adnane, Zhongwei Jiang, Nobuaki Mori, Y. Matsumoto
The development of computer-aided diagnosis tools for detecting specific health-related events occurrences is of a great importance in the medical practice nowadays. Actually, health professionals still use manual methods for screening physiological data to get valuable information. This task becomes fastidious when the data is very long. In this paper, we present a new and simple method, we called windowed detrended fluctuation analysis (WDFA), for the detection of health-related events in physiological data. This method is based on the calculation of local energy of detrended profile of RR series obtained from the ECG signal. Data acquired during night containing apnea and hypopnea episodes and mental stress related data were used. Experiments showed that it is possible to detect apnea or hypopnea events and mental stress time episodes. Our method is well suited for the analysis of long time series data and the detection of abrupt changes in physiological data.
{"title":"An automated program for mental stress and apnea/hypopnea events detection","authors":"M. Adnane, Zhongwei Jiang, Nobuaki Mori, Y. Matsumoto","doi":"10.1109/WOSSPA.2011.5931412","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931412","url":null,"abstract":"The development of computer-aided diagnosis tools for detecting specific health-related events occurrences is of a great importance in the medical practice nowadays. Actually, health professionals still use manual methods for screening physiological data to get valuable information. This task becomes fastidious when the data is very long. In this paper, we present a new and simple method, we called windowed detrended fluctuation analysis (WDFA), for the detection of health-related events in physiological data. This method is based on the calculation of local energy of detrended profile of RR series obtained from the ECG signal. Data acquired during night containing apnea and hypopnea episodes and mental stress related data were used. Experiments showed that it is possible to detect apnea or hypopnea events and mental stress time episodes. Our method is well suited for the analysis of long time series data and the detection of abrupt changes in physiological data.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128346615","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931454
Y. Boutiche, A. Bessekri
In this paper, we use the active contour models (Snakes) for edge detection and segmentation of weld defects in radiographic images. Gradient Vector Flow snakes enhance the concave object extraction capability. However, the GVF snakes are sensitive to noise. Several new snake models were developed by combining different methods with GVF snake. Here, a multiscale GVF and B-spline model is proposed to overcome the traditionnal GVF dis-adventage. Experiments on synthetic and radiographic images are promoising
{"title":"Detection of defects in weld radiographic images by using multi-scale GVF B-spline snake","authors":"Y. Boutiche, A. Bessekri","doi":"10.1109/WOSSPA.2011.5931454","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931454","url":null,"abstract":"In this paper, we use the active contour models (Snakes) for edge detection and segmentation of weld defects in radiographic images. Gradient Vector Flow snakes enhance the concave object extraction capability. However, the GVF snakes are sensitive to noise. Several new snake models were developed by combining different methods with GVF snake. Here, a multiscale GVF and B-spline model is proposed to overcome the traditionnal GVF dis-adventage. Experiments on synthetic and radiographic images are promoising","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121301736","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931441
S. Astaneh, S. Gazor
We consider a cooperative spectrum sensing problem in which a relay user (RU) assists a secondary user (SU) in order to detect the presence of a primary user (PU). We propose three different schemes, namely amplify-and-forward, compress-and-forward, and decode-and-forward, where the RU transmits an amplified, compressed or decoded version of the observed signal toward the SU, respectively. We investigate the Neyman — Pearson criterion for each scheme. The theoretical performance of the tests is then analyzed in terms of probability of false alarm and mis-detection and closed-form expressions are derived for Rayleigh fading channels. Simulation results illustrate significant cooperative gain achieved by the proposed strategies. Numerical results are provided that give insights into the trade-offs between the primary and RU's transmit power and the performance of the proposed protocols in this three node network.
{"title":"Relay assisted spectrum sensing in cognitive radio","authors":"S. Astaneh, S. Gazor","doi":"10.1109/WOSSPA.2011.5931441","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931441","url":null,"abstract":"We consider a cooperative spectrum sensing problem in which a relay user (RU) assists a secondary user (SU) in order to detect the presence of a primary user (PU). We propose three different schemes, namely amplify-and-forward, compress-and-forward, and decode-and-forward, where the RU transmits an amplified, compressed or decoded version of the observed signal toward the SU, respectively. We investigate the Neyman — Pearson criterion for each scheme. The theoretical performance of the tests is then analyzed in terms of probability of false alarm and mis-detection and closed-form expressions are derived for Rayleigh fading channels. Simulation results illustrate significant cooperative gain achieved by the proposed strategies. Numerical results are provided that give insights into the trade-offs between the primary and RU's transmit power and the performance of the proposed protocols in this three node network.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134273564","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931437
M. Ouali, R. Gharbaoui, E. Aitnouri
Clustering has been a very active research topic in pattern recognition, and many algorithms and validity indices were proposed. There has been a long debate between fuzzy and crisp clustering and validity indices were proposed as a measure of the correctness of the clustering results. Nevertheless, these indices only verify if the clustering results fit the model they represent and give no information about the true classification of observations. In this paper, we propose a taxonomy to evaluate the performance of clustering algorithms and the subsequent validity indices. The ground-truth data is generated in a way that both the number of clusters and the inter clusters overlap rate are known.
{"title":"Benchmarking taxonomy for 1D clustering algorithms","authors":"M. Ouali, R. Gharbaoui, E. Aitnouri","doi":"10.1109/WOSSPA.2011.5931437","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931437","url":null,"abstract":"Clustering has been a very active research topic in pattern recognition, and many algorithms and validity indices were proposed. There has been a long debate between fuzzy and crisp clustering and validity indices were proposed as a measure of the correctness of the clustering results. Nevertheless, these indices only verify if the clustering results fit the model they represent and give no information about the true classification of observations. In this paper, we propose a taxonomy to evaluate the performance of clustering algorithms and the subsequent validity indices. The ground-truth data is generated in a way that both the number of clusters and the inter clusters overlap rate are known.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131725081","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931449
O. Alsmadi, Z. Abo-Hammour, D. Abu-Al-Nadi, Alia Algsoon
In this paper, as a machine learning or system modeling, a novel genetic algorithm (GA) approach for solving university course timetabling problem is presented. The designed timetabling is free of any hard constraint violations and satisfies most of the soft constraints as much as realistically possible. When compared with other methods, the followings were the advantages: 1) the number of soft constraint violations is less, 2) the use of external rooms is eliminated, and 3) the number of instructors' overload is less.
{"title":"A novel genetic algorithm technique for solving university course timetabling problems","authors":"O. Alsmadi, Z. Abo-Hammour, D. Abu-Al-Nadi, Alia Algsoon","doi":"10.1109/WOSSPA.2011.5931449","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931449","url":null,"abstract":"In this paper, as a machine learning or system modeling, a novel genetic algorithm (GA) approach for solving university course timetabling problem is presented. The designed timetabling is free of any hard constraint violations and satisfies most of the soft constraints as much as realistically possible. When compared with other methods, the followings were the advantages: 1) the number of soft constraint violations is less, 2) the use of external rooms is eliminated, and 3) the number of instructors' overload is less.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130882172","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931406
Kamel Belloulata, Shiping Zhu, Jun Tian, Xiaodong Shen
Search patterns and the center-biased characteristics of motion vector distribution have large impact on both searching speed and quality of block motion estimation. In this paper, we propose a new cross-hexagon search algorithm (NCHEXS) using two cross-shaped search patterns as the first two initial steps and large/small hexagon-shaped patterns as the subsequent steps for fast block motion estimation (BME). NCHEXS employs halfway stop technique to achieve significant speedup on sequences with stationary and quasi-stationary blocks. To further reduce computational complexity, NCHEXS employs Modified Partial Distortion Criterion (MPDC). Experimental results indicate that the improvements of NCHEXS over Hexagon Search (HEXS) and Cross-Diamond Search (CDS) can save 45% and 28% of search points while keeping similar PSNR, and NCHEXS provides faster searching speed and smaller distortion than other popular fast block-matching motion estimation algorithms.
{"title":"A novel cross-hexagon search algorithm for fast block motion estimation","authors":"Kamel Belloulata, Shiping Zhu, Jun Tian, Xiaodong Shen","doi":"10.1109/WOSSPA.2011.5931406","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931406","url":null,"abstract":"Search patterns and the center-biased characteristics of motion vector distribution have large impact on both searching speed and quality of block motion estimation. In this paper, we propose a new cross-hexagon search algorithm (NCHEXS) using two cross-shaped search patterns as the first two initial steps and large/small hexagon-shaped patterns as the subsequent steps for fast block motion estimation (BME). NCHEXS employs halfway stop technique to achieve significant speedup on sequences with stationary and quasi-stationary blocks. To further reduce computational complexity, NCHEXS employs Modified Partial Distortion Criterion (MPDC). Experimental results indicate that the improvements of NCHEXS over Hexagon Search (HEXS) and Cross-Diamond Search (CDS) can save 45% and 28% of search points while keeping similar PSNR, and NCHEXS provides faster searching speed and smaller distortion than other popular fast block-matching motion estimation algorithms.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"198 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132879313","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
扫码关注我们
求助内容：
应助结果提醒方式：