DARWIN: A framework for machine learning and computer vision research and development

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 3533-3537

  Gould, Stephen ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Computer vision; Graphical models; Machine learning; Open source software

Indexed keywords

COMPUTER VISION APPLICATIONS; CORE COMPONENTS; GRAPHICAL MODEL; LEARNING DATA; OPEN-SOURCE; OPEN-SOURCE SOFTWARES; REFERENCE IMPLEMENTATION; STANDARD MACHINES; VISION RESEARCH;

GRAPHIC METHODS; GRAPHICAL USER INTERFACES; LEARNING SYSTEMS;

COMPUTER VISION;

EID: 84873417961     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. C. Barnes, E. Shechtman, A. Finkelstein, and D. B. Goldman. PatchMatch: A randomized correspondence algorithm for structural image editing. In SIGGRAPH, 2009.
2. J. E. Besag. On the statistical analysis of dirty pictures. Royal Stat. Soc. Series B, 48:259-302, 1986.
3. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In ICCV, 1999.
4. G. Bradski and A. Kaehler. Learning OpenCV: Computer Vision with the OpenCV Library. O'Reilly Media, 2008.
5. A. Criminisi. Microsoft research cambridge (MSRC) object recognition pixel-wise labeled image database (version 2), 2004. Available for download under license from MSR at http://research.microsoft.com/en-us/projects/ ObjectClassRecognition/.
6. M. S. Gashler. Waffles: A machine learning toolkit. JMLR, pages 2383-2387, July 2011. A. Globerson and T. Jaakkola. Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In NIPS, 2007.
7. S. Gould and Y. Zhang. PatchMatchGraph: Building a graph of dense patch correspondences for label transfer. In ECCV, 2012.
8. S. Gould, R. Fulton, and D. Koller. Decomposing a scene into geometric and semantically consistent regions. In ICCV, 2009.
9. X. He, R. S. Zemel, and M. Carreira-Perpinan. Multiscale conditional random fields for image labeling. In CVPR, 2004.
10. A. Jaimovich, O. Meshi, I. McGraw, and G. Elidan. FastInf: An efficient approximate inference library. JMLR, 11:1733-1736, 2010.
11. D. E. King. Dlib-ml: A machine learning toolkit. JMLR, 10:1755-1758, 2009. D. Koller and N. Friedman. Probabilistic Graphical Models: Principles and Techniques. MIT Press, 2009.
12. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. PAMI, 2006.
13. N. Komodakis, N. Paragios, and G. Tziritas. MRF optimization via dual decomposition: Messagepassing revisited. In ICCV, 2007.
14. C. Liu, J. Yuen, and A. Torralba. Nonparametric scene parsing: Label transfer via dense scene alignment. In CVPR, 2009.
15. O. Meshi and A. Globerson. An alternating direction method for dual MAP LP relaxation. In ECML, 2011.
16. J. M. Mooij. libDAI: A free and open source C++ library for discrete approximate inference in graphical models. JMLR, 11:2169-2173, Aug 2010.
17. J. Shotton, J. Winn, C. Rother, and A. Criminisi. TextonBoost: Joint appearance, shape and context modeling for multi-class object recognition and segmentation. In ECCV, 2006.
18. S. Sonnenburg, G. Ratsch, S. Henschel, C.Widmer, J. Behr, A. Zien, F. de Bona, A. Binder, C. Gehl, and V. Franc. The SHOGUN machine learning toolbox. JMLR, 11:1799-1802, June 2010.
19. D. Sontag, T. Meltzer, A. Globerson, T. Jaakkola, and Y.Weiss. Tightening LP relaxations forMAP using message passing. In UAI, 2008.
20. C. Yanover, T. Meltzer, and Y. Weiss. Linear programming relaxations and belief propagation - an empirical study. JMLR, 2006.