Estimating the distribution of unlabeled, correlated point sets

In this paper we introduce the a fortiori expectation-maximization (AFEM) algorithm for computing the parameters of a distribution from which unlabeled, correlated point sets are presumed to be generated. Each unlabeled point is assumed to correspond to a target with independent probability of appearance but correlated positions. We propose replacing the expectation phase of the algorithm with a Kalman filter modified within a Bayesian framework to account for the unknown point labels which manifest as uncertain measurement matrices. We also propose a mechanism to reorder the measurements in order to improve parameter estimates. In addition, we use a state-of-the-art Markov chain Monte Carlo sampler to efficiently sample measurement matrices. In the process, we indirectly propose a constrained k-means clustering algorithm. Simulations verify the utility of AFEM against a traditional expectation-maximization algorithm in a variety of scenarios.

[1]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

[3]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[4]  Joydeep Ghosh,et al.  A study of K-Means-based algorithms for constrained clustering , 2013, Intell. Data Anal..

[5]  D. Rubin INFERENCE AND MISSING DATA , 1975 .

[6]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[7]  New York Dover,et al.  ON THE CONVERGENCE PROPERTIES OF THE EM ALGORITHM , 1983 .

[8]  J. Sherman,et al.  Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix , 1950 .

[9]  Rastko R. Selmic,et al.  3D hand posture recognition from small unlabeled point sets , 2014, 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[10]  Steven W. Nydick,et al.  The Wishart and Inverse Wishart Distributions , 2012 .

[11]  Greg Welch,et al.  Welch & Bishop , An Introduction to the Kalman Filter 2 1 The Discrete Kalman Filter In 1960 , 1994 .

[12]  Matthias Hein,et al.  Hilbertian Metrics and Positive Definite Kernels on Probability Measures , 2005, AISTATS.

[13]  Maksims Volkovs,et al.  Efficient Sampling for Bipartite Matching Problems , 2012, NIPS.

[14]  Raman K. Mehra,et al.  Approaches to adaptive filtering , 1970 .

[15]  Yaakov Bar-Shalom,et al.  Sonar tracking of multiple targets using joint probabilistic data association , 1983 .

[16]  S. Chib,et al.  Understanding the Metropolis-Hastings Algorithm , 1995 .

[17]  Garry A. Einicke,et al.  Riccati Equation and EM Algorithm Convergence for Inertial Navigation Alignment , 2009, IEEE Transactions on Signal Processing.

[18]  Ba-Ngu Vo,et al.  Labeled Random Finite Sets and Multi-Object Conjugate Priors , 2013, IEEE Transactions on Signal Processing.

[19]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[20]  Ba-Ngu Vo,et al.  The Gaussian Mixture Probability Hypothesis Density Filter , 2006, IEEE Transactions on Signal Processing.

[21]  Neil J. Gordon,et al.  A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking , 2002, IEEE Trans. Signal Process..