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 523 records · Page 29Linked to original sources

Training recurrent neurocontrollers for robustness with derivative-free Kalman filter.

We are interested in training neurocontrollers for robustness on discrete-time models of physical systems. Our neurocontrollers are implemented as recurrent neural networks (RNNs). A model of the system to be controlled is known to the extent of parameters and/or signal uncertainties. Parameter values are drawn from a known distribution. For each instance of the model with specified parameters, a recurrent neurocontroller is trained by evaluating sensitivities of the model outputs to perturbations of the neurocontroller weights and incrementally updating the weights. Our training process strives to minimize a quadratic cost function averaged over many different models. In the end, the process yields a robust recurrent neurocontroller, which is ready for deployment with fixed weights. We employ a derivative-free Kalman filter algorithm proposed by Norgaard et al. and extended by Feldkamp et al. (2001) and Feldkamp et al. (2002) to neural network training. Our training algorithm combines effectiveness of a second-order training method with universal applicability to both differentiable and nondifferentiable systems. Our approach is that of model reference control, and it extends significantly the capabilities proposed by Prokhorov et al. (2001). We illustrate it with two examples.

Algorithms↗

Robustness of shape descriptors to incomplete contour representations.

With inspiration from psychophysical researches of the human visual system, we propose a novel aspect and a method for performance evaluation of contour-based shape recognition algorithms regarding their robustness to incompleteness of contours. We use complete contour representations of objects as a reference (training) set. Incomplete contour representations of the same objects are used as a test set. The performance of an algorithm is reported using the recognition rate as a function of the percentage of contour retained. We call this evaluation procedure the ICR test. We consider three types of contour incompleteness, viz. segment-wise contour deletion, occlusion, and random pixel depletion. As an illustration, the robustness of two shape recognition algorithms to contour incompleteness is evaluated. These algorithms use a shape context and a distance multiset as local shape descriptors. Qualitatively, both algorithms mimic human visual perception in the sense that recognition performance monotonously increases with the degree of completeness and that they perform best in the case of random depletion and worst in the case of occluded contours. The distance multiset method performs better than the shape context method in this test framework.

Algorithms↗

Effective representation using ICA for face recognition robust to local distortion and partial occlusion.

The performance of face recognition methods using subspace projection is directly related to the characteristics of their basis images, especially in the cases of local distortion or partial occlusion. In order for a subspace projection method to be robust to local distortion and partial occlusion, the basis images generated by the method should exhibit a part-based local representation. We propose an effective part-based local representation method named locally salient ICA (LS-ICA) method for face recognition that is robust to local distortion and partial occlusion. The LS-ICA method only employs locally salient information from important facial parts in order to maximize the benefit of applying the idea of "recognition by parts." It creates part-based local basis images by imposing additional localization constraint in the process of computing ICA architecture I basis images. We have contrasted the LS-ICA method with other part-based representations such as LNMF (Localized Nonnegative Matrix Factorization) and LFA (Local Feature Analysis). Experimental results show that the LS-ICA method performs better than PCA, ICA architecture I, ICA architecture II, LFA, and LNMF methods, especially in the cases of partial occlusions and local distortions.

Algorithms↗

An information fusion framework for robust shape tracking.

Abstract-Existing methods for incorporating subspace model constraints in shape tracking use only partial information from the measurements and model distribution. We propose a unified framework for robust shape tracking, optimally fusing heteroscedastic uncertainties or noise from measurement, system dynamics, and a subspace model. The resulting nonorthogonal subspace projection and fusion are natural extensions of the traditional model constraint using orthogonal projection. We present two motion measurement algorithms and introduce alternative solutions for measurement uncertainty estimation. We build shape models offline from training data and exploit information from the ground truth initialization online through a strong model adaptation. Our framework is applied for tracking in echocardiograms where the motion estimation errors are heteroscedastic in nature, each heart has a distinct shape, and the relative motions of epicardial and endocardial borders reveal crucial diagnostic features. The proposed method significantly outperforms the existing shape-space-constrained tracking algorithm. Due to the complete treatment of heteroscedastic uncertainties, the strong model adaptation, and the coupled tracking of double-contours, robust performance is observed even on the most challenging cases.

Algorithms↗

Dynamic characterization of cluster structures for robust and inductive support vector clustering.

A topological and dynamical characterization of the cluster structures described by the support vector clustering is developed. It is shown that each cluster can be decomposed into its constituent basin level cells and can be naturally extended to an enlarged clustered domain, which serves as a basis for inductive clustering. A simplified weighted graph preserving the topological structure of the clusters is also constructed and is employed to develop a robust and inductive clustering algorithm. Simulation results are given to illustrate the robustness and effectiveness of the proposed method.

Algorithms↗

State observer based robust adaptive fuzzy controller for nonlinear uncertain and perturbed systems.

A robust adaptive fuzzy controller, based on a state observer, for a nonlinear uncertain and perturbed system is presented. The state observer is introduced to resolve the problem of the unavailability of the state variables. Two control signals are added to a basic state feedback control law, deduced from a nominal model, to guarantee the tracking performance in the presence of structural uncertainties and external disturbances. The first control signal is computed from an adaptive fuzzy system and eliminates the effect of structural uncertainties and estimation errors. Updating the adjustable parameters is ensured by a PID law to obtain a fast convergence. Robustness of the closed-loop system is guaranteed by an H infinity supervisor computed from a Riccati type equation. Simulation example is presented to show the efficiency of the proposed method.

Journal Article↗

Robust stability of interval bidirectional associative memory neural network with time delays.

In this paper, the conventional bidirectional associative memory (BAM) neural network with signal transmission delay is intervalized in order to study the bounded effect of deviations in network parameters and external perturbations. The resultant model is referred to as a novel interval dynamic BAM (IDBAM) model. By combining a number of different Lyapunov functionals with the Razumikhin technique, some sufficient conditions for the existence of unique equilibrium and robust stability are derived. These results are fairly general and can be verified easily. To go further, we extend our investigation to the time-varying delay case. Some robust stability criteria for BAM with perturbations of time-varying delays are derived. Besides, our approach for the analysis allows us to consider several different types of activation functions, including piecewise linear sigmoids with bounded activations as well as the usual C1-smooth sigmoids. We believe that the results obtained have leading significance in the design and application of BAM neural networks.

Journal Article↗

Robust adaptive neural network control of uncertain nonholonomic systems with strong nonlinear drifts.

In this paper, robust adaptive neural network (NN) control is presented to solve the control problem of nonholonomic systems in chained form with unknown virtual control coefficients and strong drift nonlinearities. The robust adaptive NN control laws are developed using state scaling and backstepping. Uniform ultimate boundedness of all the signals in the closed-loop are guaranteed, and the system states are proven to converge to a small neighborhood of zero. The control performance of the closed-loop system is guaranteed by appropriately choosing the design parameters. The proposed adaptive NN control is free of control singularity problem. An adaptive control based switching strategy is used to overcome the uncontrollability problem associated with x0 (t0) = 0. The simulation results demonstrate the effectiveness of the proposed controllers.

Artificial Intelligence↗

Range image segmentation into planar and quadric surfaces using an improved robust estimator and genetic algorithm.

This paper presents a novel range image segmentation method employing an improved robust estimator to iteratively detect and extract distinct planar and quadric surfaces. Our robust estimator extends M-estimator Sample Consensus/Random Sample Consensus (MSAC/RANSAC) to use local surface orientation information, enhancing the accuracy of inlier/outlier classification when processing noisy range data describing multiple structures. An efficient approximation to the true geometric distance between a point and a quadric surface also contributes to effectively reject weak surface hypotheses and avoid the extraction of false surface components. Additionally, a genetic algorithm was specifically designed to accelerate the optimization process of surface extraction, while avoiding premature convergence. We present thorough experimental results with quantitative evaluation against ground truth. The segmentation algorithm was applied to three real range image databases and competes favorably against eleven other segmenters using the most popular evaluation framework in the literature. Our approach lends itself naturally to parallel implementation and application in real-time tasks. The method fits well, into several of today's applications in man-made environments, such as target detection and autonomous navigation, for which obstacle detection, but not description or reconstruction, is required. It can also be extended to process point clouds resulting from range image registration.

Algorithms↗

A robust formulation of SAW Green's functions for arbitrarily thick multilayers at high frequencies.

This paper presents a robust formulation of SAW Green's functions for arbitrarily thick multilayers at high frequencies. The formulation is an alternative to that based on the transfer matrix method, which suffers from numerical instabilities when the frequency and/or thickness parameters become large. This numerical difficulty can be attributed to the mixture of exponentially growing and decaying terms during the transfer matrix calculations. To be more instructive, the numerical instability is delineated in terms of upward-bounded and downward-bounded waves within each layer. In accordance with such boundedness association, a recursive scheme not involving any growing terms is developed based on the scattering matrices to eliminate the instability. The resulting reflection matrix method is extremely concise and preserves the simplicity and convenience of the transfer matrix method. Using the reflection matrices, the generalized Green's functions that relate the particle velocity and the rate of electric potential change to the surface stress and charge are formulated succinctly. These Green's functions are useful for having incorporated the electrical properties of the vacuum above the surface. Numerical computations are exemplified to demonstrate the instabilities of the transfer matrix method and to justify the robustness of the reflection matrix formula.

Journal Article↗

Applying Taguchi dynamic characteristics to the robust design of a piezoelectric sensor.

It is important that measurement systems provide an accurate and robust performance over a wide range of input conditions. Under these conditions, the measurement system is said to have a robust design with dynamic characteristics. This paper adopts Taguchi's signal-to-noise ratio analysis to optimize the dynamic characteristics of a piezoelectric gas sensor system whose output response is linearly related to the input signal. The goal of the present dynamic characteristics study is to increase the sensitivity of the measurement system while simultaneously reducing its variability. This study focuses upon the conventional quartz crystal nanobalance (QCN) gas sensor. A time- and cost-efficient finite element analysis method is utilized to investigate the effects of the deposited mass upon the resonant frequency output of the QCN biosensor.

Journal Article↗

Application of Taguchi robust design method to SAW mass sensing device.

It is essential that measurement systems provide an accurate and robust performance over a wide range of input conditions. This paper adopts Taguchi's signal-to-noise ratio (SNR) analysis to develop a robust design for the Rayleigh surface acoustic wave (SAW) gas sensing device operated in a conventional delay-line configuration. The goal of the present Taguchi design activity is to increase the sensitivity of this sensor while simultaneously reducing its variability. A time- and cost-efficient finite-element analysis method is used to investigate the effects on the sensor's response output of variations in the carbon dioxide (CO2) gas deposited mass. The simulation results for the resonant frequency and wave mode analysis are all shown to be in good agreement with the values predicted theoretically.

Carbon Dioxide↗

A generally robust approach to hypothesis testing in independent and correlated groups designs.

Standard least squares analysis of variance methods suffer from poor power under arbitrarily small departures from normality and fail to control the probability of a Type I error when standard assumptions are violated. These problems are vastly reduced when using a robust measure of location; incorporating bootstrap methods can result in additional benefits. This paper illustrates the use of trimmed means with an approximate degrees of freedom heteroskedastic statistic for independent and correlated groups designs in order to achieve robustness to the biasing effects of nonnormality and variance heterogeneity. As well, we indicate when a boostrap methodology can be effectively employed to provide improved Type I error control. We also illustrate, with examples from the psychophysiological literature, the use of a new computer program to obtain numerical results for these solutions.

Algorithms↗

Robustness of group testing in the estimation of proportions.

In binomial group testing, unlike one-at-a-time testing, the test unit consists of a group of individuals, and each group is declared to be defective or nondefective. A defective group is one that is presumed to include one or more defective (e.g., infected, positive) individuals and a nondefective group to contain only nondefective individuals. The usual binomial model considers the individuals being grouped as independent and identically distributed Bernoulli random variables. Under the binomial model and presuming that groups are tested and classified without error, it has been shown that, when the proportion of defective individuals is low, group testing is often preferable to individual testing for identifying infected individuals and for estimating proportions of defectives. We discuss the robustness of group testing for estimating proportions when the underlying assumptions of (i) no testing errors and (ii) independent individuals are violated. To evaluate the effect of these model violations, two dilution-effect models and a serial correlation model are considered. Group testing proved to be quite robust to serial correlation. In the presence of a dilution effect, smaller group sizes should be used, but most of the benefits of group testing can still be realized.

AIDS Serodiagnosis↗

Efficiency robust tests for survival or ordered categorical data.

The selection of a single method of analysis is problematic when the data could have been generated by one of several possible models. We examine the properties of two tests designed to have high power over a range of models. The first one, the maximum efficiency robust test (MERT), uses the linear combination of the optimal statistics for each model that maximizes the minimum efficiency. The second procedure, called the MX, uses the maximum of the optimal statistics. Both approaches yield efficiency robust procedures for survival analysis and ordinal categorical data. Guidelines for choosing between them are provided.

Biometry↗

Combining band recovery data and Pollock's robust design to model temporary and permanent emigration.

Capture-recapture models are widely used to estimate demographic parameters of marked populations. Recently, this statistical theory has been extended to modeling dispersal of open populations. Multistate models can be used to estimate movement probabilities among subdivided populations if multiple sites are sampled. Frequently, however, sampling is limited to a single site. Models described by Burnham (1993, in Marked Individuals in the Study of Bird Populations, 199-213), which combined open population capture-recapture and band-recovery models, can be used to estimate permanent emigration when sampling is limited to a single population. Similarly, Kendall, Nichols, and Hines (1997, Ecology 51, 563-578) developed models to estimate temporary emigration under Pollock's (1982, Journal of Wildlife Management 46, 757-760) robust design. We describe a likelihood-based approach to simultaneously estimate temporary and permanent emigration when sampling is limited to a single population. We use a sampling design that combines the robust design and recoveries of individuals obtained immediately following each sampling period. We present a general form for our model where temporary emigration is a first-order Markov process, and we discuss more restrictive models. We illustrate these models with analysis of data on marked Canvasback ducks. Our analysis indicates that probability of permanent emigration for adult female Canvasbacks was 0.193 (SE = 0.082) and that birds that were present at the study area in year i - 1 had a higher probability of presence in year i than birds that were not present in year i - 1.

Animals↗

Marginally specified generalized linear mixed models: a robust approach.

Longitudinal data modeling is complicated by the necessity to deal appropriately with the correlation between observations made on the same individual. Building on an earlier nonrobust version proposed by Heagerty (1999, Biometrics 55, 688-698), our robust marginally specified generalized linear mixed model (ROBMS-GLMM) provides an effective method for dealing with such data. This model is one of the first to allow both population-averaged and individual-specific inference. As well, it adopts the flexibility and interpretability of generalized linear mixed models for introducing dependence but builds a regression structure for the marginal mean, allowing valid application with time-dependent (exogenous) and time-independent covariates. These new estimators are obtained as solutions of a robustified likelihood equation involving Huber's least favorable distribution and a collection of weights. Huber's least favorable distribution produces estimates that are resistant to certain deviations from the random effects distributional assumptions. Innovative weighting strategies enable the ROBMS-GLMM to perform well when faced with outlying observations both in the response and covariates. We illustrate the methodology with an analysis of a prospective longitudinal study of laryngoscopic endotracheal intubation, a skill that numerous health-care professionals are expected to acquire. The principal goal of our research is to achieve robust inference in longitudinal analyses.

Biometry↗

Robust design and the use of auxiliary variables in estimating population size for an open population.

We consider the problem of estimating the population size for an open population where the data are collected over secondary periods within primary periods according to a robust design suggested by Pollock (1982, Journal of Wildlife Management 46, 757-760). A conditional likelihood is used to estimate the parameters associated with a generalized linear model in which the capture probability is assumed to have a logistic form depending on individual covariates. A Horvitz-Thompson-type estimator is used to estimate the population size for each primary period and the survival probabilities between primary periods. The asymptotic properties of the proposed estimators are investigated through simulation and are found to perform well. A data set for such a robust design of a small-mammal capture-recapture study conducted at Dummy Bottom within Browns Park National Wildlife Refuge is analyzed.

Animals↗