This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model we construct a hierarchical bounding representation based on spheres. The distance between objects is determined by computing the distance between pairs of convex components using preexisting techniques. The key to eff...

Similarity search algorithms that directly rely on index structures and require a lot of distance computations are usually not applicable to databases containing complex objects and defining costly distance functions on spatial, temporal and multimedia data. Rather, the use of an adequate multi-step query processing strategy is crucial for the performance of a similarity search routine that dea...

This paper studies the effect of flexible linear torso on the dynamics of passive quadruped bounding. A reduced-order passive and conservative model with linear flexible torso and springy legs is introduced. The model features extensive spine deformation during high-speed bounding, resembling those observed in a cheetah. Fixed points corresponding to cyclic bounding motions are found and calcul...

The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. The alternatives are expressed by permutations, whose pairwise distance can be measured in many ways. In this work we study a collection of distances, including the Kendall tau, Spearman footrule, Minkowski, Cayley, Hamming, Ulam, and related edit distanc...

The graph edit distance (GED) is a flexible measure which widely used for inexact matching. Since its exact computation [Formula: see text]-hard, heuristics are in practice. A popular approach to obtain upper bounds GED via transformations the linear sum assignment problem with error-correction (LSAPE). Typically, local structures and distances between them employed carrying out this transforma...

Most existing trackers are based on using a classifier and multi-scale estimation to estimate the target state. Consequently, as expected, have become more stable while tracking accuracy has stagnated. While adopt maximum overlap method an intersection-over-union (IoU) loss mitigate this problem, there defects in IoU itself, that make it impossible continue optimize objective function when give...

Many problems in areas such as computer graphics, scientific visualization, computational geometry, or image processing require the computation of a distance field. The distance field indicates at each point in space the shortest distance to a given object. Depending on the problem setting, the object is described either by a voxel attribute within a volume data set or by a surface representati...