Structure learning in random fields for heart motion abnormality detection

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

Volumn , Issue , 2008, Pages

  Schmidt, Mark ^a   Murphy, Kevin ^a   Fung, Glenn ^b   Rosales, Rómer ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACOUSTIC WAVES; ARTIFICIAL INTELLIGENCE; COMPUTER VISION; EDUCATION; FEATURE EXTRACTION; IMAGE ENHANCEMENT; IMAGE PROCESSING; PATTERN RECOGNITION; ULTRASONIC APPLICATIONS; ULTRASONIC IMAGING; ULTRASONICS;

ABNORMALITY DETECTION; CLINICAL PRACTICES; CONDITIONAL RANDOM FIELDS; CONVEX OPTIMIZATION PROBLEMS; CORONARY HEART DISEASES; HEART MOTION; INTRA-OBSERVER VARIABILITY; LEFT VENTRICLE; NUMERICAL EXPERIMENTS; PENALIZED MAXIMUM-LIKELIHOOD; PROJECTION METHODS; RANDOM FIELDS; STRUCTURE-LEARNING; ULTRASOUND IMAGES;

STRUCTURAL OPTIMIZATION;

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

References (38)

1. G. Andrew and J. Gao. Scalable training of L1-regularized log-linear models. In ICML, 2007.
2. L. Armijo. Minimization of functions having Lipschitz-continuous first partial derivatives. Pacific J. of Mathematics, 16:1-3, 1966.
3. F. Bach and M. Jordan. Thin junction trees. In NIPS, 2001.
4. J. Barzilai and J. Borwein. Two point step size gradient methods. IMA J. of Numerical Analysis, 8:141-148, 1988.
5. J. Besag. Efficiency of pseudo-likelihood estimation for simple Gaussian fields. Biometrika, 64:616-618, 1977.
6. E. G. Birgin, J. M. Martinez, and M. Raydan. Nonmonotone spectral projected gradient methods on convex sets. SIAM J. on Optimization, 10(4):1196-1211, 2000.
7. D. M. Chickering. Optimal structure identification with greedy search. JMLR, 3:507-554, 2002.
8. C. K. Chow and C. N. Liu. Approximating discrete probability distributions with dependence trees. IEEE Trans. on Info. Theory, 14:462-67, 1968.
9. D. Grossman and P. Domingos. Learning Bayesian Network Classifiers by Maximizing Conditional Likelihood. In ICML, 2004.
10. Y. Guo and R. Greiner. Discriminative Model Selection for Belief Net Structures. In AAAI, 2005.
11. Y. Guo and D. Schuurmans. Convex Structure Learning for Bayesian Networks: Polynomial Feature Selection and Approximate Ordering. In UAI, 2006.
12. D. Heckerman, D. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for density estimation, collaborative filtering, and data visualization. JMLR, 1:49-75, 2000.
13. D. Heckerman, D. Geiger, and M. Chickering. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning, 20(3):197-243, 1995.
14. G. Hinton. Training products of experts by minimizing contrastive divergence. N. Comput., 14:1771-1800, 2002.
15. J. Johnson, V. Chandrasekaran, and A. Willsky. Learning Markov Structure by Maximum Entropy Relaxation. In AI/Statistics, 2007.
16. Y. Kim, J. Kim, and Y. Kim. Blockwise sparse regression. Statistica Sinica, 16(2):375-390, 2006.
17. M. Koivisto and K. Sood. Exact Bayesian structure discovery in Bayesian networks. JMLR, 5:549-573, 2004.
18. S. Kok and P. Domingos. Learning the Structure of Markov Logic Networks. In ICML, 2005.
19. S. Kumar and M. Hebert. Discriminative random fields: A discriminative framework for contextual interaction in classification. In IEEE Conf. on Computer Vision and Pattern Recognition, 2003.
20. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML, 2001.
21. S. Lee, H. Lee, P. Abbeel, and A. Ng. Efficient L1 Regularized Logistic Regression. In AAAI, 2006.
22. S.-I. Lee, V. Ganapathi, and D. Koller. Efficient structure learning of Markov networks using L1-regularization. In NIPS, 2006.
23. A. McCallum, D. Freitag, and F. Pereira. Maximum Entropy Markov Models for Information Extraction and Segmentation. In ICML, 2000.
24. L. Meier, S. van de Geer, and P. Buhlmann. The group lasso for logistic regression. Technical Report 131, ETH Seminar fur Statistik, 2006.
25. N. Meinshausen and P. Buhlmann. High dimensional graphs and variable selection with the lasso. The Annals of Statistics, 34:1436-1462, 2006.
26. M. Narasimhan and J. Bilmes. A Supermodular-Submodular Procedure with Applications to Discriminative Structure Learning. In UAI, 2005.
27. S. Parise and M. Welling. Structure learning in Markov Random Fields. In NIPS, 2006.
28. M. Y. Park and T. Hastie. Regularization path algorithms for detecting gene interactions. Technical report, Stanford, 2006.
29. F. Pernkopf and J. Bilmes. Discriminative versus Generative Parameter and Structure Learning of Bayesian Network Classifiers. In ICML, 2005.
30. M. Qazi, G. Fung, S. Krishnan, R. Rosales, H. Steck, B. Rao, and D. Poldermans. Automated Heart Wall Motion Abnormality Detection from Ultrasound Images Using Bayesian Networks. In Intl. Joint Conf. on AI, 2007.
31. M. Raydan. The barzilai and borwein gradient method for the large scale unconstrained minimization problem. SIAM J. on Optimization, 7(1):26-33, 1997.
32. F. Sha and F. Pereira. Shallow parsing with conditional random fields. In Proc. HLT-NAACL, 2003.
33. T. Simila and J. Tikka. Input selection and shrinkage in multiresponse linear regression. Computational Statistics and Data Analysis, 2007. To appear.
34. M. Teyssier and D. Koller. Ordering-based search: A simple and effective algorithm for learning bayesian networks. In UAI, pages 584-590, 2005.
35. B. Turlach, W. Venables, and S. Wright. Simultaneous variable selection. Technometrics, 47(3):349-363, 2005.
36. 1-regularized pseudo-likelihood. In NIPS, 2006.
37. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. J. Royal Statistical Society, Series B, 68(1):49-67, 2006.
38. X. S. Zhou, D. Comaniciu, and A. Gupta. An information fusion framework for robust shape tracking. TPAMI, 27, NO. 1:115-129, January 2005.