메뉴 건너뛰기




Volumn , Issue , 2008, Pages

High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; FACILITIES; FEATURE EXTRACTION; FLOW INTERACTIONS; HIDDEN MARKOV MODELS; IMAGE PROCESSING; MAPS; PATTERN RECOGNITION; SEMICONDUCTOR DOPING; SEPARATION; STRUCTURAL FRAMES;

EID: 51949116660     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587355     Document Type: Conference Paper
Times cited : (66)

References (26)
  • 1
    • 51949084328 scopus 로고    scopus 로고
    • C. Bessiere. Constraint propagation. In Handbook of Constraint Programming, chapter 3. Elsevier, 2006. Also technical report LIRMM 06020.
    • C. Bessiere. Constraint propagation. In Handbook of Constraint Programming, chapter 3. Elsevier, 2006. Also technical report LIRMM 06020.
  • 2
    • 84880909886 scopus 로고    scopus 로고
    • Optimal soft arc consistency
    • Hyderabad, India
    • M. Cooper, S. de Givry, and T. Schiex. Optimal soft arc consistency. In Proc. IJCAI, Hyderabad, India, 2007.
    • (2007) Proc. IJCAI
    • Cooper, M.1    de Givry, S.2    Schiex, T.3
  • 3
    • 51949119384 scopus 로고    scopus 로고
    • Minimization of locally-defined submodular functions by optimal soft arc consistency
    • M. C. Cooper. Minimization of locally-defined submodular functions by optimal soft arc consistency. Constraints, 13(4), 2008.
    • (2008) Constraints , vol.13 , Issue.4
    • Cooper, M.C.1
  • 4
    • 51949083306 scopus 로고    scopus 로고
    • M. M. Deza and M. Laurent. Geometry of Cuts and Metrics. Number 15 in Algorithms and Combinatorics. Springer, Berlin, Germany, 1997.
    • M. M. Deza and M. Laurent. Geometry of Cuts and Metrics. Number 15 in Algorithms and Combinatorics. Springer, Berlin, Germany, 1997.
  • 5
    • 0021376406 scopus 로고
    • Roof duality, complementation and persistency in quadratic 0-1 optimization
    • P. L. Hammer, P. Hansen, and B. Simeone. Roof duality, complementation and persistency in quadratic 0-1 optimization. Math. Programming, 28:121-155, 1984.
    • (1984) Math. Programming , vol.28 , pp. 121-155
    • Hammer, P.L.1    Hansen, P.2    Simeone, B.3
  • 6
    • 0029484941 scopus 로고
    • Tractable constraints on ordered domains
    • P. Jeavons and M. Cooper. Tractable constraints on ordered domains. Artificial Intelligence, 79(2):327-339, 1995.
    • (1995) Artificial Intelligence , vol.79 , Issue.2 , pp. 327-339
    • Jeavons, P.1    Cooper, M.2
  • 7
    • 33750129298 scopus 로고    scopus 로고
    • Convergent tree-reweighted message passing for energy minimization
    • V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Analysis and Machine Intelligence, 28(10):1568-1583, 2006.
    • (2006) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.28 , Issue.10 , pp. 1568-1583
    • Kolmogorov, V.1
  • 8
    • 0032178207 scopus 로고    scopus 로고
    • The partial constraint satisfaction problem: Facets and lifting theorems
    • A. Koster, C. P. M. van Hoesel, and A.W. J. Kolen. The partial constraint satisfaction problem: Facets and lifting theorems. Operations Research Letters, 23(3-5):89-97, 1998.
    • (1998) Operations Research Letters , vol.23 , Issue.3-5 , pp. 89-97
    • Koster, A.1    van Hoesel, C.P.M.2    Kolen, A.W.J.3
  • 10
    • 51949091312 scopus 로고
    • A diffusion algorithm for decreasing energy of max-sum labeling problem. Glushkov Institute of Cybernetics, Kiev, USSR
    • V. A. Kovalevsky and V. K. Koval. A diffusion algorithm for decreasing energy of max-sum labeling problem. Glushkov Institute of Cybernetics, Kiev, USSR. Unpublished, approx. 1975.
    • (1975) Unpublished, approx
    • Kovalevsky, V.A.1    Koval, V.K.2
  • 14
    • 35148886004 scopus 로고    scopus 로고
    • Transforming an arbitrary Min-Sum problem into a binary one
    • Technical Report TUD-FI06-01, Dresden University of Technology, Germany, April
    • D. Schlesinger and B. Flach. Transforming an arbitrary Min-Sum problem into a binary one. Technical Report TUD-FI06-01, Dresden University of Technology, Germany, April 2006.
    • (2006)
    • Schlesinger, D.1    Flach, B.2
  • 15
    • 34249735674 scopus 로고
    • False minima of the algorithm for minimizing energy of max-sum labeling problem. Glushkov Institute of Cybernetics, Kiev, USSR
    • Unpublished
    • M. I. Schlesinger. False minima of the algorithm for minimizing energy of max-sum labeling problem. Glushkov Institute of Cybernetics, Kiev, USSR. Unpublished, 1976.
    • (1976)
    • Schlesinger, M.I.1
  • 16
    • 33947143988 scopus 로고
    • Syntactic analysis of two-dimensional visual signals in noisy conditions
    • In Russian
    • M. I. Schlesinger. Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika, 4:113-130, 1976. In Russian.
    • (1976) Kibernetika , vol.4 , pp. 113-130
    • Schlesinger, M.I.1
  • 18
    • 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. Combinatorial Theory, Ser. B, 80(2):346-355, 2000.
    • (2000) Combinatorial Theory, Ser. B , vol.80 , Issue.2 , pp. 346-355
    • Schrijver, A.1
  • 20
    • 33745817089 scopus 로고    scopus 로고
    • R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for Markov random fields. In European Conf. Computer Vision (ECCV), pages II: 16-29, 2006.
    • R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for Markov random fields. In European Conf. Computer Vision (ECCV), pages II: 16-29, 2006.
  • 21
    • 51949106419 scopus 로고    scopus 로고
    • D. M. Topkis. Supermodularity and Complementarity. Frontiers of Economic Research. Princeton University Press, Princeton, NJ, 1998.
    • D. M. Topkis. Supermodularity and Complementarity. Frontiers of Economic Research. Princeton University Press, Princeton, NJ, 1998.
  • 23
    • 27744456278 scopus 로고    scopus 로고
    • MAP estimation via agreement on (hyper)trees: Message passing and linear programming approaches
    • M. Wainwright, T. Jaakkola, and A. Willsky. MAP estimation via agreement on (hyper)trees: message passing and linear programming approaches. IEEE Trans. Information Theory, 51(11):3697-3717, 2005.
    • (2005) IEEE Trans. Information Theory , vol.51 , Issue.11 , pp. 3697-3717
    • Wainwright, M.1    Jaakkola, T.2    Willsky, A.3
  • 24
    • 33947118486 scopus 로고    scopus 로고
    • A linear programming approach to max-sum problem: A review
    • Technical Report CTU-CMP-2005-25, Center for Machine Perception, Czech Technical University, December
    • T. Werner. A linear programming approach to max-sum problem: A review. Technical Report CTU-CMP-2005-25, Center for Machine Perception, Czech Technical University, December 2005.
    • (2005)
    • Werner, T.1
  • 25
    • 34249652006 scopus 로고    scopus 로고
    • A linear programming approach to max-sum problem: A review
    • July
    • T. Werner. A linear programming approach to max-sum problem: A review. IEEE Trans. Pattern Analysis and Machine Intelligence, 29(7):1165-1179, July 2007.
    • (2007) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.29 , Issue.7 , pp. 1165-1179
    • Werner, T.1
  • 26
    • 34249752469 scopus 로고    scopus 로고
    • Unified framework for semiring-based arc consistency and relaxation labeling
    • M. Grabner and H. Grabner, editors, Austria, Graz University of Technology, February
    • T. Werner and A. Shekhovtsov. Unified framework for semiring-based arc consistency and relaxation labeling. In M. Grabner and H. Grabner, editors, 12th Computer Vision Winter Workshop, St. Lambrecht, Austria, pages 27-34. Graz University of Technology, February 2007.
    • (2007) 12th Computer Vision Winter Workshop, St. Lambrecht , pp. 27-34
    • Werner, T.1    Shekhovtsov, A.2


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