There has been much interest in mining anomaly patterns in time series. However, different datasets may have different lengths of anomaly patterns, and usually, the length of anomaly patterns is unknown. This paper us...
详细信息
There has been much interest in mining anomaly patterns in time series. However, different datasets may have different lengths of anomaly patterns, and usually, the length of anomaly patterns is unknown. This paper uses k-distance of a pattern and median to define anomaly factor, the degree of anomaly, presents- definition- of- anomaly pattern based on it and two algorithms, algorithm 1 and algorithm 2. Algorithm 1 uses quadratic regression to segment time series, and obtains the range of length patterns. Algorithm 2 uses DTW (dynamic time warping) and variable methods to calculate similarity of patterns dynamically, detects anomaly patterns in a given time series automatically. We demonstrate the effectiveness of our detection algorithm for anomaly patterns with both synthetic and ECGs data sets, and the experimental results confirm that our methods can detect anomaly patterns with different lengths.
Seizures in the intensive care unit (ICU) tend to go unnoticed due to the absence of appropriate EEG monitoring systems resulting in high levels of mortality. This paper looks at the requirements of an automated EEG m...
详细信息
Seizures in the intensive care unit (ICU) tend to go unnoticed due to the absence of appropriate EEG monitoring systems resulting in high levels of mortality. This paper looks at the requirements of an automated EEG monitoring system for use in the ICU. It also investigates the current state of knowledge and highlights areas in need of further work.
In ALV system, obstacle detection algorithm is one of the most important research fields and obstacle segmentation is a key factor in obstacle detection approaches. In this paper, a simple and fast segmentation approa...
详细信息
In ALV system, obstacle detection algorithm is one of the most important research fields and obstacle segmentation is a key factor in obstacle detection approaches. In this paper, a simple and fast segmentation approach is proposed for ALV system based on binocular stereo vision. Firstly, a simple method is applied to binarize the images by the defined binarization function; Secondly, in order to save the computation time of gray mean of pixels in squared window, the method of reduce the redundant computation is applied in our algorithm; Lastly, in order to avoid the affection of inner region of obstacle objects, the outer contour tracing algorithm is applied to get the outer contour of likely obstacle in binarized images, as a result, the likely obstacle objects are segmented. Several images captured from ALV system is used to test the proposed algorithm, the result indicate that the approach is valid and feasible.
Based on analysis on video retrieval issues among different time scales, a dynamic time warping (DTW) optimal matching algorithm is proposed in this paper. Firstly the sub-segments detection algorithm was used to sepa...
详细信息
Based on analysis on video retrieval issues among different time scales, a dynamic time warping (DTW) optimal matching algorithm is proposed in this paper. Firstly the sub-segments detection algorithm was used to separate the video into several consecutive sub-segments; furthermore, the video similarity matching algorithm on the basis of sub-segments was used to implement the retrieval process. The proposed algorithm establishes sub-segment correspondences by minimizing global differences between them, introduces search bound to change the whole searching to local searching, keeps temporal order of sub-segments and handles nonlinear misalignment of videos. It not only can successfully matching similar videos which have different time scales, but also meet the demand of rapid retrieval among massive video database. Experimental results show that the proposed algorithm is more efficient and robust than the conventional similarity matching algorithm based on visual similarity.
This paper presents a low-complexity, bit-level deterministic sequential Monte Carlo (DSMC) detection algorithm for MIMO systems that employ large signal constellations. The proposed algorithm employs natural mapping ...
详细信息
This paper presents a low-complexity, bit-level deterministic sequential Monte Carlo (DSMC) detection algorithm for MIMO systems that employ large signal constellations. The proposed algorithm employs natural mapping signals and the QR decomposition of augmented composite channel matrix to convert the DSMC algorithm to the bit-level DSMC algorithm. For M-QAM signal constellation, the computational complexity of the proposed algorithm is linear with modulation order, while the existing DSMC algorithms have an exponential increasing complexity with the modulation order. Simulation results show that the bit-level DSMC algorithm can achieve almost the same BER performance as the existing DSMC algorithms with lower complexity.
A successive interference cancellation (SIC) algorithm based on breadth-first search (BFS) is developed to achieve a soft-input soft-output detector via the tree structure of the MIMO system model in this paper. Inste...
详细信息
A successive interference cancellation (SIC) algorithm based on breadth-first search (BFS) is developed to achieve a soft-input soft-output detector via the tree structure of the MIMO system model in this paper. Instead of visiting all nodes of the tree, the proposed BFS-SIC algorithm only browses and extends those paths with large metrics. If paths are enough, the performance of BFS-SIC algorithm can approach that of sphere decoding but is much more flexible due to its providing a good tradeoff between complexity and performance. Moreover, the BFS-SIC algorithm possesses path metrics including only scalar operations rather than matrix operations. Simulation results demonstrate the effectiveness of the proposed algorithm.
We used principal component analysis to derive the respiratory rate from single lead ECGs. In this algorithm the respiratory induced beat-to-beat variability of the ECG is described by the coefficients of the principa...
详细信息
We used principal component analysis to derive the respiratory rate from single lead ECGs. In this algorithm the respiratory induced beat-to-beat variability of the ECG is described by the coefficients of the principal components. Subjects were asked to breathe at different rates and naturally while respiration and ECG were recorded. Breathing rate, determined by Fourier analysis, was compared for the ECG derived respiration obtained by principal component analysis and the recorded respiratory signal. Across the different breathing patterns the mean absolute differences between reference respiratory rate and ECG respiratory rate were 0.2 breaths per minute (bpm) or less. In all cases the respiratory rate was accurately determined from respiratory surrogates derived from principal component analysis of the single lead ECGs.
Mammogram segmentation tasks underpin a wide range of registration, temporal analysis and detection algorithms. Unfortunately, finding an accurate, robust and efficient segmentation still remains a challenging problem...
详细信息
Mammogram segmentation tasks underpin a wide range of registration, temporal analysis and detection algorithms. Unfortunately, finding an accurate, robust and efficient segmentation still remains a challenging problem in mammography. A recent segmentation technique, based on minimum spanning trees (MST segmentation), is known to be robust to typical mammogram distortions and computationally efficient. This method captures both local and global image information but the balance requires choosing a parameter. So far no automatic procedure to estimate this parameter has been proposed and the value was determined experimentally. In this paper a segmentation evaluation criterion, based on a measure of image entropy, is used to automatically optimize the granularity of an MST-based segmentation. The method is tested on a set of 82 random images taken from a commonly used mammogram database. The results show a dramatic improvement in the accuracy of a MST segmentation tuned up using the entropy-based criterion.
We present an efficient acquisition algorithm for a next-generation multi-band orthogonal frequency division multiplexing (MB-OFDM) ultra wideband (UWB) system. The simulation results show that the proposed packet det...
详细信息
We present an efficient acquisition algorithm for a next-generation multi-band orthogonal frequency division multiplexing (MB-OFDM) ultra wideband (UWB) system. The simulation results show that the proposed packet detection algorithm which employs both an M-sample time delayed cross correlation value, and a received signal power calculated by using the received input samples less than zero padding (ZP) outperforms the conventional packet detection algorithms.
We propose a new adaptive K-best algorithm for MIMO systems where the number of survivor paths, A is changed based on the degree of the reliability of Zero-Forcing (ZF) estimates at each K-best step. The critical draw...
详细信息
We propose a new adaptive K-best algorithm for MIMO systems where the number of survivor paths, A is changed based on the degree of the reliability of Zero-Forcing (ZF) estimates at each K-best step. The critical drawback of the fixed K-best detection is that the correct path's metric may be temporarily larger than K minimum paths metrics due to imperfect interference cancellation by the incorrect ZF estimates. So, the conventional variable K-best schemes control A according to measured SNR value. However, these schemes still have the problem that needs to accurately and dynamically measure SNR for optimal setting of A. In the proposed variable scheme, we accomplish adaptation of K without necessity of SNR measurement. It is found that the ratio of the minimum path metric to the second minimum is a good reliability indicator for the channel condition. By adaptively changing K based on this ratio, the proposed scheme effectively achieves the performance of large K-best system while maintaining the overall average computation complexity much smaller than that of large K-best system without the necessity of SNR value estimation.
暂无评论