Smoothing-based optimization

26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR

Volumn , Issue , 2008, Pages

  Leordeanu, Marius ^a   Hebert, Martial ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING; ARTIFICIAL INTELLIGENCE; CHLORINE COMPOUNDS; COMPUTER APPLICATIONS; COMPUTER VISION; FEATURE EXTRACTION; GRADIENT METHODS; IMAGE PROCESSING; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PATTERN RECOGNITION; SIMULATED ANNEALING;

COMPLEX OPTIMIZATION; COMPUTER VISION APPLICATIONS; EFFICIENT METHODS; GLOBAL MAXIMUM; GROWTH TRANSFORMATION; LOCAL OPTIMUM; OPTIMIZATION METHODS; SCALE SPACES; SCALE-SPACE THEORY;

COMPUTATIONAL METHODS;

EID: 51949119460     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587482     Document Type: Conference Paper

References (27)

1. vasc.ri.cmu.edu/idb/html/motion/hotel/index.html.
2. vasc.ri.cmu.edu/idb/html/motion/house/index.html.
3. L. Baum and G. Sell. Growth transformations for functions on manifolds. In Pacific Journal of Mathematics, 1968.
4. S. Belongie, J. Malik, and J. Puzicha. Shape context: A new descriptor for shape matching and object recognition. In NIPS, 2000.
5. A. Berg, T. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. In ECCV, 2006.
6. A. Blake and A. Zisserman. Visual Reconstruction. MIT Press, 1987.
7. T. Caetano, L. Cheng, Q. Le, and A. J. Smola. Learning graph matching. In ICCV, 2007.
8. J. Cheng and M. J. Druzdzel. Ais-bn: An adaptive importance sampling algorithm for evidential reasoning in large bayesian networks. In Journal of Artificial Intelligence Research, 2000.
9. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. PAMI, 24(5):603-619, 2002.
10. D. Comaniciu, V. Ramesh, and P. Meer. The variable bandwidth mean shift and data-driven scale selection. In ICCV, 2001.
11. W. P. et al. Numerical Recipes in C. Cambridge University Press, 1999.
12. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. In PAMI, 1996.
13. D. Kanevsky. Extended baum transformations for general functions. In Acoustics, Speech, and Signal Processing, 2004.
14. A. Kuijper, L. Florack, and M. Viergever. Scale space hierarchy. In Journal of Mathematical Imaging and Vision, 2003.
15. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, 2005.
16. S. Z. Li. Markov Random Field Modeling in Computer Vision. Springer, 1995.
17. Y. Li, J. Sun, and C. T. H. Shum. Lazy snapping. 2004.
18. T. Lindeberg. Scale-space behaviour of local extrema and blobs. In Journal of Mathematical Imaging and Vision, 1992.
19. T. Lindeberg. Scale-space theory in computer vision. In The Kluwer International Series in Engineering and Computer Science, 1994.
20. M. Loog, J. J. Duistermaat, and L. M. J. Florack. On the behavior of spatial critical points under gaussian blurring. In International Conference on Scale-Space and Morphology in Computer Vision, 2001.
21. N. Metropolis and S. Ulam. The monte carlo method. In Journal of the American Statistical Association, 1949.
22. C. Rother, V. Kolmogorov, and A. Blake. Grabcut: Interactive foreground extraction using iterated graph cuts. In SIGGRAPH, 2004.
23. R. Rubinstein. The cross-entropy method for combinatorial and continuous optimization. In Methodology and Computing in Applied Probability, 1999.
24. R. D. Shachter and M. A. Peot. Simulation approaches to general probabilistic inference on belief networks. In Uncertainty in Artificial Intelligence, 1989.
25. C. Sminchisescu and B. Triggs. Fast mixing hyperdynamic sampling. In JIVC, 2004.
26. Tu and S. C. Zhu. Image segmentation by data driven markov chain monte carlo. In PAMI, 2002.
27. Tu and S. C. Zhu. Image parsing: unifying segmentation, detection and recognition. In IJCV, 2005.