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,189 records · Page 66Linked to original sources
PubMed2006

Combining reconstructive and discriminative subspace methods for robust classification and regression by subsampling.

Linear subspace methods that provide sufficient reconstruction of the data, such as PCA, offer an efficient way of dealing with missing pixels, outliers, and occlusions that often appear in the visual data. Discriminative methods, such as LDA, which, on the other hand, are better suited for classification tasks, are highly sensitive to corrupted data. We present a theoretical framework for achieving the best of both types of methods: An approach that combines the discrimination power of discriminative methods with the reconstruction property of reconstructive methods which enables one to work on subsets of pixels in images to efficiently detect and reject the outliers. The proposed approach is therefore capable of robust classification with a high-breakdown point. We also show that subspace methods, such as CCA, which are used for solving regression tasks, can be treated in a similar manner. The theoretical results are demonstrated on several computer vision tasks showing that the proposed approach significantly outperforms the standard discriminative methods in the case of missing pixels and images containing occlusions and outliers.

Algorithms↗
PubMed2006

Robust point matching for nonrigid shapes by preserving local neighborhood structures.

In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, however, the local relationship among neighboring points is stronger and more stable than the global one. In this paper, we introduce the lotion of a neighborhood structure for the general point matching problem. We formulate point matching as an optimization problem to preserve local neighborhood structures during matching. Our approach has a simple graph matching interpretation, where each point is a node in the graph, and two nodes are connected by an edge if they are neighbors. The optimal match between two graphs is the one that maximizes the number of matched edges. Existing techniques are leveraged to search for an optimal solution with the shape context distance used to initialize the graph matching, followed by relaxation labeling updates for refinement. Extensive experiments show the robustness of our approach under deformation, noise in point locations, outliers, occlusion, and rotation. It outperforms the shape context and TPS-RPM algorithms on most scenarios.

Algorithms↗
PubMed2007

Spatio-temporal context for robust multitarget tracking.

In multitarget tracking, the main challenge is to maintain the correct identity of targets even under occlusions or when differences between the targets are small. The paper proposes a new approach to this problem by incorporating the context information. The context of a target in an image sequence has two components: the spatial context including the local background and nearby targets and the temporal context including all appearances of the targets that have been seen previously. The paper considers both aspects. We propose a new model for multitarget tracking based on the classification of each target against its spatial context. The tracker searches a region similar to the target while avoiding nearby targets. The temporal context is included by integrating the entire history of target appearance based on probabilistic principal component analysis (PPCA). We have developed a new incremental scheme that can learn the full set of PPCA parameters accurately online. The experiments show robust tracking performance under the condition of severe clutter, occlusions, and pose changes.

Algorithms↗
PubMed2004

Adaptive and robust controller design for uncertain nonlinear systems via fuzzy modeling approach.

The issue for designing robust adaptive stabilizing controllers for nonlinear systems in Takagi-Sugeno fuzzy model with both parameter uncertainties and external disturbances is studied in this paper. It is assumed that the parameter uncertainties are norm-bounded and may be of some structure properties and that the external disturbances satisfy matching conditions and, besides, are also norm-bounded, but the bounds of the external disturbances are not necessarily known. Two adaptive controllers are developed based on linear matrix inequality technique and it is shown that the controllers can guarantee the state variables of the closed loop system to converge, globally, uniformly and exponentially, to a ball in the state space with any pre-specified convergence rate. Furthermore, the radius of the ball can also be designed to be as small as desired by tuning the controller parameters. The effectiveness of our approach is verified by its application in the control of a continuous stirred tank reactor.

Journal Article↗
PubMed2004

Guaranteed robust stability of the closed-loop systems for digital controller implementations via orthogonal hermitian transform.

In this paper, an approach for robust stability analysis of a digital closed-loop system for digital controller implementations subject to finite word length (FWL) effects is proposed. Uncertainties caused by the roundoff and computational errors subject to FWL effects are expressed in function of mantissa bit number when the mode of floating-point arithmetic is used in the process. Then, based on the Small Gain Theorem and the Bellman-Grownwall Lemma, a sufficient stability criterion for the digital closed-loop system is derived. The eigenvalue sensitivity of the closed-loop system is developed in terms of mixed matrix-2/Frobenius norms. Then, by minimizing this eigenvalue sensitivity and using orthogonal Hermitian transform as well, an optimal similarity transformation can be obtained. By substituting this optimal transformation into the stability criterion, a minimum mantissa bit number used for implementing the stabilizing digital controllers can be determined. The main contributions are that this approach provides an analytical closed-form solution for obtaining the optimal transformation and, in addition to the stability criterion, leads to the implementation of the stabilizing controllers with a lower mantissa bit number when using this optimal one. Finally, detailed numerical design processes and simulation results are used to illustrate the effectiveness of the proposed scheme.

Algorithms↗
PubMed2005

Robust fusion of uncertain information.

A technique is presented to combine n data points, each available with point-dependent uncertainty, when only a subset of these points come from N < n sources, where N is unknown. We detect the significant modes of the underlying multivariate probability distribution using a generalization of the nonparametric mean shift procedure. The number of detected modes automatically defines N, while the belonging of a point to the basin of attraction of a mode provides the fusion rule. The robust data fusion algorithm was successfully applied to two computer vision problems: estimating the multiple affine transformations, and range image segmentation.

Algorithms↗
PubMed2006

Highly scalable and robust rule learner: performance evaluation and comparison.

Business intelligence and bioinformatics applications increasingly require the mining of datasets consisting of millions of data points, or crafting real-time enterprise-level decision support systems for large corporations and drug companies. In all cases, there needs to be an underlying data mining system, and this mining system must be highly scalable. To this end, we describe a new rule learner called DataSqueezer. The learner belongs to the family of inductive supervised rule extraction algorithms. DataSqueezer is a simple, greedy, rule builder that generates a set of production rules from labeled input data. In spite of its relative simplicity, DataSqueezer is a very effective learner. The rules generated by the algorithm are compact, comprehensible, and have accuracy comparable to rules generated by other state-of-the-art rule extraction algorithms. The main advantages of DataSqueezer are very high efficiency, and missing data resistance. DataSqueezer exhibits log-linear asymptotic complexity with the number of training examples, and it is faster than other state-of-the-art rule learners. The learner is also robust to large quantities of missing data, as verified by extensive experimental comparison with the other learners. DataSqueezer is thus well suited to modern data mining and business intelligence tasks, which commonly involve huge datasets with a large fraction of missing data.

Algorithms↗
PubMed2006

Robust speaker's location detection in a vehicle environment using GMM models.

Abstract-Human-computer interaction (HCI) using speech communication is becoming increasingly important, especially in driving where safety is the primary concern. Knowing the speaker's location (i.e., speaker localization) not only improves the enhancement results of a corrupted signal, but also provides assistance to speaker identification. Since conventional speech localization algorithms suffer from the uncertainties of environmental complexity and noise, as well as from the microphone mismatch problem, they are frequently not robust in practice. Without a high reliability, the acceptance of speech-based HCI would never be realized. This work presents a novel speaker's location detection method and demonstrates high accuracy within a vehicle cabinet using a single linear microphone array. The proposed approach utilize Gaussian mixture models (GMM) to model the distributions of the phase differences among the microphones caused by the complex characteristic of room acoustic and microphone mismatch. The model can be applied both in near-field and far-field situations in a noisy environment. The individual Gaussian component of a GMM represents some general location-dependent but content and speaker-independent phase difference distributions. Moreover, the scheme performs well not only in nonline-of-sight cases, but also when the speakers are aligned toward the microphone array but at difference distances from it. This strong performance can be achieved by exploiting the fact that the phase difference distributions at different locations are distinguishable in the environment of a car. The experimental results also show that the proposed method outperforms the conventional multiple signal classification method (MUSIC) technique at various SNRs.

Acoustics↗
PubMed2006

Deterministic approach to robust adaptive learning of fuzzy models.

This study is concerned with the adaptive learning of an interpretable Sugeno-type fuzzy inference system, in a deterministic framework, in the presence of data uncertainties and modeling errors. The authors explore the use of Hinfinity estimation theory and least squares estimation for online learning of membership functions and consequent parameters without making any assumption and requiring a priori knowledge of upper bounds, statistics, and distribution of data uncertainties and modeling errors. The issues of data uncertainties, modeling errors, and time variations have been considered mathematically in a sensible way. The proposed robust approach to the adaptive learning of fuzzy models has been illustrated through the examples of adaptive system identification, time-series prediction, and estimation of an uncertain process.

Algorithms↗
PubMed2006

Robustly stable adaptive control of a tandem of master-slave robotic manipulators with force reflection by using a multiestimation scheme.

The problem of controlling a tandem of robotic manipulators composing a teleoperation system with force reflection is addressed in this paper. The final objective of this paper is twofold: 1) to design a robust control law capable of ensuring closed-loop stability for robots with uncertainties and 2) to use the so-obtained control law to improve the tracking of each robot to its corresponding reference model in comparison with previously existing controllers when the slave is interacting with the obstacle. In this way, a multiestimation-based adaptive controller is proposed. Thus, the master robot is able to follow more accurately the constrained motion defined by the slave when interacting with an obstacle than when a single-estimation-based controller is used, improving the transparency property of the teleoperation scheme. The closed-loop stability is guaranteed if a minimum residence time, which might be updated online when unknown, between different controller parameterizations is respected. Furthermore, the analysis of the teleoperation and stability capabilities of the overall scheme is carried out. Finally, some simulation examples showing the working of the multiestimation scheme complete this paper.

Algorithms↗
PubMed2006

Robust stability of switched Cohen-Grossberg Neural networks with mixed time-varying delays.

By combining Cohen-Grossberg neural networks with an arbitrary switching rule, the mathematical model of a class of switched Cohen-Grossberg neural networks with mixed time-varying delays is established. Moreover, robust stability for such switched Cohen-Grossberg neural networks is analyzed based on a Lyapunov approach and linear matrix inequality (LMI) technique. Simple sufficient conditions are given to guarantee the switched Cohen-Grossberg neural networks to be globally asymptotically stable for all admissible parametric uncertainties. The proposed LMI-based results are computationally efficient as they can be solved numerically using standard commercial software. An example is given to illustrate the usefulness of the results.

Journal Article↗
PubMedDate not supplied

Robust feature detection and local classification for surfaces based on moment analysis.

The stable local classification of discrete surfaces with respect to features such as edges and corners or concave and convex regions, respectively, is as quite difficult as well as indispensable for many surface processing applications. Usually, the feature detection is done via a local curvature analysis. If concerned with large triangular and irregular grids, e.g., generated via a marching cube algorithm, the detectors are tedious to treat and a robust classification is hard to achieve. Here, a local classification method on surfaces is presented which avoids the evaluation of discretized curvature quantities. Moreover, it provides an indicator for smoothness of a given discrete surface and comes together with a built-in multiscale. The proposed classification tool is based on local zero and first moments on the discrete surface. The corresponding integral quantities are stable to compute and they give less noisy results compared to discrete curvature quantities. The stencil width for the integration of the moments turns out to be the scale parameter. Prospective surface processing applications are the segmentation on surfaces, surface comparison, and matching and surface modeling. Here, a method for feature preserving fairing of surfaces is discussed to underline the applicability of the presented approach.

Algorithms↗
PubMedDate not supplied

Robust feature classification and editing.

Sharp edges, ridges, valleys, and prongs are critical for the appearance and an accurate representation of a 3D model. In this paper, we propose a novel approach that deals with the global shape of features in a robust way. Based on a remeshing algorithm which delivers an isotropic mesh in a feature-sensitive metric, features are recognized on multiple scales via integral invariants of local neighborhoods. Morphological and smoothing operations are then used for feature region extraction and classification into basic types such as ridges, valleys, and prongs. The resulting representation of feature regions is further used for feature-specific editing operations.

Algorithms↗
PubMed2001

Robustness of conditional moments: an application to premium calculation of reinsurance treaties.

In this study, the tail probability of a class of distributions commonly used in assessing the severity of insurance losses was examined. Without specifying any particular distribution, the use of an algebraic functional form Cx(-alpha) to approximate the tail behavior of the distributions in the class was demonstrated. Norwegian fire insurance data were examined, and the algebraic functional form was applied to derive the expected loss of a reinsurance treaty that covers all losses exceeding a retention limit. It was shown that (1) the expected loss is insensitive to the parameter alpha for a high retention limit (e.g., a catastrophe treaty), and (2) with a low retention limit (e.g., a largest claim treaty), a reliable estimate of the parameter alpha and a sound judgment on the maximum potential loss of the treaty could provide useful and defensible summary statistics for pricing the treaty. Thus, when dealing with the losses of certain reinsurance treaties, it was concluded that knowledge of a specific probability distribution is not critical, and the summary statistics derived from the model are robust with respect to a large class of loss distributions.

Journal Article↗
PubMed2000

A note on robust variance estimation for cluster-correlated data.

There is a simple robust variance estimator for cluster-correlated data. While this estimator is well known, it is poorly documented, and its wide range of applicability is often not understood. The estimator is widely used in sample survey research, but the results in the sample survey literature are not easily applied because of complications due to unequal probability sampling. This brief note presents a general proof that the estimator is unbiased for cluster-correlated data regardless of the setting. The result is not new, but a simple and general reference is not readily available. The use of the method will benefit from a general explanation of its wide applicability.

Analysis of Variance↗
PubMed2001

Using open robust design models to estimate temporary emigration from capture-recapture data.

Capture-recapture studies are crucial in many circumstances for estimating demographic parameters for wildlife and fish populations. Pollock's robust design, involving multiple sampling occasions per period of interest, provides several advantages over classical approaches. This includes the ability to estimate the probability of being present and available for detection, which in some situations is equivalent to breeding probability. We present a model for estimating availability for detection that relaxes two assumptions required in previous approaches. The first is that the sampled population is closed to additions and deletions across samples within a period of interest. The second is that each member of the population has the same probability of being available for detection in a given period. We apply our model to estimate survival and breeding probability in a study of hawksbill sea turtles (Eretmochelys imbricata), where previous approaches are not appropriate.

Animals↗
PubMed2002

Robust inference for event probabilities with non-Markov event data.

Multistate event data, in which a single subject is at risk for multiple events, is common in biomedical applications. This article considers nonparametric estimation of the vector of probabilities of state membership at time t. Estimators, derived under the Markov assumption, have been shown (Datta and Satten, 2001, Statistics and Probability Letters 55, 403-411) to be consistent for data that is non-Markov. Inference, however, must take into account possibly non-Markov transitions when constructing confidence bands for event curves. We develop robust confidence bands for these curves, evaluate them via simulation, and illustrate the method on two datasets.

AIDS-Related Opportunistic Infections↗