메뉴 건너뛰기




Volumn 6313 LNCS, Issue PART 3, 2010, Pages 735-747

MRF inference by k-fan decomposition and tight Lagrangian relaxation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; MAGNETORHEOLOGICAL FLUIDS;

EID: 78149346969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15558-1_53     Document Type: Conference Paper
Times cited : (5)

References (24)
  • 1
    • 75149167171 scopus 로고    scopus 로고
    • A study of parts-based object class detection using complete graphs
    • Bergtholdt, M., Kappes, J., Schmidt, S., Schnörr, C.: A study of parts-based object class detection using complete graphs. Int. J. Comp. Vision 87(1-2), 93-117 (2010)
    • (2010) Int. J. Comp. Vision , vol.87 , Issue.1-2 , pp. 93-117
    • Bergtholdt, M.1    Kappes, J.2    Schmidt, S.3    Schnörr, C.4
  • 7
    • 34250521052 scopus 로고
    • Methods for solving nonlinear extremal problems
    • Ermoliev, Y.: Methods for solving nonlinear extremal problems. Cybernetics 2(4), 1-17 (1966)
    • (1966) Cybernetics , vol.2 , Issue.4 , pp. 1-17
    • Ermoliev, Y.1
  • 9
    • 61349174704 scopus 로고    scopus 로고
    • Robust higher order potentials for enforcing label consistency
    • Kohli, P., Ladický, L., Torr, P.H.: Robust higher order potentials for enforcing label consistency. Int. J. Comput. Vision 82(3), 302-324 (2009)
    • (2009) Int. J. Comput. Vision , vol.82 , Issue.3 , pp. 302-324
    • Kohli, P.1    Ladický, L.2    Torr, P.H.3
  • 10
    • 33750129298 scopus 로고    scopus 로고
    • Convergent tree-reweighted message passing for energy minimization. IEEE Trans
    • Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1568-1583 (2006)
    • (2006) Pattern Anal. Mach. Intell. , vol.28 , Issue.10 , pp. 1568-1583
    • Kolmogorov, V.1
  • 11
    • 70450199241 scopus 로고    scopus 로고
    • Beyond pairwise energies: Efficient optimization for higher-order MRFs
    • IEEE, Los Alamitos
    • Komodakis, N., Paragios, N.: Beyond pairwise energies: Efficient optimization for higher-order MRFs. In: CVPR, pp. 2985-2992. IEEE, Los Alamitos (2009)
    • (2009) CVPR , pp. 2985-2992
    • Komodakis, N.1    Paragios, N.2
  • 12
    • 50649087920 scopus 로고    scopus 로고
    • MRF optimization via dual decomposition: Message-passing revisited
    • IEEE, Los Alamitos
    • Komodakis, N., Paragios, N., Tziritas, G.: MRF optimization via dual decomposition: Message-passing revisited. In: ICCV, pp. 1-8. IEEE, Los Alamitos (2007)
    • (2007) ICCV , pp. 1-8
    • Komodakis, N.1    Paragios, N.2    Tziritas, G.3
  • 13
    • 59449084417 scopus 로고    scopus 로고
    • An analysis of convex relaxations for MAP estimation of discrete MRFs
    • Kumar, M.P., Kolmogorov, V., Torr, P.H.S.: An analysis of convex relaxations for MAP estimation of discrete MRFs. J. Mach. Learn. Res. 10, 71-106 (2009)
    • (2009) J. Mach. Learn. Res. , vol.10 , pp. 71-106
    • Kumar, M.P.1    Kolmogorov, V.2    Torr, P.H.S.3
  • 14
    • 0000686629 scopus 로고
    • A general method for solving extremum problems
    • Polyak, B.: A general method for solving extremum problems. Soviet Math. 8, 593-597 (1966)
    • (1966) Soviet Math. , vol.8 , pp. 593-597
    • Polyak, B.1
  • 15
    • 52949111496 scopus 로고    scopus 로고
    • Efficient belief propagation for higher-order cliques using linear constraint nodes
    • Potetz, B., Lee, T.S.: Efficient belief propagation for higher-order cliques using linear constraint nodes. Comput. Vis. Image Underst. 112(1), 39-54 (2008)
    • (2008) Comput. Vis. Image Underst. , vol.112 , Issue.1 , pp. 39-54
    • Potetz, B.1    Lee, T.S.2
  • 16
    • 70450213193 scopus 로고    scopus 로고
    • Minimizing sparse higher order energy functions of discrete variables
    • IEEE, Los Alamitos
    • Rother, C., Kohli, P., Feng, W., Jia, J.: Minimizing sparse higher order energy functions of discrete variables. In: CVPR, pp. 1382-1389. IEEE, Los Alamitos (2009)
    • (2009) CVPR , pp. 1382-1389
    • Rother, C.1    Kohli, P.2    Feng, W.3    Jia, J.4
  • 17
    • 34948910691 scopus 로고    scopus 로고
    • Optimizing binary MRFs via extended roof duality
    • IEEE Computer Society, Los Alamitos
    • Rother, C., Kolmogorov, V., Lempitsky, V.S., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: CVPR. IEEE Computer Society, Los Alamitos (2007)
    • (2007) CVPR
    • Rother, C.1    Kolmogorov, V.2    Lempitsky, V.S.3    Szummer, M.4
  • 18
    • 37549002539 scopus 로고    scopus 로고
    • A merit function approach to the subgradient method with averaging
    • Ruszczynski, A.: A merit function approach to the subgradient method with averaging. Optimization Methods Software 23(1), 161-172 (2008)
    • (2008) Optimization Methods Software , vol.23 , Issue.1 , pp. 161-172
    • Ruszczynski, A.1
  • 20
    • 80053283534 scopus 로고    scopus 로고
    • Tightening LP relaxations for MAP using message passing
    • McAllester, D.A., Myllymki, P. (eds.) AUAI Press
    • Sontag, D., Meltzer, T., Globerson, A., Jaakkola, T., Weiss, Y.: Tightening LP relaxations for MAP using message passing. In: McAllester, D.A., Myllymki, P. (eds.) UAI, pp. 503-510. AUAI Press (2008)
    • (2008) UAI , pp. 503-510
    • Sontag, D.1    Meltzer, T.2    Globerson, A.3    Jaakkola, T.4    Weiss, Y.5
  • 22
    • 77953225043 scopus 로고    scopus 로고
    • Joint optimization of segmentation and appearance models
    • Vicente, S., Kolmogorov, V., Rother, C.: Joint optimization of segmentation and appearance models. In: Proc. ICCV 2009 (2009)
    • (2009) Proc. ICCV 2009
    • Vicente, S.1    Kolmogorov, V.2    Rother, C.3
  • 23


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