Multiclass image labeling with semidefinite programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3952 LNCS, Issue , 2006, Pages 454-467

  Keuchel, Jens ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; GRAPH THEORY; LAGRANGE MULTIPLIERS; MARKOV PROCESSES; STATISTICAL METHODS;

COMBINATORIAL COMPLEXITY; IMAGE LABELING; MARKOV RANDOM FIELDS; SEMIDEFINITE RELAXATION TECHNIQUE;

IMAGE PROCESSING;

EID: 33745815687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11744047_35     Document Type: Conference Paper

References (20)

1. Winkler, G.: Image Analysis, Random Fields and Dynamic Monte Carlo Methods. Volume 27 of Appl. of Mathematics. Springer (1995)
2. Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. PAMI 6 (1984) 721-741
3. Besag, J.: On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society, Series B 48 (1986) 259-302
4. Li, S.Z.: Markov Random Field Modeling in Image Analysis. Springer (2001)
5. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. PAMI 23 (2001) 1222-1239
6. Blake, A., Zisserman, A.: Visual Reconstruction. MIT Press (1987)
7. Hofmann, T., Buhmann, J.: Pairwise data clustering by deterministic annealing. IEEE Trans. PAMI 19 (1997) 1-14
8. Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. Journal of the ACM 49 (2002) 616-639
9. Keuchel, J., Schnörr, C., Schellewald, C., Cremers, D.: Binary partitioning, perceptual grouping, and restoration with semidefinite programming. IEEE Trans. PAMI 25 (2003) 1364-1379
10. Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Combinat. Optim. 2 (1998) 71-109
11. Wolkowicz, H., Anjos, M.F.: Semidefinite programming for discrete optimization and matrix completion problems. Discr. Appl. Math. 123 (2002) 513-577
12. Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In Aardal, K., Nemhauser, G.L., Weismantel, R., eds.; Discrete Optimization. Volume 12 of Handbooks in Op. Res. and Man. Sci. Elsevier (2005)
13. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. PAMI 26 (2004) 147-159
14. Rother, C., Kumar, S., Kolmogorov, V., Blake, A.: Digital tapestry. In: Proceedings CVPR (1). (2005) 589-596
15. Raj, A., Zabih, R.: A graph cut algorithm for generalized image deconvolution. In: Proc. 10th Int. Conf. Computer Vision (ICCV). (2005) 1048-1054
16. Wolkowicz, H., Saigal, R., Vandenberghe, L., eds.: Handbook of Semidefinite Programming. Volume 27 of International Series in Operations Research & Management Science. Kluwer Acad. Publ., Boston (2000)
17. Çela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Acad. Publishers, Dordrecht (1998)
18. Brixius, N., Anstreicher, K.: Solving quadratic assignment problems using convex quadratic programming relaxations. Optim. Methods Software 16 (2001) 49-68
19. Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimization 5 (1995) 13-51
20. Koćvara, M., Stingl, M.: PENNON - a code for convex nonlinear and semidefinite programming. Optimization Methods and Software 18 (2003) 317-333