The authors are with the Itek Corporation, Lexington, Massachusetts 02173. Received 25 September 1973. In this letter an interferometric method of measuring plotter distortion is described. A common method of measuring plotter distortion is to draw a known pattern, such as straight lines, and scan this pattern with a microdensitometer. This is a precise method of measuring distortion; however, ...

Daniel E. Stevenson and Margaret M. Fleck Department of Computer Science, University of Iowa, Iowa City, IA 52242, USA [email protected], m [email protected] Abstract Images taken with wide-angle and inexpensive medium-angle lenses show substantial distortion, which will cause many computer vision applications to malfunction. Parametric calibration algorithms cannot handle the wide range of possi...

In this work we study the metric distortion problem in voting theory under a limited amount of ordinal information. Our primary contribution is threefold. First, consider mechanisms which perform sequence pairwise comparisons between candidates. We show that widely-popular deterministic mechanism employed most knockout phases yields \(\mathcal {O}(\log m)\) while eliciting only \(m-1\) out \(\v...

We show that the Hausdorff metric over constant-size pointsets in constant-dimensional Euclidean space admits an embedding into constant-dimensional `∞ space with constant distortion. More specifically for any s, d ≥ 1, we obtain an embedding of the Hausdorff metric over pointsets of size s in d-dimensional Euclidean space, into `s ∞ with distortion sO(s+d). We remark that any metric space M ad...

We present several computationally efficient algorithms, and complexity results on low distortion mappings between metric spaces. An embedding between two metric spaces is a mapping between the two metric spcaes and the distortion of the embedding is the factor by which the distances change. We have pioneered theoretical work on relative (or approximation) version of this problem. In this setti...

Goemans showed that any n points x1, . . . xn in d-dimensions satisfying l 2 2 triangle inequalities can be embedded into l1, with worst-case distortion at most √ d. We extend this to the case when the points are approximately low-dimensional, albeit with average distortion guarantees. More precisely, we give an l2-to-l1 embedding with average distortion at most the stable rank, sr (M), of the ...

Over the last 20 years, many of the most spectacular results in the field of dynamical systems dealt specifically with interval and circle maps (or perturbations and complex extensions of such maps). Primarily, this is because in the one-dimensional case, much better distortion control can be obtained than for general dynamical systems. However, many of these spectacular results were obtained s...