Pub Date : 2012-07-02DOI: 10.1109/ISSPA.2012.6310537
M. Smiatacz
Difficulties related to poor illumination conditions are one of the main reasons for which many face identification algorithms fail in real-life situations. The paper presents a new method for image normalization, based on simple techniques such as binarization and histogram equalization, that effectively removes the shadows and provides illumination invariants that significantly improve the accuracy of face identification process. During experiments the proposed method outperformed the state of the art approach based on anisotropic smoothing.
{"title":"Image normalization method for face identification under difficult lighting conditions","authors":"M. Smiatacz","doi":"10.1109/ISSPA.2012.6310537","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310537","url":null,"abstract":"Difficulties related to poor illumination conditions are one of the main reasons for which many face identification algorithms fail in real-life situations. The paper presents a new method for image normalization, based on simple techniques such as binarization and histogram equalization, that effectively removes the shadows and provides illumination invariants that significantly improve the accuracy of face identification process. During experiments the proposed method outperformed the state of the art approach based on anisotropic smoothing.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"15 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":"115660922","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.6310637
Stefano Cosentino, T. Marquardt, D. McAlpine, T. Falk
This study validates a novel approach to predict speech intelligibility for Cochlear Implant users (CIs) in reverberant environments. More specifically, we explore the use of existing objective quality and intelligibility metrics, applied directly to vocoded speech degraded by room reverberation, here assessed at ten different reverberation time (RT60) values: 0 s, 0.4 s - 1.0 s (0.1 s increments), 1.5 s and 2 s. Eight objective speech intelligibility predictors (SIPs) were investigated in this study. Of these, two were non-intrusive (i.e. did not require a reference signal) audio quality measures, four were intrusive, and two were intrusive speech intelligibility indexes. Three types of vocoders were implemented to examine how speech intelligibility predictions depended on the vocoder type. These were: noise-excited vocoder, tone-excited vocoder and a FFT-based N-of-M vocoder. Experimental results show that several intrusive quality and intelligibility measures were highly correlated with exponentially fit CI intelligibility data. On the other hand, only a recently - developed non-intrusive measure showed high correlations. These evaluations suggest that CI intelligibility may be accurately assessed via objective metrics applied to vocoded speech, thus may reduce the need for expensive and time-consuming listening tests.
{"title":"Towards objective measures of speech intelligibility for Cochlear Implant users in reverberant environments","authors":"Stefano Cosentino, T. Marquardt, D. McAlpine, T. Falk","doi":"10.1109/ISSPA.2012.6310637","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310637","url":null,"abstract":"This study validates a novel approach to predict speech intelligibility for Cochlear Implant users (CIs) in reverberant environments. More specifically, we explore the use of existing objective quality and intelligibility metrics, applied directly to vocoded speech degraded by room reverberation, here assessed at ten different reverberation time (RT60) values: 0 s, 0.4 s - 1.0 s (0.1 s increments), 1.5 s and 2 s. Eight objective speech intelligibility predictors (SIPs) were investigated in this study. Of these, two were non-intrusive (i.e. did not require a reference signal) audio quality measures, four were intrusive, and two were intrusive speech intelligibility indexes. Three types of vocoders were implemented to examine how speech intelligibility predictions depended on the vocoder type. These were: noise-excited vocoder, tone-excited vocoder and a FFT-based N-of-M vocoder. Experimental results show that several intrusive quality and intelligibility measures were highly correlated with exponentially fit CI intelligibility data. On the other hand, only a recently - developed non-intrusive measure showed high correlations. These evaluations suggest that CI intelligibility may be accurately assessed via objective metrics applied to vocoded speech, thus may reduce the need for expensive and time-consuming listening tests.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"39 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":"115125401","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.6310588
Y. Petetin, F. Desbouvries
The Probability Hypothesis Density (PHD) filter is a recent solution for tracking an unknown number of targets in a multi-object environment. The PHD filter cannot be computed exactly, but popular implementations include Gaussian Mixture (GM) and Sequential Monte Carlo (SMC) based algorithms. GM implementations suffer from pruning and merging approximations, but enable to extract the states easily; on the other hand, SMC implementations are of interest if the discrete approximation is relevant, but are penalized by the difficulty to guide particles towards promising regions and to extract the states. In this paper, we propose a mixed GM/SMC implementation of the PHD filter which does not suffer from the above mentioned drawbacks. Due to the SMC part, our algorithm can be used in models where the GM implementation is unavailable; but it also benefits from the easy state extraction of GM techniques, without requiring pruning or merging approximations. Our algorithm is validated on simulations.
{"title":"A mixed GM/SMC implementation of the probability hypothesis density filter","authors":"Y. Petetin, F. Desbouvries","doi":"10.1109/ISSPA.2012.6310588","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310588","url":null,"abstract":"The Probability Hypothesis Density (PHD) filter is a recent solution for tracking an unknown number of targets in a multi-object environment. The PHD filter cannot be computed exactly, but popular implementations include Gaussian Mixture (GM) and Sequential Monte Carlo (SMC) based algorithms. GM implementations suffer from pruning and merging approximations, but enable to extract the states easily; on the other hand, SMC implementations are of interest if the discrete approximation is relevant, but are penalized by the difficulty to guide particles towards promising regions and to extract the states. In this paper, we propose a mixed GM/SMC implementation of the PHD filter which does not suffer from the above mentioned drawbacks. Due to the SMC part, our algorithm can be used in models where the GM implementation is unavailable; but it also benefits from the easy state extraction of GM techniques, without requiring pruning or merging approximations. Our algorithm is validated on simulations.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"211 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":"117281482","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.6310661
Nahal Nejat, P. Mathieu, M. Bertrand
To facilitate the use of upper limb myoelectric prostheses, we investigated if and how muscle compartments, i.e intra-muscular subdivisions each innervated by a nerve branch, could be voluntarily contracted. Five pairs of electrodes were positioned across the short head of the biceps brachii and 5 others across its long head. Electromyographic signals from 4 able subjects were collected. They produced voluntary isometric and isotonic contractions with the arm kept in different positions while the hand was either fully supinated, neutral or fully pronated. Root mean square value of the signals, from the 5 electrode pairs across the long and short heads were averaged. Depending on the task, activity was found larger in one head or in the other. Being able to activate either head of the biceps, while not yet completely independently, suggests that the selective use of compartments could be a possible avenue for controlling myoelectric prostheses.
{"title":"Differential activation of the biceps brachii heads in normal subjects","authors":"Nahal Nejat, P. Mathieu, M. Bertrand","doi":"10.1109/ISSPA.2012.6310661","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310661","url":null,"abstract":"To facilitate the use of upper limb myoelectric prostheses, we investigated if and how muscle compartments, i.e intra-muscular subdivisions each innervated by a nerve branch, could be voluntarily contracted. Five pairs of electrodes were positioned across the short head of the biceps brachii and 5 others across its long head. Electromyographic signals from 4 able subjects were collected. They produced voluntary isometric and isotonic contractions with the arm kept in different positions while the hand was either fully supinated, neutral or fully pronated. Root mean square value of the signals, from the 5 electrode pairs across the long and short heads were averaged. Depending on the task, activity was found larger in one head or in the other. Being able to activate either head of the biceps, while not yet completely independently, suggests that the selective use of compartments could be a possible avenue for controlling myoelectric prostheses.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"50 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":"123630342","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.6310452
P. Cardinal, Gilles Boulianne, P. Dumouchel
The speed of modern processors has remained constant over the last few years but the integration capacity continues to follow Moore's law and thus, to be scalable, applications must be parallelized. In addition to the main CPU, almost every computer is equipped with a Graphics Processors Unit (GPU) which is in essence a specialized parallel processor. This paper explore how performance of speech recognition systems can be enhanced by using the A* algorithm which allows better parallelization over the Viterbi algorithm and a GPU for the acoustic computations in large vocabulary applications. First experiments with a “unigram approximation” heuristic resulted in approximatively 8.7 times less states being explored compared to our classical Viterbi decoder. The multi-thread implementation of the A* decoder combined with GPU for acoustic computation led to a speed-up factor of 5.2 over its sequential counterpart and an improvement of 5% absolute of the accuracy over the sequential Viterbi search at real-time.
{"title":"The A* speech recognition system on parallel architectures","authors":"P. Cardinal, Gilles Boulianne, P. Dumouchel","doi":"10.1109/ISSPA.2012.6310452","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310452","url":null,"abstract":"The speed of modern processors has remained constant over the last few years but the integration capacity continues to follow Moore's law and thus, to be scalable, applications must be parallelized. In addition to the main CPU, almost every computer is equipped with a Graphics Processors Unit (GPU) which is in essence a specialized parallel processor. This paper explore how performance of speech recognition systems can be enhanced by using the A* algorithm which allows better parallelization over the Viterbi algorithm and a GPU for the acoustic computations in large vocabulary applications. First experiments with a “unigram approximation” heuristic resulted in approximatively 8.7 times less states being explored compared to our classical Viterbi decoder. The multi-thread implementation of the A* decoder combined with GPU for acoustic computation led to a speed-up factor of 5.2 over its sequential counterpart and an improvement of 5% absolute of the accuracy over the sequential Viterbi search at real-time.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"4 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":"123704279","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.6310577
Chin-Sheng Chen, C. Yeh
This paper develops an efficient dilation-based clustering algorithm (DBCA) by using run-length encoding (RLE). The fundamental concept of dilation-based connectivity and its limitation are described in the beginning. Subsequently, the architecture of DBCA is constructed in the following procedures: (1) run-length encoding, (2) RLE-based morphological operation, (3) RLE-based component detection algorithm, (4) relationship construction, and (5) re-labeling connection. The details of these five procedures performed in DBCA are then discussed in detail. DBCA is further applied in the post-processing of anti-reflection (AR) glass defect detection in order to justify its practicability. Finally, the experimental results indicate that this algorithm can successfully overcome the effects of broken defects for AR glass if an appropriate structure element is selected. Moreover, the performance evaluation further shows that DBCA can be applied in the real application as a post-processing of defect inspection.
{"title":"An efficient dilation-based clustering algorithm for automatic optical inspection","authors":"Chin-Sheng Chen, C. Yeh","doi":"10.1109/ISSPA.2012.6310577","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310577","url":null,"abstract":"This paper develops an efficient dilation-based clustering algorithm (DBCA) by using run-length encoding (RLE). The fundamental concept of dilation-based connectivity and its limitation are described in the beginning. Subsequently, the architecture of DBCA is constructed in the following procedures: (1) run-length encoding, (2) RLE-based morphological operation, (3) RLE-based component detection algorithm, (4) relationship construction, and (5) re-labeling connection. The details of these five procedures performed in DBCA are then discussed in detail. DBCA is further applied in the post-processing of anti-reflection (AR) glass defect detection in order to justify its practicability. Finally, the experimental results indicate that this algorithm can successfully overcome the effects of broken defects for AR glass if an appropriate structure element is selected. Moreover, the performance evaluation further shows that DBCA can be applied in the real application as a post-processing of defect inspection.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"115 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":"124083514","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.6310666
Dan Shen, Erik Blasch, K. Pham, Genshe Chen
Image segmentation decomposes a given image into segments, i.e. regions containing “similar” pixels, that aids computer vision applications such as face, medical, and fingerprint recognition as well as scene characterization. Effective segmentation requires domain knowledge or strategies for object designation as no universal segmentation algorithm exists. In this paper, we propose a holistic framework to perform image segmentation in color space. Our approach unifies the linear smoothing filter, a similarity calculation in selected color space, and a clustering game model with various evolution dynamics. In our framework, the problem of image segmentation can be considered as a “clustering game”. Within this context, the notion of a cluster turns out to be equivalent to a classical equilibrium concept from game theory, as the game equilibrium reflects both the internal and external cluster conditions. Experiments on image segmentation problems show the superiority of the proposed clustering game based image segmentation framework (CGBISF) using both the Berkeley segmentation dataset and infrared images (for which, we need to perform color fusion first) in autonomy, speed, and efficiency.
{"title":"A clustering game based framework for image segmentation","authors":"Dan Shen, Erik Blasch, K. Pham, Genshe Chen","doi":"10.1109/ISSPA.2012.6310666","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310666","url":null,"abstract":"Image segmentation decomposes a given image into segments, i.e. regions containing “similar” pixels, that aids computer vision applications such as face, medical, and fingerprint recognition as well as scene characterization. Effective segmentation requires domain knowledge or strategies for object designation as no universal segmentation algorithm exists. In this paper, we propose a holistic framework to perform image segmentation in color space. Our approach unifies the linear smoothing filter, a similarity calculation in selected color space, and a clustering game model with various evolution dynamics. In our framework, the problem of image segmentation can be considered as a “clustering game”. Within this context, the notion of a cluster turns out to be equivalent to a classical equilibrium concept from game theory, as the game equilibrium reflects both the internal and external cluster conditions. Experiments on image segmentation problems show the superiority of the proposed clustering game based image segmentation framework (CGBISF) using both the Berkeley segmentation dataset and infrared images (for which, we need to perform color fusion first) in autonomy, speed, and efficiency.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"75 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":"127279351","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.6310501
P. Blache, H. Rabah, A. Amira
In this paper we present a novel hardware architecture for reconstruction of signals in compressed sensing. The proposed architecture is based on the orthogonal matching pursuit (OMP) algorithm which has been modeled with Simulink and implemented on FPGA using Xilinx system generator. The main aim is to optimize both area and execution time. The execution time is reduced by exploiting parallelism inside each kernel, where the area is reduced by reusing several operators such as matrix vector multiplication. Hardware implementation on the Virtex5 FPGA has shown excellent results compared to existing implementations. Moreover, our solution achieves a speedup of 38 compared to a software solution on the Intel core duo CPU.
{"title":"High level prototyping and FPGA implementation of the orthogonal matching pursuit algorithm","authors":"P. Blache, H. Rabah, A. Amira","doi":"10.1109/ISSPA.2012.6310501","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310501","url":null,"abstract":"In this paper we present a novel hardware architecture for reconstruction of signals in compressed sensing. The proposed architecture is based on the orthogonal matching pursuit (OMP) algorithm which has been modeled with Simulink and implemented on FPGA using Xilinx system generator. The main aim is to optimize both area and execution time. The execution time is reduced by exploiting parallelism inside each kernel, where the area is reduced by reusing several operators such as matrix vector multiplication. Hardware implementation on the Virtex5 FPGA has shown excellent results compared to existing implementations. Moreover, our solution achieves a speedup of 38 compared to a software solution on the Intel core duo CPU.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"331 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":"132495115","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.6310635
P. Zicari, A. Amira, Georg Fischer, J. Mclaughlin
In this paper a complete system for on field testing of the human identification using Electrocardiograms (ECG) biometric is proposed. The enrollment and test procedures are realized in software, while the recognition is implemented in real time on an embedded platform. It uses the wearable Vitalsens wireless sensor with ECG electrodes placed on the chest of the person to be identified, the ECG sensors communicate via Bluetooth with the LM058 Bluetooth adapter connected to the RS232 interface of the RC10 Field Programmable Gate Array (FPGA) prototyping board. A new human identification method based on the fiducial independent feature extraction from ECG signals is implemented on the low power Spartan 3L FPGA chip available on the board. The Principal Component Analysis (PCA) is exploited to select the main significant features. The projected ECG signals on the principal components are then compared by using the Euclidian distance metric. By occupying just the 45% of logic resources and 75% of the BRAM blocks, the embedded system reaches an identification accuracy of 90%.
{"title":"An embedded system for on field testing of human identification using ECG biometric","authors":"P. Zicari, A. Amira, Georg Fischer, J. Mclaughlin","doi":"10.1109/ISSPA.2012.6310635","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310635","url":null,"abstract":"In this paper a complete system for on field testing of the human identification using Electrocardiograms (ECG) biometric is proposed. The enrollment and test procedures are realized in software, while the recognition is implemented in real time on an embedded platform. It uses the wearable Vitalsens wireless sensor with ECG electrodes placed on the chest of the person to be identified, the ECG sensors communicate via Bluetooth with the LM058 Bluetooth adapter connected to the RS232 interface of the RC10 Field Programmable Gate Array (FPGA) prototyping board. A new human identification method based on the fiducial independent feature extraction from ECG signals is implemented on the low power Spartan 3L FPGA chip available on the board. The Principal Component Analysis (PCA) is exploited to select the main significant features. The projected ECG signals on the principal components are then compared by using the Euclidian distance metric. By occupying just the 45% of logic resources and 75% of the BRAM blocks, the embedded system reaches an identification accuracy of 90%.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"17 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":"131960320","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.6310477
Shiying Dong, G. Azemi, B. Lingwood, P. Colditz, B. Boashash
Accurate instantaneous frequency (IF) estimation of the non-stationary heart rate signal is important in quantifying the heart rate variability (HRV) measures. This study compares the effectiveness of four IF estimation methods in analyzing HRV signals. Specifically, they are the direct localization of the maximal peaks in the signal time-frequency distribution (TFD), IF estimation based on component linking technique in the TFD, IF estimation using the TFD with optimal windows based on intersection of confidence intervals rule and complex demodulation. Results of applying the IF estimation methods to synthesized and real piglet HRV signals reveal that, the approach using component linking technique outperform the other techniques with respect to the accuracy and implementation. It provides new insights in studying the evolution of the autonomic nervous regulation of the cardiovascular function over time.
{"title":"Performance evaluation of multi-component instantaneous frequency estimation techniques for heart rate variability analysis","authors":"Shiying Dong, G. Azemi, B. Lingwood, P. Colditz, B. Boashash","doi":"10.1109/ISSPA.2012.6310477","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310477","url":null,"abstract":"Accurate instantaneous frequency (IF) estimation of the non-stationary heart rate signal is important in quantifying the heart rate variability (HRV) measures. This study compares the effectiveness of four IF estimation methods in analyzing HRV signals. Specifically, they are the direct localization of the maximal peaks in the signal time-frequency distribution (TFD), IF estimation based on component linking technique in the TFD, IF estimation using the TFD with optimal windows based on intersection of confidence intervals rule and complex demodulation. Results of applying the IF estimation methods to synthesized and real piglet HRV signals reveal that, the approach using component linking technique outperform the other techniques with respect to the accuracy and implementation. It provides new insights in studying the evolution of the autonomic nervous regulation of the cardiovascular function over time.","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":"127906230","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
扫码关注我们
求助内容：
应助结果提醒方式：