Multiple Birth and Cut algorithm for point process optimization

Proceedings of the 6th International Conference on Signal Image Technology and Internet Based Systems, SITIS 2010

Volumn , Issue , 2010, Pages 35-42

  Gamal Eldin, Ahmed ^a   Descombes, Xavier ^a   Zerubia, Josiane ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTING PROBLEMS; ENERGY MINIMIZATION; GRAPH-CUT; MARKED POINT PROCESS; OBJECT-BASED MODELS; OPTIMIZATION METHOD; POINT PROCESS;

BELT DRIVES; INTERNET; OPTIMIZATION;

ALGORITHMS;

EID: 79952580625     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SITIS.2010.17     Document Type: Conference Paper

References (30)

1. A. J. Baddeley and M. N. M. V. Lieshout, Stochastic geometry models in high-level vision. Journal of Applied Statistics, 1993, vol. 20.
2. C. J. Geyer and J. Moller, "Simulation and likelihood inference for spatial point processes," Scandinavian Journal of Statistics, vol. 21, pp. 359-373, 1994.
3. M. N. M. V. Lieshout, Markov point processes and their applications, I. C. Press, Ed. World Scientific Publishing Company, 2000.
4. R. Stoica, X. Descombes, and J. Zerubia, "A Gibbs point process for road extraction in remotely sensed images," International Journal of Computer Vision (IJCV), vol. 57, no. 2, pp. 121-136, 2004.
5. G. Perrin, X. Descombes, and J. Zerubia, "2D and 3D vegetation resource parameters assessment using marked point processes," in Proc. International Conference on Pattern Recognition (ICPR), Hong-Kong, August 2006.
6. W. Ge and R. Collins, "Marked point processes for crowd counting," in Proc. Computer Vision and Pattern Recognition (CVPR), Miami, USA, July 2009.
7. C. J. Geyer, "Reversible jump Markov chain Monte Carlo computation and Bayesian model determination," Biometrika, vol. 82, pp. 711-732, 1995.
8. X. Descombes, R. Minlos, and E. Zhizhina, "Object extraction using a stochastic birth-and-death dynamics in continuum," Journal of Mathematical Imaging and Vision, vol. 33, pp. 347-359, 2009.
9. M. Ortner, X. Descombes, and J. Zerubia, "Building outline extraction from digital elevation models using marked point processes," International Journal of Computer Vision (IJCV), vol. 72, no. 2, pp. 107-132, April 2007. (Pubitemid 46094756)
10. S. Descamps, X. Descombes, A. Béchet, and J. Zerubia, "Automatic flamingo detection using a multiple birth and death process," in Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Las Vegas, USA, March 2008.
11. M. S. Kulikova, I. H. Jermyn, X. Descombes, E. Zhizhina, and J. Zerubia, "Extraction of arbitrarily shaped objects using stochastic multiple birth-and-death dynamics and active contours," in Proc. IS&T/SPIE Electronic Imaging, San Jose, USA, January 2010.
12. A. Baddeley and R. Turner, "Modelling spatial point patterns in r," in Case Studies in Spatial Point Pattern Modelling. Lecture Notes in Statistics 185, 2374. Springer, 2006.
13. F. Chatelain, X. Descombes, and J. Zerubia, "Parameter estimation for marked point processes. application to object extraction from remote sensing images." in Proc. Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), Bonn, Germany, August 2009.
14. D. M. Greig, B. T. Porteous, and A. H. Seheult, "Exact maximum a posteriori estimation for binary images," Journal of the Royal Statistical Society. Series B (Methodological), vol. 51, no. 2, pp. 271-279, 1989. [Online]. Available: http://www.jstor.org/stable/2345609
15. O. V. Yuri Boykov and R. Zabih, "Markov random fields with efficient approximations," in Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 1998, pp. 648-655.
16. H. Ishikawa, "Exact optimization for Markov random fields with convex priors," Proc. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 25, pp. 1333-1336, 2003.
17. Y. Boykov, "Computing geodesics and minimal surfaces via graph cuts," in Proc. International Conference on Computer Vision (ICCV), 2003, pp. 26-33.
18. A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr, "Interactive image segmentation using an adaptive gmmrf model," in Proc. European Conference on Computer Vision (ECCV), Prague, May 2004.
19. P. Kohli and P. H. S. Torr, "Dynamic graph cuts for efficient inference in Markov random fields," IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 29, no. 12, pp. 2079-208, 2007.
20. H. Ishikawa and D. Geiger, "Mapping image restoration to a graph problem," in Proc. of IEEE-EURASIP Workshop on Nonlinear Signal and Image Processing, Antalya, Turkey, June 1999.
21. S. Roy and I. J. Cox, "A maximum-flow formulation of the n-camera stereo correspondence problem," IEEE International Conference on Computer Vision (ICCV), vol. 0, p. 492, 1998.
22. J. Kim, V. Kolmogorov, and R. Zabih, "Visual correspondence using energy minimization and mutual information," in Proc. International Conference on Computer Vision (ICCV), ser. 2, October 2003, pp. 1033-1040.
23. V. Kolmogorov and R. Zabih, "What energy functions can be minimized via graph cuts?" IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 26, no. 2, pp. 147-159, February 2004.
24. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum-flow problem," J. ACM, vol. 35, no. 4, pp. 921-940, 1988.
25. V. Kolmogorov and R. Zabih, "What energy functions can be minimized via graph cuts?" IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 26, no. 2, pp. 65-81, 2004.
26. H. Ishikawa and D. Geiger, "Occlusions, discontinuities, and epipolar lines in stereo," in Proc. European Conference on Computer Vision (ECCV), Freiburg, Germany, June 1998, pp. 232-248. (Pubitemid 128093085)
27. O. V. Yu Liu and O. Juan, "Simulating classic mosaics with graph cuts," in Proc. Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), 2007, pp. 55-70.
28. D. Stoyan and H. Stoyan, Fractals, Random Shapes and Point Fields: Methods of Geometrical Statistics. J. Wiley & Son, 1995.
29. O. V. Y. Boykov and R. Zabih, "Fast approximate energy minimization via graph cuts," IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 23, no. 11, pp. 1222-1239, November 2002.
30. Y. Boykov and V. Kolmogorov, "An experimental comparison of mincut/max-flow algorithms for energy minimization in vision," IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 26, no. 9, pp. 1124-1137, September 2004.