Andere Kunden interessierten sich auch für
![Robust Watermarking and its Applications to Communication Problems]( "Robust Watermarking and its Applications to Communication Problems")
Robust Watermarking and its Applications to Communication Problems22,99 €![ROBUST RESOURCE ALLOCATION FOR PARALLEL DISTRIBUTED COMPUTING SYSTEMS]( "ROBUST RESOURCE ALLOCATION FOR PARALLEL DISTRIBUTED COMPUTING SYSTEMS")
ROBUST RESOURCE ALLOCATION FOR PARALLEL DISTRIBUTED COMPUTING SYSTEMS38,99 €![Robust Localization and Mapping for Mobile Robotic Navigation]( "Robust Localization and Mapping for Mobile Robotic Navigation")
Robust Localization and Mapping for Mobile Robotic Navigation40,99 €![Robust Classification Based on Sparsity]( "Robust Classification Based on Sparsity")
Robust Classification Based on Sparsity22,99 €![Information Fusion towards a Robust Face Recognition System]( "Information Fusion towards a Robust Face Recognition System")
Information Fusion towards a Robust Face Recognition System40,99 €![People Detection in Complex Scenes By Using An Robust Detector]( "People Detection in Complex Scenes By Using An Robust Detector")
People Detection in Complex Scenes By Using An Robust Detector23,99 €![Robust Distributed Data Aggregation]( "Robust Distributed Data Aggregation")
Robust Distributed Data Aggregation36,99 €
The nonlinear nature of many vision tasks involves analysis over nonlinear spaces embedded in higher dimensional Euclidean spaces. Such manifolds can be studied using the theory of differential geometry. Here we develop two algorithms which can be applied over manifolds. The nonlinear mean shift algorithm is a generalization of the popular mean shift, a feature space analysis method for vector spaces. Nonlinear mean shift can be applied to any Riemannian manifold and is provably convergent to the local maxima of an appropriate kernel density. This algorithm is used for motion segmentation with different motion models and for the filtering of complex image data. The projection based M-estimator is a robust regression algorithm which does not require a user supplied estimate of the level of noise corrupting the inliers. We build on the connections between kernel density estimation and M-estimators to develop data driven rules for scale estimation. The method can be generalized to handle heteroscedastic data and subspace estimation. The results of using pbM for affine motion estimation, fundamental matrix estimation and multibody factorization are presented.