메뉴 건너뛰기




Volumn , Issue , 2010, Pages 2831-2838

Search strategies for multiple landmark detection by submodular maximization

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COSTS; CONSTANT FACTOR APPROXIMATION; CT IMAGE; DATA SETS; HUMAN BODIES; LANDMARK DETECTION; OPTIMAL SPEED; RELATIVE POSITIONS; SEARCH SPACES; SEARCH STRATEGIES; SUBMODULAR; SUBMODULAR FUNCTIONS;

EID: 77955987705     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5540016     Document Type: Conference Paper
Times cited : (57)

References (25)
  • 1
    • 0000013152 scopus 로고
    • On the statistical analysis of dirty pictures
    • J. Besag. On the statistical analysis of dirty pictures. Journal of Royal Statistical Soc., B-48:259-302, 1986.
    • (1986) Journal of Royal Statistical Soc. , vol.B-48 , pp. 259-302
    • Besag, J.1
  • 5
    • 0015285440 scopus 로고
    • Use of the Hough transformation to detect lines and curves in pictures
    • R. O. Duda and P. E. Hart. Use of the Hough transformation to detect lines and curves in pictures. Comm. ACM, 15:11-15, 1972.
    • (1972) Comm. ACM , vol.15 , pp. 11-15
    • Duda, R.O.1    Hart, P.E.2
  • 9
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
    • (1995) Journal of the ACM , vol.42 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 17
    • 0000095809 scopus 로고
    • An analysis of the approximations for maximizing submodular set functions
    • G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
    • (1978) Mathematical Programming , vol.14 , pp. 265-294
    • Nemhauser, G.1    Wolsey, L.2    Fisher, M.3
  • 18
    • 77956003659 scopus 로고    scopus 로고
    • Dynamic action spaces for information gain maximization in search and exploration
    • N. Roy and C. Earnest. Dynamic action spaces for information gain maximization in search and exploration. In American Control Conference, pages 6-11, 2006.
    • (2006) American Control Conference , pp. 6-11
    • Roy, N.1    Earnest, C.2
  • 19
    • 0034311821 scopus 로고    scopus 로고
    • A combinatorial algorithm minimizing submodular functions in strongly polynomial time
    • A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, B(80):346-355, 2000.
    • (2000) Journal of Combinatorial Theory , vol.B , Issue.80 , pp. 346-355
    • Schrijver, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.