scholarly journals Orientation Uncertainty Characteristics of Some Pose Measuring Systems

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Marek Franaszek ◽  
Geraldine S. Cheok

We investigate the performance of pose measuring systems which determine an object’s pose from measurement of a few fiducial markers attached to the object. Such systems use point-based, rigid body registration to get the orientation matrix. Uncertainty in the fiducials’ measurement propagates to the uncertainty of the orientation matrix. This orientation uncertainty then propagates to points on the object’s surface. This propagation is anisotropic, and the direction along which the uncertainty is the smallest is determined by the eigenvector associated with the largest eigenvalue of the orientation data’s covariance matrix. This eigenvector in the coordinate frame defined by the fiducials remains almost fixed for any rotation of the object. However, the remaining two eigenvectors vary widely and the direction along which the propagated uncertainty is the largest cannot be determined from the object’s pose. Conditions that result in such a behavior and practical consequences of it are presented.

2020 ◽  
Vol 52 (4) ◽  
pp. 1224-1248
Author(s):  
Svante Janson

AbstractIt is well-known that in a small Pólya urn, i.e., an urn where the second largest real part of an eigenvalue is at most half the largest eigenvalue, the distribution of the numbers of balls of different colours in the urn is asymptotically normal under weak additional conditions. We consider the balanced case, and then give asymptotics of the mean and the covariance matrix, showing that after appropriate normalization, the mean and covariance matrix converge to the mean and covariance matrix of the limiting normal distribution.


Author(s):  
Jürgen Jost ◽  
Raffaella Mulas ◽  
Florentin Münch

AbstractWe offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least $$\frac{n+1}{n-1}$$ n + 1 n - 1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $$\frac{n-1}{2}$$ n - 1 2 . With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $$\frac{n-1}{2}$$ n - 1 2 .


2021 ◽  
Vol 9 (1) ◽  
pp. 19-21
Author(s):  
Zoran Stanić

Abstract We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.


Author(s):  
X. Tong ◽  
B. Tabarrok

Abstract In this paper the global motion of a rigid body subject to small periodic torques, which has a fixed direction in the body-fixed coordinate frame, is investigated by means of Melnikov’s method. Deprit’s variables are introduced to transform the equations of motion into a form describing a slowly varying oscillator. Then the Melnikov method developed for the slowly varying oscillator is used to predict the transversal intersections of stable and unstable manifolds for the perturbed rigid body motion. It is shown that there exist transversal intersections of heteroclinic orbits for certain ranges of parameter values.


Sign in / Sign up

Export Citation Format

Share Document