Fourier-Information Duality in the Identity Management Problem

We compare two recently proposed approaches for representing probability distributions over the space of permutations in the context of multi-target tracking. We show that these two representations, the Fourier approximation and the information form approximation can both be viewed as low dimensional projections of a true distribution, but with respect to different metrics. We identify the strengths and weaknesses of each approximation, and propose an algorithm for converting between the two forms, allowing for a hybrid approach that draws on the strengths of both representations. We show experimental evidence that there are situations where hybrid algorithms are favorable.

[1]  W. D. Cairns.  THE MATHEMATICAL ASSOCIATION OF AMERICA. , 1917, Science.

[2]  P. W. Kasteleyn.  The Statistics of Dimers on a Lattice , 1961 .

[3]  P. W. Kasteleyn.  The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .

[4]  P. Ribenboim.  Linear representation of finite groups : lecture notes , 1966 .

[5]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[6]  Bruce E. Sagan,et al.  The symmetric group - representations, combinatorial algorithms, and symmetric functions , 2001, Wadsworth & Brooks / Cole mathematics series.

[7]  Joseph Y. Halpern.  A Computing Research Repository , 1998, D Lib Mag..

[8]  Chris H. Q. Ding,et al.  Bipartite graph partitioning and data clustering , 2001, CIKM '01.

[9]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.

[10]  B. Sagan.  The Symmetric Group , 2001 .

[11]  Leonidas J. Guibas,et al.  A Distributed Algorithm for Managing Multi-target Identities in Wireless Ad-hoc Sensor Networks , 2003, IPSN.

[12]  Inderjit S. Dhillon,et al.  Information-theoretic co-clustering , 2003, KDD '03.

[13]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[14]  Kunle Olukotun,et al.  The Information-Form Data Association Filter , 2005, NIPS.

[15]  Leonidas J. Guibas,et al.  Lazy inference on object identities in wireless sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[16]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

[17]  Tony Jebara,et al.  Multi-object tracking with representations of the symmetric group , 2007, AISTATS.

[18]  Leonidas J. Guibas,et al.  Multi-person tracking from sparse 3D trajectories in a camera sensor network , 2008, 2008 Second ACM/IEEE International Conference on Distributed Smart Cameras.

[19]  Zizhuo Wang,et al.  Parimutuel Betting on Permutations , 2008, WINE.

[20]  Mark Huber,et al.  Fast approximation of the permanent for very dense problems , 2008, SODA '08.

[21]  Leonidas J. Guibas,et al.  Fourier Theoretic Probabilistic Inference over Permutations , 2009, J. Mach. Learn. Res..

[22]  Bert Huang,et al.  Approximating the Permanent with Belief Propagation , 2009, ArXiv.

[23]  Michael Chertkov,et al.  Belief propagation and loop calculus for the permanent of a non-negative matrix , 2009, ArXiv.

[24]  Leonidas J. Guibas,et al.  Exploiting Probabilistic Independence for Permutations , 2009, AISTATS.

[25]  Pascal O. Vontobel,et al.  The Bethe permanent of a non-negative matrix , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).