Testing for Uniformity in Multidimensional Data
- 1 January 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-6 (1) , 73-81
- https://doi.org/10.1109/tpami.1984.4767477
Abstract
Testing for uniformity in multidimensional data is important in exploratory pattern analysis, statistical pattern recognition, and image processing. The goal of this paper is to determine whether the data follow the uniform distribution over some compact convex set in K-dimensional space, called the sampling window. We first provide a simple, computationally efficient method for generating a uniformly distributed sample over a set which approximates the convex hul of the data. We then test for uniformity by comparing this generated sample to the data by using Friedman-Rafsky's minimal spanning tree (MST) based test. Experiments with both simulated and real data indicate that this MST-based test is useful in deciding if data are uniform.Keywords
This publication has 8 references indexed in Scilit:
- The linear nearest neighbour statisticBiometrika, 1982
- Evaluation of Projection AlgorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Spatial StatisticsWiley Series in Probability and Statistics, 1981
- Clustering Methodologies in Exploratory Data AnalysisPublished by Elsevier ,1980
- Multivariate Generalizations of the Wald-Wolfowitz and Smirnov Two-Sample TestsThe Annals of Statistics, 1979
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- Finding the edge of a Poisson forestJournal of Applied Probability, 1977
- An Algorithm for Convex PolytopesJournal of the ACM, 1970