• DocumentCode
    457383
  • Title

    P-Channels: Robust Multivariate M-Estimation of Large Datasets

  • Author

    Felsberg, Michael ; Granlund, Gosta

  • Author_Institution
    Comput. Vision Lab., Linkoping Univ.
  • Volume
    3
  • fYear
    0
  • fDate
    0-0 0
  • Firstpage
    262
  • Lastpage
    267
  • Abstract
    In this paper we introduce a new technique that allows to estimate modes of a high-dimensional probability density function with linear time-complexity in the number of dimensions and the number of samples. The method can be implemented in an order-independent incremental way, such that the space-complexity is linear in the number of dimensions and the number of modes. The number of required samples to get reliable estimates depends linearly on the number of dimensions even if we replace the assumption of independent stochastic variables with the weaker assumption of data clustered in submanifolds. These submanifolds need not to be known, but smoothness assumptions are made. The new technique is based on representing data in what we call P-channels
  • Keywords
    computational complexity; data structures; estimation theory; linear systems; pattern clustering; probability; stochastic processes; P-channels; data clustering; large datasets; linear time-complexity; multivariate M-estimation; probability density function; space-complexity; Clustering algorithms; Computer vision; Independent component analysis; Kernel; Laboratories; Pattern recognition; Principal component analysis; Robustness; Stochastic processes; Vector quantization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition, 2006. ICPR 2006. 18th International Conference on
  • Conference_Location
    Hong Kong
  • ISSN
    1051-4651
  • Print_ISBN
    0-7695-2521-0
  • Type

    conf

  • DOI
    10.1109/ICPR.2006.911
  • Filename
    1699516