Using the particle filter approach to building partial correspondences between shapes

International Journal of Computer Vision

Volumn 88, Issue 1, 2010, Pages 1-23

  Lakaemper, Rolf ^a   Sobel, Marc ^a  

^a TEMPLE UNIVERSITY   (United States)

Author keywords

Feature correspondences; Particle filters; Shape alignment; Shape matching; Shape recognition

Indexed keywords

FEATURE CORRESPONDENCE; PARTICLE FILTER; PARTICLE FILTERS; SHAPE MATCHING; SHAPE RECOGNITION;

ALIGNMENT; DISTRIBUTED COMPUTER SYSTEMS; PATTERN MATCHING; TARGET TRACKING;

NONLINEAR FILTERING;

EID: 77951297304     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-009-0288-z     Document Type: Article

References (38)

1. Alt, H., Scharf, L., & Scholz, S. (2006). Probabilistic matching of sets of polygonal curves. In Proceedings of the 22nd European workshop on computational geometry (EWCG) (pp. 107-110). Delphi, Greece
2. T. Back U. Hammel H. P. Schwefel 1997 Evolutionary computation: Comments on the history and current state IEEE Transactions on Evolutionary Computation 1 3 17 10.1109/4235.585888
3. S. Belongie J. Malik J. Puzicha 2002 Shape matching and object recognition using shape contexts IEEE Transactions on Pattern Analysis and Machine Intelligence 24 705 522 10.1109/34.993558 (Pubitemid 34448769)
4. Chen, L., Feris, R., & Turk, M. (2008). Efficient partial shape matching using smith-waterman algorithm. In Computer vision and pattern recognition workshops, 2008 CVPRW '08 IEEE.
5. Crisan, D., & Doucet, A. (2002). A survey of convergence results on particle filtering methods for practitioners. IEEE Transactions on Signal Processing, 50(3).
6. de Bruijne, M., & Nielsen, M. (2004). Image segmentation by shape particle filtering. In ICPR '04: Proceedings of the pattern recognition, 17th international conference on (ICPR'04) (Vol. 3, pp. 722-725). Washington: IEEE Computer Society.
7. DelMoral, P., Doucet, A., & Jasra, A. (2007). Sequential Monte Carlo for Bayesian computation. In Bayesian statistics (Vol. 8, pp. 1-34). London: Oxford University Press.
8. Doucet, A., De Freitas, N., & Gordon, N. (eds.), (2001). Sequential Monte Carlo methods in practice. New York: Springer.
9. A. Doucet P. DelMoral A. Jasra 2006 Sequential Monte Carlo samplers Journal of the Royal Statistics Society B 68 3 411 436 1105.62034 10.1111/j.1467-9868.2006.00553.x 2278333 (Pubitemid 43742903)
10. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading: Addison-Wesley.
11. L. Gorelick M. Galun A. Brandt 2006 Shape representation and classification using the Poisson equation IEEE Transactions on Pattern Analysis and Machine Intelligence 28 12 1991-2005 10.1109/TPAMI.2006.253
12. Gower, J., & Dijksterhuis, G. (2005). Procrustes problems (Vol. 70). New York: Springer.
13. R. M. Haralick L. G. Shapiro 1979 The consistent labeling problem: Part I IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI 1 2 173 184 0418.68080 10.1109/TPAMI.1979.4766903
14. Holland, J. H. (1975). Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. Cambridge: The MIT Press.
15. J. Kittler J. Illingworth 1986 Relaxation labelling algorithms-a review Image and Vision Computing 3 4 206 216 10.1016/0262-8856(85)90009-5
16. Lakaemper, R., & Sobel, M. (2008). Correspondences between parts of shapes with particle filters. In IEEE int. conf. on computer vision and pattern recognition (CVPR).
17. Lakaemper, R., Li, S., & Sobel, M. (2008). Partial correspondences of point sets using particle filters. In IAPR int. conf. on pattern recognition (ICPR).
18. Latecki, L. J., Lakaemper, R., & Eckhardt, U. (2000). Shape descriptors for non-rigid shapes with a single closed contour. In Proc. IEEE conf. computer vision and pattern recognition (pp. 424-429).
19. Latecki, L. J., Wang, Q., Koknar-Tezel, S., & Megalooikonomou, V. (2007). Optimal subsequence bijection. In IEEE int. conf. on data mining (ICDM).
20. H. Ling D. W. Jacobs 2007 Shape classification using the inner-distance IEEE Transactions on Pattern Analysis and Machine Intelligence 29 2 286 299 10.1109/TPAMI.2007.41 (Pubitemid 46420888)
21. Liu, J. S. (2002). Monte Carlo strategies in scientific computing. Berlin: Springer.
22. Liu, J., Chen, R., & Logvinenko, T. (2000). A theoretical framework for sequential importance sampling and resampling (Technical report). Stanford University, Department of Statistics, January 2000.
23. E. Milios E. Petrakis 2000 Shape retrieval based on dynamic programming Transactions on Image Processing 9 1 141 146 10.1109/83.817606 (Pubitemid 30562092)
24. Mokhtarian, F., Abbasi, S., & Kittler, J. (1996). Robust and efficient shape indexing through curvature scale space. In Proceedings of British machine vision conference (pp. 53-62).
25. F. Mokhtarian N. Khalili P. Yuen 2002 Estimation of error in curvature computation on multi-scale free-form surfaces International Journal of Computer Vision 48 2 131 149 1012.68752 10.1023/A:1016098907682 (Pubitemid 34854244)
26. P. D. Moral A. Doucet A. Jasra 2006 Sequential Monte Carlo samplers Journal of the Royal Statistical Society, Series B 68 3 411 436 1105.62034 10.1111/j.1467-9868.2006.00553.x 2278333 (Pubitemid 43742903)
27. Perez, P., Blake, A., & Gangnet, M. (2001). Jetstream: Probabilistic contour extraction with particles. In Proc. of ICCV (pp. 424-531).
28. Qian, W., & Titterington, D. M. (1992). Stochastic relaxations and em algorithms for Markov random fields. Journal of Statistical Computing and Simulation, 40.
29. Y. Rathi N. Vaswani A. Tannenbaum 2007 A generic framework for tracking using particle filter with dynamic shape prior IP 16 5 1370 1382 2464973
30. A. Rosenfeld R. A. Hummel S. W. Zucker 1976 Scene labeling by relaxation operations IEEE Transactions on Systems, Man and Cybernetics SMC 6 6 420 433 0335.68070 10.1109/TSMC.1976.4309519 418553
31. Sandhu, R., Dambreville, S., & Tannenbaum, A. (2008). Particle filtering for registration of 2d and 3d point sets with stochastic dynamics.
32. Schmidt, F., Farin, D., & Cremers, D. (2007). Fast matching of planar shapes in sub-cubic runtime. In IEEE international conference on computer vision (ICCV).
33. C. Scott R. Nowak 2006 Robust contour matching via the order-preserving assignment problem IEEE Transactions on Image Processing 15 7 1831 1838 10.1109/TIP.2006.877038 2478997 (Pubitemid 43985064)
34. T. Sebastian P. Klein B. Kimia 2003 On aligning curves PAMI 25 1 116 125
35. K. Siddiqi A. Shokoufandeh S. J. Dickinson S. W. Zucker 1999 Shock graphs and shape matching International Journal of Computer Vision 35 1 13 32 10.1023/A:1008102926703 (Pubitemid 30528015)
36. Thrun, S. (2002). Particle filters in robotics. In Proceedings of the 17th annual conference on uncertainty in AI (UAI).
37. Veltkamp, R. C., & Hagedoorn, M. (2001). State-of-the-art in shape matching (Tech. rep.). Principles of visual information retrieval.
38. Y. Zheng D. Doermann 2006 Robust point matching for nonrigid shapes by preserving local neighborhood structures IEEE Transactions on Pattern Analysis and Machine Intelligence 28 4 643 649 10.1109/TPAMI.2006.81 (Pubitemid 43264661)