DeepAI AI Chat
Log In Sign Up

On Euclidean Norm Approximations

by   M. Emre Celebi, et al.
Wayne State University
Georgia Institute of Technology

Euclidean norm calculations arise frequently in scientific and engineering applications. Several approximations for this norm with differing complexity and accuracy have been proposed in the literature. Earlier approaches were based on minimizing the maximum error. Recently, Seol and Cheun proposed an approximation based on minimizing the average error. In this paper, we first examine these approximations in detail, show that they fit into a single mathematical formulation, and compare their average and maximum errors. We then show that the maximum errors given by Seol and Cheun are significantly optimistic.


page 1

page 2

page 3

page 4


Comments on "On Approximating Euclidean Metrics by Weighted t-Cost Distances in Arbitrary Dimension"

Mukherjee (Pattern Recognition Letters, vol. 32, pp. 824-831, 2011) rece...

Approximations for Standard Normal Distribution Function and Its Invertible

In this paper, we introduce a new approximation of the cumulative distri...

Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search

Vector quantization (VQ) techniques are widely used in similarity search...

Are best approximations really better than Chebyshev?

Best and Chebyshev approximations play an important role in approximatio...

On the robustness of minimum-norm interpolators

This article develops a general theory for minimum-norm interpolated est...

Analysis of the robustness of NMF algorithms

We examine three non-negative matrix factorization techniques; L2-norm, ...

Approximate Euclidean lengths and distances beyond Johnson-Lindenstrauss

A classical result of Johnson and Lindenstrauss states that a set of n h...