We prove some new concentration inequalities for self-bounding functions using the entropy method. As an application, we recover Talagrand’s convex distance inequality. The new Bernstein-like inequalities for self-bounding functions are derived thanks to a careful analysis of the so-called Herbst argument. The latter involves comparison results between solutions of differential inequalities tha...

—In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orthogonal polynomial approximations. There are many ways to choose an approximation scheme for d-dimensional spatiotemporal trajectories. Some of them have been studied before. In this paper we extend the approach proposed in [6] ...

When comparing time series, z-normalization preprocessing and dynamic time warping (DTW) distance became almost standard procedure. This paper makes a point against carelessly using this setup by discussing implications and alternatives. A (conceptually) simpler distance measure is proposed that allows for a linear transformation of amplitude and time only, but is also open for other normalizat...

Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for filtering. These strategies are mainly two-step, with the initial "filter" step based on a spatial or metric access method followed by a "refine" step employing expensive computation. Recent research on robust matching me...

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...

this paper presents evidence on mesozoic inversion of basin bounding faults within the taleqan-gajereh-lar paleograben (tglp) in central alborz range. for this purpose, well documented stratigraphy data across the tglp together with the new acquired structural data on the geometry and kinematics of the paleograben basin bounding faults are utilized. the tglp has evolved through the early and mi...

A motion planning algorithm is described for bounding over rough terrain with the LittleDog robot. Unlike walking gaits, bounding is highly dynamic and cannot be planned with quasi-steady approximations. LittleDog is modeled as a planar five-link system, with a 16-dimensional state space; computing a plan over rough terrain in this high-dimensional state space that respects the kinodynamic cons...

In this paper we address the problem of fast inclusion tests and distance calculation in very large models, an important issue in the context of environments involving haptic interaction or collision detection. Unfortunately, existing haptic rendering or collision detection toolkits cannot handle polygonal models obtained from 3D digitized point clouds unless the models are simplified up to a f...

Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary with the user and situation. In this paper, we present the spatial transformation technique that yields a new search method for adaptive ellipsoid queries with quadratic form distance functions. The basic idea is to t...