메뉴 건너뛰기




Volumn 2191, Issue , 2001, Pages 353-360

Convex relaxations for binary image partitioning and perceptual grouping

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER VISION; RELAXATION PROCESSES;

EID: 64749088830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45404-7_47     Document Type: Conference Paper
Times cited : (5)

References (9)
  • 1
    • 0021518209 scopus 로고
    • Stochastic relaxation, gibbs distributions, and the bayesian restoration of images
    • S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans. Patt. Anal. Mach. Intell., 6(6):721–741, 1984.
    • (1984) IEEE Trans. Patt. Anal. Mach. Intell , vol.6 , Issue.6 , pp. 721-741
    • Geman, S.1    Geman, D.2
  • 2
    • 0000013152 scopus 로고
    • On the analysis of dirty pictures (With discussion)
    • J.E. Besag. On the analysis of dirty pictures (with discussion). J. R. Statist. Soc. B, 48:259–302, 1986.
    • (1986) J. R. Statist. Soc. B , vol.48 , pp. 259-302
    • Besag, J.E.1
  • 3
    • 0027656539 scopus 로고
    • Figure-ground discrimination: A combinatorial optimization approach
    • L. Herault and R. Horaud. Figure-ground discrimination: A combinatorial optimization approach. IEEE Trans. Patt. Anal. Mach. Intell., 15(9):899–914, 1993.
    • (1993) IEEE Trans. Patt. Anal. Mach. Intell , vol.15 , Issue.9 , pp. 899-914
    • Herault, L.1    Horaud, R.2
  • 6
    • 0001154274 scopus 로고
    • Cones of matrices and set–functions and 0–1 optimization
    • L. Lovasz and A. Schrijver. Cones of matrices and set–functions and 0–1 optimization. SIAM J. Optimization, 1(2):166–190, 1991.
    • (1991) SIAM J. Optimization , vol.1 , Issue.2 , pp. 166-190
    • Lovasz, L.1    Schrijver, A.2
  • 7
    • 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. J. ACM, 42:1115–1145, 1995.
    • (1995) J. ACM , vol.42 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 8
    • 0024057651 scopus 로고
    • Ill-posed problems in early vision
    • M. Bertero, T. Poggio, and V. Torre. Ill-posed problems in early vision. Proc. IEEE, 76:869–889, 1988.
    • (1988) Proc. IEEE , vol.76 , pp. 869-889
    • Bertero, M.1    Poggio, T.2    Torre, V.3
  • 9
    • 0033294696 scopus 로고    scopus 로고
    • Mixed linear and semidefinite programming for combinatorial and quadratic optimization
    • S.J. Benson, Y. Ye, and X. Zhang. Mixed linear and semidefinite programming for combinatorial and quadratic optimization. Optimiz. Methods and Software, 11&12:515–544, 1999.
    • (1999) Optimiz. Methods and Software , vol.11 , pp. 515-544
    • Benson, S.J.1    Ye, Y.2    Zhang, X.3


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