• DocumentCode
    1120890
  • Title

    Testing for Uniformity in Multidimensional Data

  • Author

    Smith, Stephen P. ; Jain, Anil K.

  • Author_Institution
    Department of Computer Science, Michigan State University, East Lansing, MI 48824; Northrop Research Center, Palos Verdes Peninsula, CA 90274.
  • Issue
    1
  • fYear
    1984
  • Firstpage
    73
  • Lastpage
    81
  • 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
    Computational modeling; Computer science; Distributed computing; Image processing; Image sampling; Multidimensional systems; Pattern analysis; Pattern recognition; Sampling methods; Testing; Clustering tendency; convex hull; exploratory pattern analysis; minimal spanning tree;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/TPAMI.1984.4767477
  • Filename
    4767477