Pub Date : 2012-07-02DOI: 10.1109/ISSPA.2012.6310527
I. Candel, C. Ioana, D. Lemon, B. Reeb
This paper deals with the challenges of water flow measurement in hydroelectric plants using acoustic scintillation. One of the drawbacks of ultrasonic signal propagation through water is that measurements require relatively clean water conditions. In water with significant amount of impurities, the level of transmitted signals may not be sufficient for an accurate flow measurement. In terms of signal processing, the effect of impurities is represented by a random loss or fading of received signals. In order to improve the measurement, the wide band signals can be used in order to improve the quality factor of the signals by adaptive filtering using a static mode reference. Results show that, in real configurations, the interference due to the obstacles can be reduced.
{"title":"Using wide band signals for obstacle path correction in acoustic scintillation flow meters","authors":"I. Candel, C. Ioana, D. Lemon, B. Reeb","doi":"10.1109/ISSPA.2012.6310527","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310527","url":null,"abstract":"This paper deals with the challenges of water flow measurement in hydroelectric plants using acoustic scintillation. One of the drawbacks of ultrasonic signal propagation through water is that measurements require relatively clean water conditions. In water with significant amount of impurities, the level of transmitted signals may not be sufficient for an accurate flow measurement. In terms of signal processing, the effect of impurities is represented by a random loss or fading of received signals. In order to improve the measurement, the wide band signals can be used in order to improve the quality factor of the signals by adaptive filtering using a static mode reference. Results show that, in real configurations, the interference due to the obstacles can be reduced.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123390061","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310569
Georgios Athanasopoulos, Tomas Dekens, H. Brouckxon, W. Verhelst
In this paper we study the suitability and performance of four major speech denoising algorithms as weighting functions for the Generalized Cross-Correlation (GCC) and discuss the role of the microphones' frequency response on the localization estimates. An evaluation is made with the humanoid robot Nao. Moving away from simulated environments, we look at the performance of sound source localization under different in-system and ambient noise conditions. We also present a time delay of arrival (TDOA) / GCC based sound source localization method for real-world humanoid robots which was used for our experiments. This method addresses the robot's shape influence by utilizing a pre-measured set of TDOAs.
{"title":"The effect of speech denoising algorithms on sound source localization for humanoid robots","authors":"Georgios Athanasopoulos, Tomas Dekens, H. Brouckxon, W. Verhelst","doi":"10.1109/ISSPA.2012.6310569","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310569","url":null,"abstract":"In this paper we study the suitability and performance of four major speech denoising algorithms as weighting functions for the Generalized Cross-Correlation (GCC) and discuss the role of the microphones' frequency response on the localization estimates. An evaluation is made with the humanoid robot Nao. Moving away from simulated environments, we look at the performance of sound source localization under different in-system and ambient noise conditions. We also present a time delay of arrival (TDOA) / GCC based sound source localization method for real-world humanoid robots which was used for our experiments. This method addresses the robot's shape influence by utilizing a pre-measured set of TDOAs.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122301740","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310658
M. Neggazi, A. Amira, L. Hamami
The independence and safety of the elderly population is supported by new technologies, such as automated fall detectors, knowing that the fall related injuries are a central problem for this population. Accelerometry based approach has been used in various automated fall detection systems to objectively monitor a range of human movement. This paper presents a wireless reconfigurable system for automatic detection of falls using three-axis-accelerometer signals. The proposed connected health system for falls detection is based on a wireless sensor and field programmable gate arrays (FPGA) platforms. The 3D accelerometer data is processed by robust and efficient algorithm on FPGA to detect falls. Furthermore, best compromise algorithm between effectiveness and complexity to compute patient's orientation is proposed. The developed architecture is capable of monitoring up to 96 three-axis-accelerometer data simultaneously, and our performance evaluations indicate that a speedup of around 284X can be achieved over an optimized software implementation running on a 2.4GHz Dual-core processor. The proposed falls detection system has been proven to distinguish among falls and activities of daily living, and the accuracy has been evaluated in terms of specificity and sensitivity and has shown an excellent results.
{"title":"A wireless reconfigurable system for falls detection","authors":"M. Neggazi, A. Amira, L. Hamami","doi":"10.1109/ISSPA.2012.6310658","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310658","url":null,"abstract":"The independence and safety of the elderly population is supported by new technologies, such as automated fall detectors, knowing that the fall related injuries are a central problem for this population. Accelerometry based approach has been used in various automated fall detection systems to objectively monitor a range of human movement. This paper presents a wireless reconfigurable system for automatic detection of falls using three-axis-accelerometer signals. The proposed connected health system for falls detection is based on a wireless sensor and field programmable gate arrays (FPGA) platforms. The 3D accelerometer data is processed by robust and efficient algorithm on FPGA to detect falls. Furthermore, best compromise algorithm between effectiveness and complexity to compute patient's orientation is proposed. The developed architecture is capable of monitoring up to 96 three-axis-accelerometer data simultaneously, and our performance evaluations indicate that a speedup of around 284X can be achieved over an optimized software implementation running on a 2.4GHz Dual-core processor. The proposed falls detection system has been proven to distinguish among falls and activities of daily living, and the accuracy has been evaluated in terms of specificity and sensitivity and has shown an excellent results.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121652531","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310448
C. Srinivasa, R. Pichevar, Hossein Najaf-Zadeh, M. Bouchard
The impact of auditory masking when obtaining sparse representations for audio signals is investigated by integrating a masking model into a Locally Competitive Algorithm. The masking model considers both temporal and frequency domain masking effects. The performance of the new algorithm is verified against the original Locally Competitive Algorithm for different types of sound files. Results show that the new algorithm allows for larger residual error between an input signal and its reconstructed version while maintaining the broadcast quality of the reconstructed version. It does so by shaping the residual error such that this larger error is inaudible.
{"title":"Integration of auditory masks into a Locally Competitive Algorithm for sparse representations of audio signals","authors":"C. Srinivasa, R. Pichevar, Hossein Najaf-Zadeh, M. Bouchard","doi":"10.1109/ISSPA.2012.6310448","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310448","url":null,"abstract":"The impact of auditory masking when obtaining sparse representations for audio signals is investigated by integrating a masking model into a Locally Competitive Algorithm. The masking model considers both temporal and frequency domain masking effects. The performance of the new algorithm is verified against the original Locally Competitive Algorithm for different types of sound files. Results show that the new algorithm allows for larger residual error between an input signal and its reconstructed version while maintaining the broadcast quality of the reconstructed version. It does so by shaping the residual error such that this larger error is inaudible.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121747760","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310518
Yikai Su
In this paper, we demonstrate signal processing functions in silicon waveguide devices. These optical devices are compared with electronic counter parts in size, performances and power consumptions.
{"title":"All-optical signal processing using integrated silicon photonic devices","authors":"Yikai Su","doi":"10.1109/ISSPA.2012.6310518","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310518","url":null,"abstract":"In this paper, we demonstrate signal processing functions in silicon waveguide devices. These optical devices are compared with electronic counter parts in size, performances and power consumptions.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124873650","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310628
Syed Zahidi, F. Aloul, A. Sagahyroon, W. El-Hajj
Recently there have been several improvements in the performance of Integer Linear Programming (ILP) and Boolean Satisfiability (SAT) solvers. These improvements have encouraged the modeling of complex engineering problems as ILP problems. One such problem is the Clustering Problem in Mobile Ad-Hoc Networks (MANETs). The Clustering Problem in MANETs consists of selecting the most suitable nodes of a given MANET topology as clusterheads (CH), and ensuring that regular nodes are connected to clusterheads such that the lifetime of the network is maximized. This paper focuses on developing an improved ILP formulation for the Clustering Problem, and assessing the feasibility of using such a formulation, together with state-of-the art Generic ILP and SAT solvers, in a real-life practical environment.
{"title":"Solving the Clustering Problem in MANETs using SAT & ILP techniques","authors":"Syed Zahidi, F. Aloul, A. Sagahyroon, W. El-Hajj","doi":"10.1109/ISSPA.2012.6310628","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310628","url":null,"abstract":"Recently there have been several improvements in the performance of Integer Linear Programming (ILP) and Boolean Satisfiability (SAT) solvers. These improvements have encouraged the modeling of complex engineering problems as ILP problems. One such problem is the Clustering Problem in Mobile Ad-Hoc Networks (MANETs). The Clustering Problem in MANETs consists of selecting the most suitable nodes of a given MANET topology as clusterheads (CH), and ensuring that regular nodes are connected to clusterheads such that the lifetime of the network is maximized. This paper focuses on developing an improved ILP formulation for the Clustering Problem, and assessing the feasibility of using such a formulation, together with state-of-the art Generic ILP and SAT solvers, in a real-life practical environment.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125010326","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310586
D. Guarín, Á. Orozco, E. Delgado-Trejos
This document presents the preliminary results of an ongoing study related to the use of nonlinear statistics for bearing diagnosis. In this study, we propose a methodology based on the K-nearest neighbor algorithm to test the ability of a group of nonlinear statistic to differentiate between vibration signals obtained from rotatory machines with bearings in good and in bad condition. Results showed that statistics such as Lempel-Ziv complexity, Sample Entropy, and others derived from the recurrence plot, unlike the correlation dimension, are good at detecting a failure in a bearing. Additionally, we found that the Sample Entropy is exceptionally good at this task.
{"title":"Nonlinear statistics for bearing diagnosis","authors":"D. Guarín, Á. Orozco, E. Delgado-Trejos","doi":"10.1109/ISSPA.2012.6310586","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310586","url":null,"abstract":"This document presents the preliminary results of an ongoing study related to the use of nonlinear statistics for bearing diagnosis. In this study, we propose a methodology based on the K-nearest neighbor algorithm to test the ability of a group of nonlinear statistic to differentiate between vibration signals obtained from rotatory machines with bearings in good and in bad condition. Results showed that statistics such as Lempel-Ziv complexity, Sample Entropy, and others derived from the recurrence plot, unlike the correlation dimension, are good at detecting a failure in a bearing. Additionally, we found that the Sample Entropy is exceptionally good at this task.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"343 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122757907","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310644
Y. Petetin, F. Desbouvries
Exact Bayesian filtering is impossible in Jump Markov State Space Systems (JMSS), even in the simple linear and Gaussian case. Suboptimal solutions include sequential Monte-Carlo (SMC) algorithms which are indeed popular, and are declined in different versions according to the JMSS considered. In particular, Jump Markov Linear Systems (JMLS) are particular JMSS for which a Rao-Blackwellized (RB) Particle Filter (PF) has been derived. The RBPF solution relies on a combination of PF and Kalman Filtering (KF), and RBPF-based moment estimators outperform purely SMC-based ones when the number of samples tends to infinity. In this paper, we show that it is possible to derive a new RBPF solution, which implements a further RB step in the already RBPF with optimal importance distribution (ID). The new RBPF-based moment estimator outperforms the classical RBPF one whatever the number of particles, at the expense of a reasonable extra computational cost.
{"title":"Further Rao-Blackwellizing an already Rao-Blackwellized algorithm for Jump Markov State Space Systems","authors":"Y. Petetin, F. Desbouvries","doi":"10.1109/ISSPA.2012.6310644","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310644","url":null,"abstract":"Exact Bayesian filtering is impossible in Jump Markov State Space Systems (JMSS), even in the simple linear and Gaussian case. Suboptimal solutions include sequential Monte-Carlo (SMC) algorithms which are indeed popular, and are declined in different versions according to the JMSS considered. In particular, Jump Markov Linear Systems (JMLS) are particular JMSS for which a Rao-Blackwellized (RB) Particle Filter (PF) has been derived. The RBPF solution relies on a combination of PF and Kalman Filtering (KF), and RBPF-based moment estimators outperform purely SMC-based ones when the number of samples tends to infinity. In this paper, we show that it is possible to derive a new RBPF solution, which implements a further RB step in the already RBPF with optimal importance distribution (ID). The new RBPF-based moment estimator outperforms the classical RBPF one whatever the number of particles, at the expense of a reasonable extra computational cost.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121643461","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310556
K. Abhari, M. Marsousi, J. Alirezaie, P. Babyn
In this paper, the problem of reducing noise from low-dose Computed Tomography (CT) is investigated. The process is composed of: sparse coding, dictionary update and denoising; that is a time consuming process. Hence, despite the promising results reported in literature, it has not attracted much attention in medical applications. In an attempt to reduce the complexity and time consumed, we propose an efficient method for sparse coding approximation. In the proposed sparse coding approach, unlike most current methods the global search is performed only once. The potential representative atoms are identified and buffered, then only a local recursive pursuit within a few atoms is executed to find the sparse representation. Moreover, the K-SVD dictionary update method and its extension to image denoising is utilized for reducing the noise in CT scans. Our results demonstrate this approach is reliable and improves the accuracy and process time significantly, making the proposed method a suitable candidate for clinical purposes.
{"title":"Computed Tomography image denoising utilizing an efficient sparse coding algorithm","authors":"K. Abhari, M. Marsousi, J. Alirezaie, P. Babyn","doi":"10.1109/ISSPA.2012.6310556","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310556","url":null,"abstract":"In this paper, the problem of reducing noise from low-dose Computed Tomography (CT) is investigated. The process is composed of: sparse coding, dictionary update and denoising; that is a time consuming process. Hence, despite the promising results reported in literature, it has not attracted much attention in medical applications. In an attempt to reduce the complexity and time consumed, we propose an efficient method for sparse coding approximation. In the proposed sparse coding approach, unlike most current methods the global search is performed only once. The potential representative atoms are identified and buffered, then only a local recursive pursuit within a few atoms is executed to find the sparse representation. Moreover, the K-SVD dictionary update method and its extension to image denoising is utilized for reducing the noise in CT scans. Our results demonstrate this approach is reliable and improves the accuracy and process time significantly, making the proposed method a suitable candidate for clinical purposes.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132832173","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 : 2012-07-02DOI: 10.1109/ISSPA.2012.6310571
Mohammed Mujahid Ulla Faiz, A. Zerguine
In this paper, a new algorithm, the ϵ-normalized sign regressor least mean fourth (NSRLMF) algorithm is presented as a substitute for the ϵ-normalized least mean fourth (NLMF) algorithm. This new algorithm reduces significantly the computational load. Moreover, the proposed algorithm has similar convergence properties as those of the ϵ-NLMF algorithm. Finally, simulations corroborate very well the theoretical findings.
{"title":"The ∈-normalized sign regressor least mean fourth (NSRLMF) adaptive algorithm","authors":"Mohammed Mujahid Ulla Faiz, A. Zerguine","doi":"10.1109/ISSPA.2012.6310571","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310571","url":null,"abstract":"In this paper, a new algorithm, the ϵ-normalized sign regressor least mean fourth (NSRLMF) algorithm is presented as a substitute for the ϵ-normalized least mean fourth (NLMF) algorithm. This new algorithm reduces significantly the computational load. Moreover, the proposed algorithm has similar convergence properties as those of the ϵ-NLMF algorithm. Finally, simulations corroborate very well the theoretical findings.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133440260","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
扫码关注我们
求助内容：
应助结果提醒方式：