Arrhythmia detection algorithms require the exact and instantaneous detection of fiducial points in the ECG signal. These fiducial points (QRS-complex, P- and T-wave) correspond to distinct cardiac contraction phases....
详细信息
ISBN:
(纸本)9781509030880
Arrhythmia detection algorithms require the exact and instantaneous detection of fiducial points in the ECG signal. These fiducial points (QRS-complex, P- and T-wave) correspond to distinct cardiac contraction phases. The performance evaluation of different fiducial points detection algorithms require the existence of large databases (DBs) encompassing reference annotations. Up to last year, P- and T-wave annotations were only available for the QT DB. This was addressed by Elgendi et al. who provided P- and T-wave annotations to the MIT-BIH arrhythmia DB. A variety of ECG fiducial points detection algorithms exists in literature, whereas, to the best knowledge of the authors, we could not identify any single-lead algorithm ready for instantaneous P- and T-wave detection. In this work, we present three P- and T-wave detection algorithms: a revised version for QRS detection using line fitting capable to detect P- and T-wave, an expeditious version of a wavelet based ECG delineation algorithm, and a fast naive fiducial points detection algorithm. The fast naive fiducial points detection algorithm performed best on both DBs with sensitivities ranging from 73.0% (P-wave detection, error interval of ± 40 ms) to 89.4% (T-wave detection, error interval of ± 80 ms). As this algorithm detects a wave event in every search window, it has to be investigated how this affects arrhythmia detection algorithms. The reference Matlab implementations are available for download to encourage the development of high-accurate and automated ECG processing algorithms for the integration in daily life using mobile computers.
The multiband target detection algorithms implemented in hyperspectral imaging systems represent perhaps the most successful example of image fusion. A core suite of such signal processing methods that fuse spectral c...
详细信息
The multiband target detection algorithms implemented in hyperspectral imaging systems represent perhaps the most successful example of image fusion. A core suite of such signal processing methods that fuse spectral channels has been implemented in an operational system; more systems are planned. Stricter performance requirements for future remote sensing applications will be met by evolutionary improvements on these techniques. Here we first describe the operational methods and then the related next generation nonlinear methods, whose performance is currently being evaluated. Next we show how a "dual" representation of these algorithms can serve as a springboard to a radically new direction in algorithm research. Using nonlinear mathematics borrowed from machine learning concepts, we show how hyperspectral data from a high-dimensional spectral space can be transformed onto a manifold of even higher dimension, in which robust decision surfaces can be more easily generated. Such surfaces, when projected back into spectral space, appear as enveloping blankets that circumscribe clutter distributions in a way that the standard, covariance-based methods cannot. This property may permit the design of extremely low false-alarm rate solutions to remote detection problems
In stereo algorithms with more than two cameras, the improvement of accuracy in correspondence search is often reported. On the other hand, another important aspect of the polynocular stereo is the ability of occlusio...
详细信息
In stereo algorithms with more than two cameras, the improvement of accuracy in correspondence search is often reported. On the other hand, another important aspect of the polynocular stereo is the ability of occlusion detection. The camera matrix stereo SEA, which we have developed, offers a simple but effective framework to detect the presence of occlusion and to obtain reliable correspondence. SEA can produce a dense and accurate depth map with sharp object profiles. In this paper, we made some systematic comparison of several algorithms for occlusion detection in SEA. The results are quite interesting and reasonable. They are useful to design an actual polynocular stereo system.
A novel algorithm based on classical cepstrum calculation followed by dynamic programming is presented in this paper. The algorithm has been evaluated with a 60-minutes database containing 60 speakers and different re...
详细信息
A novel algorithm based on classical cepstrum calculation followed by dynamic programming is presented in this paper. The algorithm has been evaluated with a 60-minutes database containing 60 speakers and different recording conditions and environments. A second reference database has also been used. In addition, the performance of four popular PDA algorithms has been evaluated with the same databases. The results prove the good performance of the described algorithm in noisy conditions. Furthermore, the paper is a first initiative to perform an evaluation of widely used PDA algorithms over an extensive and realistic database.
In this paper, we take a brief review of the different approaches used for ship detection in polarimetric synthetic aperture radar (POL-SAR) images. After an introduction of the standard polarimetric detectors (SPDs) ...
详细信息
In this paper, we take a brief review of the different approaches used for ship detection in polarimetric synthetic aperture radar (POL-SAR) images. After an introduction of the standard polarimetric detectors (SPDs) used in polarimetric detection for general targets, four main types of polarimetric detection algorithms with special respect to ship targets are summarized: the coherent target decomposition algorithm (CTD), polarimetric entropy (PE) algorithm, polarimetric detectors based on fusion, and segmentation based polarimetric method. Preliminary conclusion is drawn from the performance comparison of each type and indicates how these algorithms applied for ship targets respectively.
Symmetry exists widely in the real world and plays a remarkable role in perception problems. Fast and effective symmetry detection is still a difficult problem in computer vision. Typical image symmetry detectors are ...
详细信息
Symmetry exists widely in the real world and plays a remarkable role in perception problems. Fast and effective symmetry detection is still a difficult problem in computer vision. Typical image symmetry detectors are analyzed. From the viewpoint of information used, the literatures on image symmetry detection are analyzed systematically. And symmetry detectors can be categorized to two kinds, that is, gradient-based ones and phase-based ones. Characteristics of each kind are discussed. The key issues of the important symmetry detectors are explained extensively and comprehensively. Based on the survey, some open issues, which needed to be researched further, are presented, and the future research trends are also given.
This research mainly aims on the comparative analysis of existing popular machine learning algorithms for Dysgraphia detection such as Naive Bayes, KNN (K-Nearest Neighbours), SVM (Support Vector Machine), Decision tr...
详细信息
This research mainly aims on the comparative analysis of existing popular machine learning algorithms for Dysgraphia detection such as Naive Bayes, KNN (K-Nearest Neighbours), SVM (Support Vector Machine), Decision tree, Random Forest. The evaluation of these algorithms is done on four measure performance measure namely accuracy, precision, F1 score and recall. The comparative statics obtained from the present study depict that although these algorithms are capable to detect dysgraphia upto some extent still there arises a need to develop more effective algorithms for the same at early stages.
We report on the design and simulation of novel algorithms which will ensure that application software runs correctly on a MIMD system in which processing units (PU) can fail. The effect of these algorithms is evaluat...
详细信息
We report on the design and simulation of novel algorithms which will ensure that application software runs correctly on a MIMD system in which processing units (PU) can fail. The effect of these algorithms is evaluated for random task graphs using simulation as failure rates increase. An example of a specific application is also examined (the Fast Fourier Transform) for which we construct the task graph and then simulate its execution under various values of the failure rates of processors.
The authors present an approach to distributed workload analysis which can be used as a basis for the performance study of distributed deadlock detection algorithms. In particular, the expected number of times a deadl...
详细信息
The authors present an approach to distributed workload analysis which can be used as a basis for the performance study of distributed deadlock detection algorithms. In particular, the expected number of times a deadlock detection algorithm is locally initiated and the subsequent number of remote invocations are derived. Simulation work was done to validate the approach.< >
The segmentation of video sequences into shots is the first step towards video content analysis. Two kinds of shot boundaries can be distinguished: abrupt scene changes ("cuts") and gradual transitions. In t...
详细信息
The segmentation of video sequences into shots is the first step towards video content analysis. Two kinds of shot boundaries can be distinguished: abrupt scene changes ("cuts") and gradual transitions. In this paper, we present a technique to reduce the error rates of cut detection algorithms based on pixel-wise or histogram-based frame difference metrics when operating directly on compressed MPEG video data. The proposed approach, called "frame difference normalization" (FDN), intends to eliminate the effects of a specific frame pattern in MPEG streams responsible for causing such errors. Experimental results will be presented to demonstrate the benefits of our proposal and its superiority over a more general noise filter. Furthermore, the proposed method is not limited to a particular algorithm but it is applicable to an entire class of cut detection algorithms.
暂无评论