Efficient, sparse representation of manifold distance matrices for classical scaling

Geodesic distance matrices can reveal shape properties that are largely invariant to non-rigid deformations, and thus are often used to analyze and represent 3-D shapes. However, these matrices grow quadratically with the number of points. Thus for large point sets it is common to use a low-rank approximation to the distance matrix, which fits in memory and can be efficiently analyzed using methods such as multidimensional scaling (MDS). In this paper we present a novel sparse method for efficiently representing geodesic distance matrices using biharmonic interpolation. This method exploits knowledge of the data manifold to learn a sparse interpolation operator that approximates distances using a subset of points. We show that our method is 2x faster and uses 20x less memory than current leading methods for solving MDS on large point sets, with similar quality. This enables analyses of large point sets that were previously infeasible.Comment: Conference CVPR 201

Constant-time all-pairs geodesic distance query on triangle meshes

Computing discrete geodesics on polyhedral surfaces plays an important role in computer graphics. In contrast to the well-studied "single-source, all-destination" discrete geodesic problem, little progress has been reported to the all-pairs geodesic, i.e., computing the geodesic distance between arbitrary two points on the surface. To our knowledge, the existing all-pairs geodesic algorithms have very high computational cost, thus, can not be applied to real-world models, which usually contain thousands of vertices. In this paper, we propose an efficient algorithm to approximate the all-pairs geodesic on triangular meshes. The pre-processing step takes O(mn2 log n) time for the input mesh with n vertices and m samples, where m (<< n) is specified by the user, usually between a few hundred and several thousand. In the query step, our algorithm can compute the approximate geodesic distance between arbitrary pair of points (not necessarily mesh vertices) in O(1) time. Furthermore, the geodesic path and the geodesic distance field can be approximated in linear time. Both theoretical analysis and experimental results on real-world models demonstrate that our algorithm is efficient and accurate. We demonstrate the efficacy of our algorithm on the interactive texture mapping by using discrete exponential map

Design and Optimization of a Robot for Abrasive Waterjet Polishing of Hydraulic Turbine Blades

RÉSUMÉ Dans l’industrie de fabrication de turbine hydraulique, toutes les surfaces de turbines qui sont en contact avec de l’eau devraient être polies afin d’obtenir la qualité et l’efficacité maximales. Pour cela, il est nécessaire d’utiliser une méthode de polissage qui peut avoir accès à toutes les surfaces des turbines incluant leurs bords, leurs zones restreintes et leurs courbures serrées. En raison des propriétés particulières qu’offre la technique de polissage par jet d’eau abrasif, celle-ci peut être utilisée pour accomplir cette tâche. Par conséquent, dans cette recherche, les propriétés de cette méthode non-conventionnelle sont examinées dans un premier temps et les principaux paramètres affectant ses performances sont alors déterminés. Ensuite, les conditions nécessaires de manipulations de la buse de pulvérisation vis-à-vis des surfaces courbes sont étudiées et les propriétés d’un bras robotisé pour manipuler celle-ci sont obtenues afin de réaliser cette tâche d’une manière appropriée. Par après, plusieurs mécanismes robotiques tels que des mécanismes sériels, parallèles à membrures, parallèles à câbles, et des robots hybrides sont considérés et leurs capacités à être utilisé dans ce processus sont analysées. Il est alors démontré qu’une l’architecture hybride est le meilleur candidat à retenir pour le design d’un robot de polissage par jet d’eau abrasif. Ensuite, l’architecture conceptuelle d’un robot hybride à 5 DDL est proposée. La structure du robot est constituée d’un mécanisme parallèle à câbles à 3 DDL et d’un poignet sériel à 2 DDL. Afin d’améliorer les propriétés cinématiques du mécanisme à câbles tout en minimisant le nombre d’actionneurs nécessaires, il est proposé d’utiliser des différentiels pour guider ce robot manipulateur. Aussi, la rigidité et la compacité du mécanisme sont améliorées en utilisant une liaison prismatique. Par la suite, les systèmes à câbles différentiels sont examinés et les différences entre leurs propriétés cinématiques et celles de systèmes actionnés indépendamment pour chaque câble sont décrites. Il est démontré que la force résultante de tous les câbles d’un différentiel à câbles doit être prise en compte dans son analyse cinématique. En effet, dans un système différentiel planaire, la direction de la force résultante n’est pas fixée vers un point particulier. Mais plutôt, elle se déplace dans le plan de ce système différentiel. Cette propriété peut être bénéfique pour les propriétés cinématiques des robots à câbles. En comparant deux types d’espace de travail de plusieurs robots planaires actionnés par des mécanismes différentiels par rapport à leurs équivalents pleinement actionnés, il est alors montré qu’en utilisant ces mécanismes, les espaces de travail des robots planaires à câbles peuvent être améliorés. Cependant, cette même propriété qui augmente la plage de variation de la direction de la force résultante dans un câble différentiel, diminue aussi son amplitude. Ainsi, le design optimal d’un différentiel à câble résulte d’un compromis entre ces deux propriétés.----------ABSTRACT In hydraulic turbine manufacturing, all surfaces of the turbines which are in contact with the water flow should be polished to obtain the desired quality and maximal efficiency. For this, it is needed to use an effective polishing method which can have access to all surfaces of the turbines including edges, narrow areas and tight bends. Because of the particular properties of the abrasive waterjet polishing technique, it can be used to accomplish this task. Therefore, in this research, the properties of this non-conventional method are first investigated and the main parameters affecting its performance are then determined. Next, the manipulation requirements of the jet nozzle over free-form surfaces are studied and the properties of a robotic arm to appropriately perform this task are obtained. Afterwards, several robotic mechanisms, e.g., serial, linkage-driven parallel, cabledriven parallel, and hybrid robots are considered and their abilities to be used in this process are investigated. It is then shown that a hybrid architecture is the best candidate for the design of an abrasive waterjet polishing robot. Next, the conceptual design of a 5-DOF hybrid robot is proposed. The structure of this robot is made of a 3-DOF cable-driven parallel mechanism and a 2-DOF serial wrist. To improve the kinematic properties of the cable-driven mechanism while the number of required actuators is kept at a minimum, it is proposed to use cable differentials to drive this manipulator. Also, the rigidity and compactness of the mechanism is improved through the use of a prismatic joint in its structure. Afterwards, differentially driven cable systems are investigated and the differences between their kinematic properties and these of independently actuated cables are described. It is shown that the resultant force of all cables of a cable differential should be taken into account in its kinematic analysis. Indeed, in a planar differential, the direction of the resultant force is not fixed toward a particular point. Instead, it moves within the plane of that differential. This property can be beneficial in the kinematic properties of differentially driven cable robots. By comparing two types of workspaces of several planar robots actuated by differentials with their fully actuated counterparts, it is then shown that using these mechanisms, these workspaces of planar cable robots can be improved. However, the same property that increases the range of variation of the resultant force direction in a cable differential, decreases its magnitude. Thus, the optimal design of a cable differential is a trade-off between these two properties. Next, a synthesis method is presented to find all possible arrangements of the cable differentials to generalize the idea of using such mechanisms in the design of planar cable robots. Additionally, the application of differentials in spatial robots is also investigated and it is shown that they have properties similar to the planar types

Calculating Sparse and Dense Correspondences for Near-Isometric Shapes

Comparing and analysing digital models are basic techniques of geometric shape processing. These techniques have a variety of applications, such as extracting the domain knowledge contained in the growing number of digital models to simplify shape modelling. Another example application is the analysis of real-world objects, which itself has a variety of applications, such as medical examinations, medical and agricultural research, and infrastructure maintenance. As methods to digitalize physical objects mature, any advances in the analysis of digital shapes lead to progress in the analysis of real-world objects. Global shape properties, like volume and surface area, are simple to compare but contain only very limited information. Much more information is contained in local shape differences, such as where and how a plant grew. Sadly the computation of local shape differences is hard as it requires knowledge of corresponding point pairs, i.e. points on both shapes that correspond to each other. The following article thesis (cumulative dissertation) discusses several recent publications for the computation of corresponding points: - Geodesic distances between points, i.e. distances along the surface, are fundamental for several shape processing tasks as well as several shape matching techniques. Chapter 3 introduces and analyses fast and accurate bounds on geodesic distances. - When building a shape space on a set of shapes, misaligned correspondences lead to points moving along the surfaces and finally to a larger shape space. Chapter 4 shows that this also works the other way around, that is good correspondences are obtain by optimizing them to generate a compact shape space. - Representing correspondences with a “functional map” has a variety of advantages. Chapter 5 shows that representing the correspondence map as an alignment of Green’s functions of the Laplace operator has similar advantages, but is much less dependent on the number of eigenvectors used for the computations. - Quadratic assignment problems were recently shown to reliably yield sparse correspondences. Chapter 6 compares state-of-the-art convex relaxations of graphics and vision with methods from discrete optimization on typical quadratic assignment problems emerging in shape matching