𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the computation of Mahalanobis' generalized distance (D2)

✍ Scribed by G. P. Rightmire

Publisher
John Wiley and Sons
Year
1969
Tongue
English
Weight
345 KB
Volume
30
Category
Article
ISSN
0002-9483

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On computing the minimum distance of lin
On computing the minimum distance of linear codes
✍ Masami Mohri; Masakatu Morii πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 245 KB πŸ‘ 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

Corrigendum to β€œEfficient Computation of
Corrigendum to β€œEfficient Computation of the Euclidean Distance Transform”
✍ Laurence Boxer; Russ Miller πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 52 KB

An algorithm for the distance transform of a binary image was presented in L. Boxer and R. Miller (Comput. Vision Image Understand. 80, 2000, 379-383). The algorithm was stated for the Euclidean metric. In this Corrigendum, we show that the algorithm of Boxer and Miller (2000) is correct for the L 1