Search results for "algorithm."
showing 10 items of 4617 documents
Mutual nonlinear prediction of cardiovascular variability series: Comparison between exogenous and autoregressive exogenous models
2007
A model-based approach to perform mutual nonlinear prediction of short cardiovascular variability series is presented. The approach is based on identifying exogenous (X) and autoregressive exogenous (ARX) models by K-nearest neighbors local linear approximation, and estimates the predictability of a series given the other as the squared correlation between original and predicted values of the series. The method was first tested on simulations reproducing different types of interaction between non-identical Henon maps, and then applied to heart rate (HR) and blood pressure (BP) variability series measured in healthy subjects at rest and after head-up tilt. Simulations showed that different c…
Bivariate nonlinear prediction to quantify the strength of complex dynamical interactions in short-term cardiovascular variability.
2005
A nonlinear prediction method for investigating the dynamic interdependence between short length time series is presented. The method is a generalization to bivariate prediction of the univariate approach based on nearest neighbor local linear approximation. Given the input and output series x and y, the relationship between a pattern of samples of x and a synchronous sample of y was approximated with a linear polynomial whose coefficients were estimated from an equation system including the nearest neighbor patterns in x and the corresponding samples in y. To avoid overfitting and waste of data, the training and testing stages of the prediction were designed through a specific out-of-sampl…
A Robust Generic Method for Grid Detection in White Light Microscopy Malassez Blade Images in the Context of Cell Counting
2015
AbstractIn biology, cell counting is a primary measurement and it is usually performed manually using hemocytometers such as Malassez blades. This work is tedious and can be automated using image processing. An algorithm based on Fourier transform filtering and the Hough transform was developed for Malassez blade grid extraction. This facilitates cell segmentation and counting within the grid. For the present work, a set of 137 images with high variability was processed. Grids were accurately detected in 98% of these images.
Automatic program for peak detection and deconvolution of multi-overlapped chromatographic signals
2005
Several interlinked algorithms for peak deconvolution by non-linear regression are presented. These procedures, together with the peak detection methods outlined in Part I, have allowed the implementation of an automatic method able to process multi-overlapped signals, requiring little user interaction. A criterion based on the evaluation of the multivariate selectivity of the chromatographic signal is used to auto-select the most efficient deconvolution procedure for each chromatographic situation. In this way, non-optimal local solutions are avoided in cases of high overlap, and short computation times are obtained in situations of high resolution. A new algorithm, fitting both the origin…
Deconvolution by Regularized Matching Pursuit
2014
In this chapter, an efficient method that restores signals from strongly noised blurred discrete data is presented. The method can be characterized as a Regularized Matching Pursuit (RMP), where dictionaries consist of spline wavelet packets. It combines ideas from spline theory, wavelet analysis and greedy algorithms. The main distinction from the conventional matching pursuit is that different dictionaries are used to test the data and to approximate the solution. In addition, oblique projections of data onto dictionary elements are used instead of orthogonal projections, which are used in the conventional Matching Pursuit (MP). The slopes of the projections and the stopping rule for the …
Iterative sparse matrix-vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi-graphics processing unit systems
2012
SUMMARY The block Wiedemann (BW) algorithm is frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix–vector multiplication is the most time-consuming operation. The necessity to accelerate this step is motivated by the application of BW to very large matrices used in the linear algebra step of the number field sieve (NFS) for integer factorization. In this paper, we derive an efficient CUDA implementation of this operation by using a newly designed hybrid sparse matrix format. This leads to speedups between 4 and 8 on a single graphics processing unit (GPU) for a number of tested NFS matrices compared with an optimized multicore implementation. We further present…
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
Channel Estimation and Interference Cancellation for MIMO-OFDM Systems
2007
This paper proposes a new channel estimation method and a new interference cancellation scheme for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems in the presence of intersymbol interference (IS1). The proposed channel estimation method uses special training sequences (TSs) to have a desirable crest-factor of the transmitted training signal, and to prevent the influence of ISI on the channel estimation performance. By using the recommended training sequences, the ill-conditioned problem of the least square (LS) filter integrated in the proposed channel estimator can be avoided. The proposed interference cancellation scheme uses the estimated cha…
Performance Analysis of STBC-OFDM Systems in Temporally or Spatially Correlated Fading Channels
2010
This paper analyzes the performance of space-time block coded orthogonal frequency division multiplexing (OFDM) systems. In our analysis, we abandon the usually made assumption of quasi-static channel conditions. Instead of this, we consider the more general and realistic case that the channel envelope changes during two consecutive transmission time slots. In addition, we take the spatial correlation between sub-channels into account. We first present a general formal expression for the bit error probability (BEP), from which we find analytical solutions for the BEP not only for temporally fading channels but also for spatially correlated channels. The knowledge of the obtained analytical …
Design of efficient codes for the AWGN channel based on decomposable binary lattices
1998
This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded‐distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.