Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Robustness”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,153 records · Page 64Linked to original sources
PubMed2001

The G-algorithm for extraction of robust decision rules--children's postoperative intra-atrial arrhythmia case study.

Clinical medicine is facing a challenge of knowledge discovery from the growing volume of data. In this paper, a data mining algorithm (G-algorithm) is proposed for extraction of robust rules that can be used in clinical practice for better understanding and prevention of unwanted medical events. The G-algorithm is applied to the data set obtained for children born with a malformation of the heart (univentricular heart). As the result of the Fontan surgical procedure, designed to palliate the children, 10%-35% of patients postoperatively develop an arrhythmia known as the intra-atrial reentrant tachycardia. There is an obvious need to identify the children that may develop the tachycardia before the surgery is performed. Prior attempts to identify such children with statistical techniques have been unrewarding. The G-algorithm discussed in this paper shows that there exists an unambiguous relationship between measurable features and the tachycardia. The data set used in this study shows that, for 78.08% of infants, the occurrence of tachycardia can be accurately predicted. The authors' prior computational experience with diverse medical data sets indicates that the percentage of accurate predictions may become even higher if data on additional features is collected for a larger data set.

Algorithms↗
PubMed2004

A robust DSP integrator for accelerometer signals.

The need for an accepted method for determining position data from digital accelerometer readings with known frequency range is very important. The method of this paper uses spectral information and provides more stability and accuracy than classic methods for the DSP case. It even reduces to a classic method for the nonoscillatory case. Examples show the robustness of the method, overcoming the instability apparent with other integration methods.

Acceleration↗
PubMed2004

Robust algorithm for estimation of time-varying transfer functions.

We introduce a new method to estimate reliable time-varying (TV) transfer functions (TFs) and TV impulse response functions. The method is based on TV autoregressive moving average models in which the TV parameters are accurately obtained using the optimal parameter search method which we have previously developed. The new method is more accurate than the recursive least-squares (RLS), and remains robust even in the case of significant noise contamination. Furthermore, the new method is able to track dynamics that change abruptly, which is certainly a deficiency of the RLS. Application of the new method to renal blood pressure and flow revealed that hypertensive rats undergo more complex and TV autoregulation in maintaining stable blood flow than do normotensive rats. This observation has not been previously revealed using time-invariant TF analyses. The newly developed approach may promote the broader use of TV system identification in studies of physiological systems and makes linear and nonlinear TV modeling possible in certain cases previously thought intractable.

Algorithms↗
PubMed2005

Robust time delay estimation of bioelectric signals using least absolute deviation neural network.

The time delay estimation (TDE) is an important issue in modern signal processing and it has found extensive applications in the spatial propagation feature extraction of biomedical signals as well. Due to the extreme complexity and variability of the underlying systems, biomedical signals are usually nonstationary, unstable and even chaotic. Furthermore, due to the limitations of the measurement environments, biomedical signals are often noise-contaminated. Therefore, the TDE of biomedical signals is a challenging issue. A new TDE algorithm based on the least absolute deviation neural network (LADNN) and its application experiments are presented in this paper. The LADNN is the neural implementation of the least absolute deviation (LAD) optimization model, also called unconstrained minimum L1-norm model, with a theoretically proven global convergence. In the proposed LADNN-based TDE algorithm, a given signal is modeled using the moving average (MA) model. The MA parameters are estimated by using the LADNN and the time delay corresponds to the time index at which the MA coefficients have a peak. Due to the excellent features of L1-norm model superior to Lp-norm (p > 1) models in non-Gaussian noise environments or even in chaos, especially for signals that contain sharp transitions (such as biomedical signals with spiky series or motion artifacts) or chaotic dynamic processes, the LADNN-based TDE is more robust than the existing TDE algorithms based on wavelet-domain correlation and those based on higher-order spectra (HOS). Unlike these conventional methods, especially the current state-of-the-art HOS-based TDE, the LADNN-based method is free of the assumption that the signal is non-Gaussian and the noises are Gaussian and, thus, it is more applicable in real situations. Simulation experiments under three different noise environments, Gaussian, non-Gaussian and chaotic, are conducted to compare the proposed TDE method with the existing HOS-based method. Real application experiment is conducted to extract time delay information between every two adjacent channels of gastric myoelectrical activity (GMA) to assess the spatial propagation characteristics of GMA during different phases of the migrating myoelectrical complex (MMC).

Algorithms↗
PubMed2005

Automated design of robust discriminant analysis classifier for foot pressure lesions using kinematic data.

In the recent years, the use of motion tracking systems for acquisition of functional biomechanical gait data, has received increasing interest due to the richness and accuracy of the measured kinematic information. However, costs frequently restrict the number of subjects employed, and this makes the dimensionality of the collected data far higher than the available samples. This paper applies discriminant analysis algorithms to the classification of patients with different types of foot lesions, in order to establish an association between foot motion and lesion formation. With primary attention to small sample size situations, we compare different types of Bayesian classifiers and evaluate their performance with various dimensionality reduction techniques for feature extraction, as well as search methods for selection of raw kinematic variables. Finally, we propose a novel integrated method which fine-tunes the classifier parameters and selects the most relevant kinematic variables simultaneously. Performance comparisons are using robust resampling techniques such as Bootstrap 632+ and k-fold cross-validation. Results from experimentations with lesion subjects suffering from pathological plantar hyperkeratosis, show that the proposed method can lead to approximately 96% correct classification rates with less than 10% of the original features.

Adult↗
PubMed2006

A robust method for estimating respiratory flow using tracheal sounds entropy.

The relationship between respiratory sounds and flow is of great interest for researchers and physicians due to its diagnostic potentials. Due to difficulties and inaccuracy of most of the flow measurement techniques, several researchers have attempted to estimate flow from respiratory sounds. However, all of the proposed methods heavily depend on the availability of different rates of flow for calibrating the model, which makes their use limited by a large degree. In this paper, a robust and novel method for estimating flow using entropy of the band pass filtered tracheal sounds is proposed. The proposed method is novel in terms of being independent of the flow rate chosen for calibration; it requires only one breath for calibration and can estimate any flow rate even out of the range of calibration flow. After removing the effects of heart sounds (which distort the low-frequency components of tracheal sounds) on the calculated entropy of the tracheal sounds, the performance of the method at different frequency ranges were investigated. Also, the performance of the proposed method was tested using 6 different segment sizes for entropy calculation and the best segment sizes during inspiration and expiration were found. The method was tested on data of 10 healthy subjects at five different flow rates. The overall estimation error was found to be 8.3 +/- 2.8% and 9.6 +/- 2.8% for inspiration and expiration phases, respectively.

Adult↗
PubMed2006

A robust method for spike sorting with automatic overlap decomposition.

Spike sorting is the mandatory first step in analyzing multiunit recording signals for studying information processing mechanisms within the nervous system. Extracellular recordings usually contain overlapped spikes produced by a number of neurons adjacent to the electrode, together with unknown background noise, which in turn induce some difficulties in neural signal identification. In this paper, we propose a robust method to deal with these problems, which employs an automatic overlap decomposition technique based on the relaxation algorithm that requires simple fast Fourier transforms. The performance of the presented system was tested at various signal-to-noise ratio levels based on synthetic data that were generated from real recordings.

Action Potentials↗
PubMed2006

An algorithm for robust and efficient location of T-wave ends in electrocardiograms.

The purpose of this paper is to propose a new algorithm for T-wave end location in electrocardiograms, mainly through the computation of an indicator related to the area covered by the T-wave curve. Based on simple assumptions, essentially on the concavity of the T-wave form, it is formally proved that the maximum of the computed indicator inside each cardiac cycle coincides with the T-wave end. Moreover, the algorithm is robust to acquisition noise, to wave form morphological variations and to baseline wander. It is also computationally very simple: the main computation can be implemented as a simple finite impulse response filter. When evaluated with the PhysioNet QT database in terms of the mean and the standard deviation of the T-wave end location errors, the proposed algorithm outperforms the other algorithms evaluated with the same database, according to the most recent available publications up to our knowledge.

Algorithms↗
PubMed2004

Applying informed coding and embedding to design a robust high-capacity watermark.

We describe a new watermarking system based on the principles of informed coding and informed embedding. This system is capable of embedding 1380 bits of information in images with dimensions 240 x 368 pixels. Experiments on 2000 images indicate the watermarks are robust to significant valumetric distortions, including additive noise, low-pass filtering, changes in contrast, and lossy compression. Our system encodes watermark messages with a modified trellis code in which a given message may be represented by a variety of different signals, with the embedded signal selected according to the cover image. The signal is embedded by an iterative method that seeks to ensure the message will not be confused with other messages, even after addition of noise. Fidelity is improved by the incorporation of perceptual shaping into the embedding process. We show that each of these three components improves performance substantially.

Algorithms↗
PubMed2004

Robust rotation-invariant texture classification using a model based approach.

In this paper, a model based texture classification procedure is presented. The texture is modeled as the output of a linear system driven by a binary image. This latter retains the morphological characteristics of the texture and it is specified by its spatial autocorrelation function (ACF). We show that features extracted from the ACF of the binary excitation suffice to represent the texture for classification purposes. Specifically, we employ a moment invariants based technique to classify the ACF. The resulting proposed classification procedure is thus inherently rotation invariant. Moreover, it is robust with respect to additive noise. Experimental results show that this approach allows obtaining high correct rotation-invariant classification rates while containing the size of the feature space.

Algorithms↗
PubMed2004

Robust image-adaptive data hiding using erasure and error correction.

Information-theoretic analyses for data hiding prescribe embedding the hidden data in the choice of quantizer for the host data. In this paper, we propose practical realizations of this prescription for data hiding in images, with a view to hiding large volumes of data with low perceptual degradation. The hidden data can be recovered reliably under attacks, such as compression and limited amounts of image tampering and image resizing. The three main findings are as follows. 1) In order to limit perceivable distortion while hiding large amounts of data, hiding schemes must use image-adaptive criteria in addition to statistical criteria based on information theory. 2) The use of local criteria to choose where to hide data can potentially cause desynchronization of the encoder and decoder. This synchronization problem is solved by the use of powerful, but simple-to-implement, erasures and errors correcting codes, which also provide robustness against a variety of attacks. 3) For simplicity, scalar quantization-based hiding is employed, even though information-theoretic guidelines prescribe vector quantization-based methods. However, an information-theoretic analysis for an idealized model is provided to show that scalar quantization-based hiding incurs approximately only a 2-dB penalty in terms of resilience to attack.

Algorithms↗
PubMed2005

Multiframe selective information fusion from robust error estimation theory.

A dynamic procedure for selective information fusion from multiple image frames is derived from robust error estimation theory. The fusion rate is driven by the anisotropic gain function, defined to be the difference between the Gaussian smoothed-edge maps of a given input frame and of an evolving synthetic output frame. The gain function achieves both selection and rapid fusion of relatively sharper features from each input frame compared to the synthetic frame. Effective applications are demonstrated for image sharpening in imaging through atmospheric turbulence, for multispectral fusion of the RGB spectral components of a scene, for removal of blurred visual obstructions from in front of a distant focused scene, and for high-resolution two-dimensional display of three-dimensional objects in microscopy.

Algorithms↗
PubMed2005

A robust structure-adaptive hybrid vector filter for color image restoration.

A robust structure-adaptive hybrid vector filter is proposed for digital color image restoration in this paper. At each pixel location, the image vector (i.e., pixel) is first classified into several different signal activity categories by applying a modified quadtree decomposition to luminance component (image) of the input color image. A weight-adaptive vector filtering operation with an optimal window is then activated to achieve the best tradeoff between noise suppression and detail preservation. Through extensive simulation experiments conducted using a wide range of test color images, the filter has demonstrated superior performance to that of a number of well known benchmark techniques, in terms of both standard objective measurements and perceived image quality, in suppressing several distinct types of noise commonly considered in color image restoration, including Gaussian noise, impulse noise, and mixed noise.

Algorithms↗
PubMed2006

Robust human detection within a highly dynamic aquatic environment in real time.

This paper presents a real-time foreground detection method for monitoring swimming activities at an outdoor swimming pool. Robust performance and high accuracy of detecting objects-of-interest are two central issues of concern. Therefore, in this paper, a considerable amount of attention has been placed on the following aspects: 1) to establish a better method of modeling aquatic background, which exhibitis dynamic characteristics with random spatial movements, and 2) to establish a method of enhancing the visibility of the foreground by removing specular reflection at nighttime. First, the development of a new background modeling method is reported. In the proposed approach, the background is modeled as a composition of homogeneous blob movements. With an implementation of a spatial searching process, the proposed method shows capability in associating and distinguishing movements caused by the background. Hence, this contributes to better performance in foreground detection. On the issue of enhancing the visibility of the foreground, a decision-based filtering scheme is proposed as a preprocessing step. A defined concept term, fluctuation measure, is defined for classifying each pixel to be one of the predefined types. This has allowed suitable spatial or spatiotemporal filters to be applied accordingly for color the compensation step. All of these developments are evaluated by testing live on a busy Olympic-size outdoor public swimming pool. Both qualitative and quantitative evaluations are reported. This provides a comprehensive study of the system.

Algorithms↗
PubMed2006

Robust regression of scattered data with adaptive spline-wavelets.

A coarse-to-fine data fitting algorithm for irregularly spaced data based on boundary-adapted adaptive tensor-product semi-orthogonal spline-wavelets has been proposed in Castaño and Kunoth, 2003. This method has been extended in Castaño and Kunoth, 2005 to include regularization in terms of Sobolev and Besov norms. In this paper, we develop within this least-squares approach some statistical robust estimators to handle outliers in the data. Our wavelet scheme yields a numerically fast and reliable way to detect outliers.

Algorithms↗
PubMed2006

Blind MPEG-2 video watermarking robust against geometric attacks: a set of approaches in DCT domain.

A set of robust MPEG-2 video watermarking techniques is proposed, focusing on commonly used typical geometric processing for bit-rate reduction, cropping, removal of any rows, arbitrary-ratio downscaling, and frame dropping. Both the embedding and the extraction of watermarks are done in the compressed domain, so the computational cost is low. Moreover, the watermark extraction is blind, i.e., no original unwatermarked MPEG-2 video is needed for watermark extraction. The presented technique is applicable not only to MPEG-2 video, but also to other DCT-based coding videos. Selected experimental results validate our techniques.

Algorithms↗
PubMed2006

Robust contour matching via the order-preserving assignment problem.

A common approach to determining corresponding points on two shapes is to compute the cost of each possible pairing of points and solve the assignment problem (weighted bipartite matching) for the resulting cost matrix. We consider the problem of solving for point correspondences when the shapes of interest are each defined by a single, closed contour. A modification of the standard assignment problem is proposed whereby the correspondences are required to preserve the ordering of the points induced from the shapes' contours. Enforcement of this constraint leads to significantly improved correspondences. Robustness with respect to outliers and shape irregularity is obtained by required only a fraction of feature points to be matched. Furthermore, the minimum matching size may be specified in advance. We present efficient dynamic programming algorithms to solve the proposed optimization problem. Experiments on the Brown and MPEG-7 shape databases demonstrate the effectiveness of the proposed method relative to the standard assignment problem.

Algorithms↗
PubMed2006

Still-image watermarking robust to local geometric distortions.

Geometrical distortions are the Achilles heel for many watermarking schemes. Most countermeasures proposed in the literature only address the problem of global affine transforms (e.g., rotation, scaling, and translation). In this paper, we propose an original blind watermarking algorithm robust to local geometrical distortions such as the deformations induced by Stirmark. Our method consists in adding a predefined additional information to the useful message bits at the insertion step. These additional bits are labeled as resynchronization bits or reference bits and they are modulated in the same way as the information bits. During the extraction step, the reference bits are used as anchor points to estimate and compensate for small local and global geometrical distortions. The deformations are approximated using a modified basic optical flow algorithm.

Algorithms↗