메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Maximal cliques that satisfy hard constraints with application to deformable object model learning

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; DEFORMATION; GRAPH THEORY;

EID: 85162424447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (20)
  • 3
    • 0036504051 scopus 로고    scopus 로고
    • A survey of convergence results on particle filtering methods for practitioners
    • D. Crisan and A. Doucet. A survey of convergence results on particle filtering methods for practitioners. IEEE Transactions on Signal Processing, 50(3):736-746, 2002.
    • (2002) IEEE Transactions on Signal Processing , vol.50 , Issue.3 , pp. 736-746
    • Crisan, D.1    Doucet, A.2
  • 5
    • 33947508056 scopus 로고    scopus 로고
    • Hierarchical linear/constant time slam using particle filters for dense maps
    • A. Eliazar and P. Ronald. Hierarchical linear/constant time slam using particle filters for dense maps. In Advances in Neural Information Processing Systems 18, pages 339-346. 2006.
    • (2006) Advances in Neural Information Processing Systems , vol.18 , pp. 339-346
    • Eliazar, A.1    Ronald, P.2
  • 9
    • 34948832159 scopus 로고    scopus 로고
    • Object detection by contour segment networks
    • V. Ferrari, T. Tuytelaars, and L. V. Gool. Object detection by contour segment networks. ECCV, 2006.
    • (2006) ECCV
    • Ferrari, V.1    Tuytelaars, T.2    Gool, L.V.3
  • 11
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, 1956.
    • (1956) Proceedings of the American Mathematical Society
    • Kruskal, J.B.1


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