Towards the parallelization of Reversible Jump Markov Chain Monte Carlo algorithms for vision problems

Point processes have demonstrated efficiency and competitiveness when addressing object recognition problems in vision. However, simulating these mathematical models is a difficult task, especially on large scenes. Existing samplers suffer from average performances in terms of computation time and stability. We propose a new sampling procedure based on a Monte Carlo formalism. Our algorithm exploits Markovian properties of point processes to perform the sampling in parallel. This procedure is embedded into a data-driven mechanism such that the points are non-uniformly distributed in the scene. The performances of the sampler are analyzed through a set of experiments on various object recognition problems from large scenes, and through comparisons to the existing algorithms.

[1]  M. N. M. van Lieshout,et al.  Depth Map Calculation for a Variable Number of Moving Objects using Markov Sequential Object Processes , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Josiane Zerubia,et al.  Higher Order Active Contours , 2006, International Journal of Computer Vision.

[3]  Florent Lafarge,et al.  Geometric Feature Extraction by a Multimarked Point Process , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Robert T. Collins,et al.  Marked point processes for crowd counting , 2009, CVPR.

[5]  Uwe Soergel,et al.  A Marked Point Process for Modeling Lidar Waveforms , 2010, IEEE Transactions on Image Processing.

[6]  P. Green.  Reversible jump Markov chain Monte Carlo computation and Bayesian model determination , 1995 .

[7]  Ben Taskar,et al.  Detecting and parsing architecture at city scale from range data , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[8]  Stephen A. Jarvis,et al.  On the parallelisation of MCMC-based image processing , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[9]  Josiane Zerubia,et al.  Point processes for unsupervised line network extraction in remote sensing , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  P. Green,et al.  Parallel Chains, Delayed Rejection and Reversible Jump MCMC for Object Recognition , 2000, BMVC.

[11]  Stan Z. Li,et al.  Markov Random Field Modeling in Image Analysis , 2001, Computer Science Workbench.

[12]  Andrew Zisserman,et al.  Learning To Count Objects in Images , 2010, NIPS.

[13]  Ákos Utasi,et al.  A 3-D marked point process model for multi-view people detection , 2011, CVPR 2011.

[14]  A. Baddeley,et al.  Stochastic geometry models in high-level vision , 1993 .

[15]  Zhuowen Tu,et al.  Image Segmentation by Data-Driven Markov Chain Monte Carlo , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  J. Besag.  On the Statistical Analysis of Dirty Pictures , 1986 .

[17]  William T. Freeman,et al.  On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.

[18]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Pekka Ruusuvuori,et al.  Computational Framework for Simulating Fluorescence Microscope Images With Cell Populations , 2007, IEEE Transactions on Medical Imaging.