Pub Date : 1900-01-01DOI: 10.1109/SIPS.2005.1579956
J. H. Han, A. Erdogan, T. Arslan
The authors present a low power and area efficient turbo soft-input soft-output (SISO) decoder based on two-step soft-output Viterbi algorithm (SOVA) targeting wireless mobile communication systems. Our turbo SISO decoder is based on trace back algorithm (TBA) and saves area and power by replacing the FIFO memory with an additional transition metric unit (TMU). The paper presents the implementation of SOVA decoder for constraint lengths K=3, 4, and 5, describing the design methodology and evaluation environment. Simulation results are provided showing up to 20% power saving and 46% area saving compared to a conventional SOVA decoder implementation.
{"title":"Power and area efficient turbo decoder implementation for mobile wireless systems","authors":"J. H. Han, A. Erdogan, T. Arslan","doi":"10.1109/SIPS.2005.1579956","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579956","url":null,"abstract":"The authors present a low power and area efficient turbo soft-input soft-output (SISO) decoder based on two-step soft-output Viterbi algorithm (SOVA) targeting wireless mobile communication systems. Our turbo SISO decoder is based on trace back algorithm (TBA) and saves area and power by replacing the FIFO memory with an additional transition metric unit (TMU). The paper presents the implementation of SOVA decoder for constraint lengths K=3, 4, and 5, describing the design methodology and evaluation environment. Simulation results are provided showing up to 20% power saving and 46% area saving compared to a conventional SOVA decoder implementation.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129932779","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579913
H. Ebrahimnezhad, H. Ghassemian
This paper proposes a new approach to reconstruct the visual hull of rigid object using its silhouettes captured by virtual cameras during time. The main idea of this work is to improve the quality of reconstruction by combing the advantages of different methods. Structure from silhouette, structure from motion and depth from stereo are popular methods in 3D reconstruction. But all of these methods suffer from some drawbacks. For example stereo matching fails to extract depth in low contrast regions but it works well in edge regions. Structure from silhouette can be employed to extract 3D shape of texture less object but it needs a lot of cameras to do fine. In this paper a robust feature based stereo matching of multi camera images is used to find the exact place of some sparse feature points on the surface of object. These 3D feature points are then employed to estimate six motion parameters in the next sequence. New virtual cameras are constructed by multiplying the calibration matrix to motion matrix in each frame. So, a lot of cameras can be constructed for the moving object during time. After all, the cone intersection method is used to extract the bounding edges visual hull from all the silhouettes captured by virtual cameras.
{"title":"Combining the feature based stereo matching, motion and silhouette to reconstruct visual hull","authors":"H. Ebrahimnezhad, H. Ghassemian","doi":"10.1109/SIPS.2005.1579913","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579913","url":null,"abstract":"This paper proposes a new approach to reconstruct the visual hull of rigid object using its silhouettes captured by virtual cameras during time. The main idea of this work is to improve the quality of reconstruction by combing the advantages of different methods. Structure from silhouette, structure from motion and depth from stereo are popular methods in 3D reconstruction. But all of these methods suffer from some drawbacks. For example stereo matching fails to extract depth in low contrast regions but it works well in edge regions. Structure from silhouette can be employed to extract 3D shape of texture less object but it needs a lot of cameras to do fine. In this paper a robust feature based stereo matching of multi camera images is used to find the exact place of some sparse feature points on the surface of object. These 3D feature points are then employed to estimate six motion parameters in the next sequence. New virtual cameras are constructed by multiplying the calibration matrix to motion matrix in each frame. So, a lot of cameras can be constructed for the moving object during time. After all, the cone intersection method is used to extract the bounding edges visual hull from all the silhouettes captured by virtual cameras.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128475193","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579952
Fengling Li, N. Ling
Scalable video coding using motion-compensated temporal filtering is one of the latest trends in video coding standardization. In the lifting based motion-compensated temporal filtering framework, such as that in the joint scalable video model (JSVM), the data used in the update steps are basically the residuals from the motion-compensated prediction. When the motion model used in the prediction steps fails to capture the true motion, energy in the high-pass temporal frames becomes substantial and strong ghosting artifacts may be introduced to the low-pass frames during the update steps. In this paper we propose a new block-based update approach, which takes advantage of the chrominance information of the video sequence to further reduce ghosting artifacts in low-pass temporal frames. We adaptively weight the update steps according to the energy not only of luminance pixels, but also of chrominance pixels in the high-pass temporal frames at the corresponding locations. Experimental results show that the proposed algorithm can significantly improve the quality of the reconstructed video sequence, in PSNR and visual quality.
{"title":"Adaptively weighted update steps using chrominance for scalable video coding","authors":"Fengling Li, N. Ling","doi":"10.1109/SIPS.2005.1579952","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579952","url":null,"abstract":"Scalable video coding using motion-compensated temporal filtering is one of the latest trends in video coding standardization. In the lifting based motion-compensated temporal filtering framework, such as that in the joint scalable video model (JSVM), the data used in the update steps are basically the residuals from the motion-compensated prediction. When the motion model used in the prediction steps fails to capture the true motion, energy in the high-pass temporal frames becomes substantial and strong ghosting artifacts may be introduced to the low-pass frames during the update steps. In this paper we propose a new block-based update approach, which takes advantage of the chrominance information of the video sequence to further reduce ghosting artifacts in low-pass temporal frames. We adaptively weight the update steps according to the energy not only of luminance pixels, but also of chrominance pixels in the high-pass temporal frames at the corresponding locations. Experimental results show that the proposed algorithm can significantly improve the quality of the reconstructed video sequence, in PSNR and visual quality.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"02 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129882298","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579934
Lei Wang
Presented in this paper is a low-complexity iris identification architecture built upon an enhanced periodicity transform., referred to as the prime subspace periodicity transform (PSPT). The proposed PSPT achieves efficient computation by partitioning periodic subspaces into hierarchical prime subspaces. Data decomposition at prime subspaces can be implemented in a simple manner by exploiting the redundancy in correlation computation. The proposed PSPT establishes a theoretical foundation for our work in developing integrated biometric systems for identity authentication. A PSPT-based iris identification architecture is developed that achieves 32.1% - 56.2% reduction in computational complexity. Experimental results demonstrate an efficient solution for reliable and accurate iris identification. The proposed PSPT algorithm in combination with architecture optimizations address the challenges in single-chip implementation of biometric systems.
{"title":"Algorithm optimization and architectural design of periodicity transform for biometric applications","authors":"Lei Wang","doi":"10.1109/SIPS.2005.1579934","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579934","url":null,"abstract":"Presented in this paper is a low-complexity iris identification architecture built upon an enhanced periodicity transform., referred to as the prime subspace periodicity transform (PSPT). The proposed PSPT achieves efficient computation by partitioning periodic subspaces into hierarchical prime subspaces. Data decomposition at prime subspaces can be implemented in a simple manner by exploiting the redundancy in correlation computation. The proposed PSPT establishes a theoretical foundation for our work in developing integrated biometric systems for identity authentication. A PSPT-based iris identification architecture is developed that achieves 32.1% - 56.2% reduction in computational complexity. Experimental results demonstrate an efficient solution for reliable and accurate iris identification. The proposed PSPT algorithm in combination with architecture optimizations address the challenges in single-chip implementation of biometric systems.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123154883","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579861
A. Fabrice, F. Nicolas
One recent trend in robotic aircraft has been the development of embedded sensors inspired by biology, in particular optic flow sensors for use in collision avoidance, stabilization and other visual guidance tasks. Optic flow is determined here by elementary motion detectors (EMDs) whose principle is based on the results of an electrophysiological analysis of visual neurons in the housefly. To achieve small embedded optical flow sensors, we have applied a top-down methodology to integrate several EMDs in a small field programmable gate array (FPGA) that is driven by an array of photoreceptors.
{"title":"Optic flow sensors for robots: elementary motion detectors based on FPGA","authors":"A. Fabrice, F. Nicolas","doi":"10.1109/SIPS.2005.1579861","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579861","url":null,"abstract":"One recent trend in robotic aircraft has been the development of embedded sensors inspired by biology, in particular optic flow sensors for use in collision avoidance, stabilization and other visual guidance tasks. Optic flow is determined here by elementary motion detectors (EMDs) whose principle is based on the results of an electrophysiological analysis of visual neurons in the housefly. To achieve small embedded optical flow sensors, we have applied a top-down methodology to integrate several EMDs in a small field programmable gate array (FPGA) that is driven by an array of photoreceptors.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121303990","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579875
B. Heyne, Jurgen Gotze
Future terminals for CDMA will have to employ multiuser detection to implement high data rate modes such as HSDPA in the UTRA/3GPP standard. Therefore efficient and flexible detection algorithms are needed. In B. Heyne et al, (2003) we have already shown an approach of such an equalizer for single user detection. The principle algorithm of this equalizer has now been extended to a multiuser detector, which can make use of the same Cordic based platform as the original equalizer. The paper shows that our approach has got a significant performance increase in comparison to a standard Rake based equalizer, whereas the computational complexity remains roughly the same.
{"title":"A Cordic based equalizer for multiuser detection in WCDMA systems","authors":"B. Heyne, Jurgen Gotze","doi":"10.1109/SIPS.2005.1579875","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579875","url":null,"abstract":"Future terminals for CDMA will have to employ multiuser detection to implement high data rate modes such as HSDPA in the UTRA/3GPP standard. Therefore efficient and flexible detection algorithms are needed. In B. Heyne et al, (2003) we have already shown an approach of such an equalizer for single user detection. The principle algorithm of this equalizer has now been extended to a multiuser detector, which can make use of the same Cordic based platform as the original equalizer. The paper shows that our approach has got a significant performance increase in comparison to a standard Rake based equalizer, whereas the computational complexity remains roughly the same.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114532774","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579926
Li-Fu Ding, Shao-Yi Chien, Liang-Gee Chen
3D video will become noticeable video technology in the next generation. In this paper, a stereo video coding system is proposed from algorithm level to hardware architecture level. We propose a novel stereo video coding system by exploiting joint block compensation scheme to achieve high coding efficiency. It is also suitable for hardware implementation. Due to more than twice computational complexity relative to mono video coding systems, a new hardware architecture based on hierarchical search block matching algorithm (HSBMA) with some modification is proposed. With special data flow, no bubble cycles exist during block matching process. Proposed architecture also adopts near overlapped candidates reuse scheme (NOCRS) to save heavy burden of data access. Besides, by the proposed new scheduling, both on-chip memory requirement and offchip memory bandwidth can be reduced. A prototype chip can achieve real-time requirement under the operating frequency of 81 MHz for 30 D1 frames per second (fps) in left and right channel simultaneously, with ME/DE search range of [-64, +63] in horizontal direction and [-32, +31]/[-16, +15] in vertical direction. Compared with the hardware requirement for implementation of full search block matching algorithm (FSBMA), only 11.5% on-chip SRAM and 1/30 amount of PEs are needed. It shows that the hardware cost is quite small.
{"title":"Algorithm and architecture of prediction core in stereo video hybrid coding system","authors":"Li-Fu Ding, Shao-Yi Chien, Liang-Gee Chen","doi":"10.1109/SIPS.2005.1579926","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579926","url":null,"abstract":"3D video will become noticeable video technology in the next generation. In this paper, a stereo video coding system is proposed from algorithm level to hardware architecture level. We propose a novel stereo video coding system by exploiting joint block compensation scheme to achieve high coding efficiency. It is also suitable for hardware implementation. Due to more than twice computational complexity relative to mono video coding systems, a new hardware architecture based on hierarchical search block matching algorithm (HSBMA) with some modification is proposed. With special data flow, no bubble cycles exist during block matching process. Proposed architecture also adopts near overlapped candidates reuse scheme (NOCRS) to save heavy burden of data access. Besides, by the proposed new scheduling, both on-chip memory requirement and offchip memory bandwidth can be reduced. A prototype chip can achieve real-time requirement under the operating frequency of 81 MHz for 30 D1 frames per second (fps) in left and right channel simultaneously, with ME/DE search range of [-64, +63] in horizontal direction and [-32, +31]/[-16, +15] in vertical direction. Compared with the hardware requirement for implementation of full search block matching algorithm (FSBMA), only 11.5% on-chip SRAM and 1/30 amount of PEs are needed. It shows that the hardware cost is quite small.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134538459","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579967
Yongmei Dai, Zhiyuan Yan
Due to the regular structures of quasi-cyclic (QC) low-density parity-check (LDPC) codes, the message passing decoding of these codes not only has efficient hardware implementation, but also can be overlapped to improve throughput and hardware utilization efficiency (HUE). In previous work, we proposed a scheduling scheme for the overlapped message passing (OMP) decoding of the SFT codes. In this paper, we first show that our scheduling scheme produces the minimum intra-iteration waiting time for QC LDPC codes. Then we propose a coset-based construction of QC LDPC codes, and study the girth and minimum distance properties of our new codes. Given the same parameters, the ensemble of the SFT codes is a subset of the ensemble of our coset-based QC LDPC codes. Our coset-based QC LDPC codes allow the OMP decoding to achieve greater throughput gain and higher HUE while maintaining the same theoretical performances as the SFT codes.
{"title":"Coset-based quasi-cyclic LDPC codes for optimal overlapped message passing decoding","authors":"Yongmei Dai, Zhiyuan Yan","doi":"10.1109/SIPS.2005.1579967","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579967","url":null,"abstract":"Due to the regular structures of quasi-cyclic (QC) low-density parity-check (LDPC) codes, the message passing decoding of these codes not only has efficient hardware implementation, but also can be overlapped to improve throughput and hardware utilization efficiency (HUE). In previous work, we proposed a scheduling scheme for the overlapped message passing (OMP) decoding of the SFT codes. In this paper, we first show that our scheduling scheme produces the minimum intra-iteration waiting time for QC LDPC codes. Then we propose a coset-based construction of QC LDPC codes, and study the girth and minimum distance properties of our new codes. Given the same parameters, the ensemble of the SFT codes is a subset of the ensemble of our coset-based QC LDPC codes. Our coset-based QC LDPC codes allow the OMP decoding to achieve greater throughput gain and higher HUE while maintaining the same theoretical performances as the SFT codes.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115199694","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579911
Wenjie Shu, Zhiqiang Zheng
Traditional speech enhancement techniques are commonly spectral methods, which frequently result in audible distortion of the signal. In this paper, a neural network based time-domain method called dual particle filter (dual PF) is proposed for speech enhancement, which consists of two PFs run concurrently. At each time-step, two PFs estimate both the state and model from only noisy observations respectively. We apply this method on the speech enhancement in the presence of both white (stationary and nonstationary) and colored noise. The experiments show that the approach performs significantly better than the traditional techniques on the reduction of white noise, and performs well in the presence of stationary colored as well.
{"title":"Neural dual particle filter and its application in speech enhancement","authors":"Wenjie Shu, Zhiqiang Zheng","doi":"10.1109/SIPS.2005.1579911","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579911","url":null,"abstract":"Traditional speech enhancement techniques are commonly spectral methods, which frequently result in audible distortion of the signal. In this paper, a neural network based time-domain method called dual particle filter (dual PF) is proposed for speech enhancement, which consists of two PFs run concurrently. At each time-step, two PFs estimate both the state and model from only noisy observations respectively. We apply this method on the speech enhancement in the presence of both white (stationary and nonstationary) and colored noise. The experiments show that the approach performs significantly better than the traditional techniques on the reduction of white noise, and performs well in the presence of stationary colored as well.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639583","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 : 1900-01-01DOI: 10.1109/SIPS.2005.1579910
A. S. Zandi, M. Moradi
The objective of this paper is to investigate the performance of a fuzzy classifier, designed using nearest neighborhood clustering, in detection of ventricular late potentials (VLPs) when it uses the feature vectors extracted from a vector magnitude (VM) waveform based on the discrete wavelet transform (DWT). VLPs are low-amplitude, high-frequency signals which appear at the terminal part of the QRS complex in the high-resolution ECG (HRECG) signal and may be used as a non-invasive marker for patients prone to ventricular tachycardia (VT). In this research, the fuzzy classifier performance was investigated with two types of the time-domain feature vectors were extracted from the end part of the QRS complex in the wavelet-based VM waveform. These feature vectors were fed to the fuzzy classifier and a multilayer perceptron (MLP) simultaneously. The results show that the fuzzy classifier can detect VLPs better than the MLP neural network with less computational complexity.
{"title":"High-resolution ECG analysis: a fuzzy approach to detect ventricular late potentials using a wavelet-based vector magnitude waveform","authors":"A. S. Zandi, M. Moradi","doi":"10.1109/SIPS.2005.1579910","DOIUrl":"https://doi.org/10.1109/SIPS.2005.1579910","url":null,"abstract":"The objective of this paper is to investigate the performance of a fuzzy classifier, designed using nearest neighborhood clustering, in detection of ventricular late potentials (VLPs) when it uses the feature vectors extracted from a vector magnitude (VM) waveform based on the discrete wavelet transform (DWT). VLPs are low-amplitude, high-frequency signals which appear at the terminal part of the QRS complex in the high-resolution ECG (HRECG) signal and may be used as a non-invasive marker for patients prone to ventricular tachycardia (VT). In this research, the fuzzy classifier performance was investigated with two types of the time-domain feature vectors were extracted from the end part of the QRS complex in the wavelet-based VM waveform. These feature vectors were fed to the fuzzy classifier and a multilayer perceptron (MLP) simultaneously. The results show that the fuzzy classifier can detect VLPs better than the MLP neural network with less computational complexity.","PeriodicalId":436123,"journal":{"name":"IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124181614","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
扫码关注我们
求助内容：
应助结果提醒方式：