Binary partitioning, perceptual grouping, and restoration with semidefinite programming

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 25, Issue 11, 2003, Pages 1364-1379

  Keuchel, Jens ^a   Schnörr, Christoph ^a   Schellewald, Christian ^a   Cremers, Daniel ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Combinatorial optimization; Convex optimization; Convex programming; Figure ground discrimination; Graph cuts; Image partitioning; Perceptual grouping; Relaxation; Segmentation

Indexed keywords

DECISION THEORY; GRAPH THEORY; IMAGE SEGMENTATION; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES;

BINARY DECISION VARIABLES; FIGURE GROUND DISCRIMINATION; IMAGE PARTITIONING; SPECTRAL GRAPH THEORY;

COMPUTER VISION;

EID: 0442312145     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2003.1240111     Document Type: Article

References (71)

1. A. Amir and M. Lindenbaum, "A Generic Grouping Algorithm and Its Quantitative Analysis," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 2, pp. 168-185, Feb. 1998.
2. A. Barvinok, "Problems of Distance Geometry and Convex Properties of Quadratic Maps," Discrete Computational Geometry, vol. 13, no. 2, pp. 189-202, 1995.
3. S.J. Benson, Y. Ye, and X. Zhang, "Mixed Linear and Semidefinite Programming for Combinatorial and Quadratic Optimization," Optimization Methods and Software, vol. 11 and 12, pp. 515-544, 1999.
4. M. Bertero, T. Poggio, and V. Torre, "Ill-Posed Problems in Early Vision," Proc. IEEE, vol. 76, pp. 869-889, 1988.
5. J.E. Besag, "On the Statistical Analysis of Dirty Pictures," J. Royal Statistical Soc. B, vol. 48, pp. 259-302, 1986.
6. A. Blake and A. Zisserman, Visual Reconstruction. MIT Press, 1987.
7. R.B. Boppana, "Eigenvalues and Graph Bisection: An Average-Case Analysis," Proc. 28th Ann. IEEE Symp. Foundations of Computer Science, pp. 280-285, 1987.
8. C.F. Borges, "On the Estimation of Markov Random Field Parameters," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 3, pp. 216-224, Mar. 1999.
9. Y. Boykov, O. Veksler, and R. Zabih, "Markov Random Fields with Efficient Approximations," Proc. IEEE Conf. Computer Vision Pattern Recognition (CVPR '98), pp. 648-655. 1998.
10. Y. Boykov, O. Veksler, and R. Zabih, "Fast Approximate Energy Minimization via Graph Cuts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, Nov. 2001.
11. P.B. Chou and C.M. Brown, "Multimodal Reconstruction and Segmentation with Markov Random Fields and HCF Optimization," Proc. DARPA Image Understanding Workshop, pp. 214-221, Apr. 1988.
12. D. Comaniciu and P. Meer, "Mean Shift: A Robust Approach toward Feature Space Analysis," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603-619, May 2002.
13. T.M. Cover, "Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition," IEEE Trans. Electronic Computers, vol. 14, pp. 326-334, 1965.
14. T.F. Cox and M.A. Cox, Multidimensional Scaling. London: Chapman and Hall, 1994.
15. C. Delorme and S. Poljak, "Combinatorial Properties and the Complexity of a Max-Cut Approximation," European J. Combinatorics, vol. 14, pp. 313-333, 1993.
16. C. Delorme and S. Poljak, "Laplacian Eigenvalues and the Maximum Cut Problem," Math. Programming, vol. 62, pp. 557-574, 1993.
17. L. Devroye, "Automatic Pattern Recognition: A Study of the Probability of Error," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 4, pp. 530-543, 1988.
18. R. Diestel, Graph Theory. Springer 1996.
19. R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. New York: John Wiley & Sons, 1973.
20. "FEX-homepage," http://www.ipb.uni-bonn.de/ipb/projects/fex/fex.html, Inst. of Photogrammetry, Univ. of Bonn, Germany, 2003.
21. M. Fiedler, "A Property of Eigenvectors of Nonnegative Symmetric Matrices and Its Application to Graph Theory," Czechoslovak Math. J., vol. 25, no. 2, pp. 619-633, 1975.
22. B. Fischer, T. Zöller, and J.M. Buhmann, "Path Based Pairwise Data Clustering with Application to Texture Segmentation," Proc. Energy Minimization Methods in Computer Vision and Pattern Recognition, M. Figueiredo, J. Zerubia, and A.K. Jain, eds., pp. 235-250, 2001.
23. D.A. Forsyth, J. Haddon, and S. Ioffe, "The Joy of Sampling," Int'l J. Computer Vision, vol. 41, no. 1/2, pp. 109-134, 2001.
24. A. Frieze, and M. Jerrum, "Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION," Algorithmica, vol. 18, pp. 67-81, 1997.
25. K. Fukunaga, Introduction to Statistical Pattern Recognition. Academic Press, 1990.
26. Y. Gdalyahu, D. Weinshall, and M. Werman, "Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1053-1074, Oct. 2001.
27. D. Geiger and F. Girosi, "Parallel and Deterministic Algorithms from MRF's: Surface Reconstruction," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 5, pp. 401-412, May 1991.
28. D. Geman, "Random Fields and Inverse Problems in Imaging," École d' Été de Probabilités de Saint-Flour XVIII-1988, P.L. Hennequin, ed., vol. 1427, pp. 113-193, 1990.
29. S. Geman and D. Geman, "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Gibbs Distributions, and the Bayesian Restoration of Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721-741, 1984.
30. M.X. Goemans and D.P. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," J. ACM, vol. 42, no. 6, pp. 1115-1145, June 1995.
31. S. Gold and A. Rangarajan, "A Graduated Assignment Algorithm for Graph Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, Apr. 1996.
32. F. Heitz, P. Perez, and P. Bouthemy, "Multiscale Minimization of Global Energy Functions in Some Visual Recovery Problems," CVGIP-Image Understanding, vol. 59, no. 1, pp. 125-134, 1994.
33. L. Herault and R. Horaud, "Figure-Ground Discrimination: Combinatorial Optimization Approach," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 899-914, Sept. 1993.
34. T. Hofmann and J. Buhmann, "Pairwise Data Clustering by Deterministic Annealing," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19 no. 1, pp. 1-14, Jan. 1997.
35. H. Ishikawa, "Global Optimization Using Embedded Graphs," PhD dissertation, Dept. of Computer Science, Courant Inst. of Math. and Sciences, New York Univ., 2000.
36. D.W. Jacobs, "Robust and Efficient Detection of Salient Convex Groups," IEEE Trans. Pattern Analysis and Machine Intelligence vol. 18, no. 1, pp. 23-37, Jan. 1996.
37. D.R. Karger and C. Stein, "A New Approach to the Minimum Cut Problem," J. ACM, vol. 43, no. 4, pp. 601-640, 1996.
38. L. Kaufman and P.J. Rousseeuw, Finding Groups in Data. New York: John Wiley & Sons, 1990.
39. J. Keuchel, C. Schnörr, C. Schellewald, and D. Cremers, "Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming," Technical Report 5/2002, Computer Science Series, CVGPR Group, Univ. of Mannheim, http://www.cvgpr.uni-mannheim.de/Publications/TR_5_02.pdf. 2002.
40. Perception as Bayesian Inference, D.C. Knill and W. Richards, eds. Cambridge Univ. Press, 1996.
41. M. Laurent and S. Poljak, "On a Positive Semidefinite Relaxation of the Cut Polytope," Linear Algebra and Its Applications, vol. 223/224, no. 1-3, pp. 439-461, 1995.
42. Y.G. Leclerc, "Constructing Simple Stable Descriptions for Image Partitioning," Int'l J. Computer Vision, vol. 3, no. 1, pp. 73-102, 1989.
43. S.Z. Li, Markov Random Field Modeling in Computer Vision. Tokyo: Springer-Verlag, 1995.
44. L. Lovász and A. Schrijver, "Cones of Matrices and Set-Functions and 0-1 Optimization," SIAM J. Optimization, vol. 1, no. 2, pp. 166-190, 1991.
45. J. Malik, S. Belongie, T. Leung, and J. Shi, "Contour and Texture Analysis for Image Segmentation," Int'l J. Computer Vision, vol. 43, no. 1, pp. 7-27, 2001.
46. B. Mohar and S. Poljak, "Eigenvalues in Combinatorial Optimization," Combinatorial and Graph-Theoretical Problems in Linear Algebra, R.A. Brualdi, S. Friedland, and V. Klee, eds., vol. 50, pp. 107-151, 1993.
47. Y. Nesterov, "Quality of Semidefinite Relaxation for Nonconvex Quadratic Optimization," Technical Report, CORE, Université Catholique de Louvain, Belgium, 1997.
48. Y. Nesterov and A. Nemirovskii, Interior Point Polynomial Methods in Convex Programming. SIAM, 1994.
49. G. Pataki, "On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues," Math. Operations Research, vol. 23, no. 2, pp. 339-358, 1998.
50. C. Peterson and B. Söderberg, "Artificial Neural Networks," Local Search in Combinatorial Optimization, E. Aarts and J.K. Lenstra, eds., chapter 7. Chicheter: Wiley & Sons, 1997.
51. S. Poljak and F. Rendl, "Nonpolyhedral Relaxations of Graph Bisection Problems," SIAM J. Optimization, vol. 5, pp. 467-487, 1995.
52. J. Puzicha, J.M. Buhmann, Y. Rubner, and C. Tomasi, "Empirical Evaluation of Dissimilarity Measures for Color and Texture," Proc. Int'l Conf. Computer Vision (ICCV '99), pp. 1165-1172, 1999.
53. F. Rendl and H. Wolkowicz, "A Projection Technique for Partitioning the Nodes of a Graph," Annals of Operations Research, vol. 58, pp. 155-180, 1995.
54. K. Rose, E. Gurewitz, and G.C. Fox, "Constrained Clustering as an Optimization Method," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 8, pp. 785-794, Aug. 1993.
55. S. Sarkar and K.L. Boyer, "Perceptual Organization in Computer Vision: A Review and a Proposal for a Classificatory Structure," IEEE Trans. Systems, Man, and Cybernetics, vol. 23, no. 2, pp. 382-399, 1993.
56. M. Sato and S. Ishii, "Bifurcations in Mean-Field-Theory Annealing," Physical Rev. E, vol. 53, no. 5, pp. 5153-5168, 1996.
57. C. Schellewald, J. Keuchel, and C. Schnörr, "Image Labeling and Grouping by Minimizing Linear Functionals over Cones," Proc. Energy Minimization Methods in Computer Vision and Pattern Recognition, M. Figueiredo, J. Zerubia, and A.K. Jain, eds., pp. 235-250, 2001.
58. J. Shi and J. Malik, "Normalized Cuts and Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905 Aug. 2000.
59. L. Vandenberghe and S. Boyd, "Semidefinite Programming," SIAM Rev., vol. 38, no. 1, pp. 49-95, 1996.
60. V. Vapnik, Estimation of Dependencies Based on Empirical Data. Springer, 1982.
61. "Vision Texture Database," http://www-white.media.mit.edu/vismod/imagery/VisionTexture/vistex.html 2003.
62. Y. Weiss, "Segmentation Using Eigenvectors: A Unifying View," Proc. Int'l Conf. Computer Vision (ICCV '99), pp. 975-982, 1999.
63. L.R. Williams and K.K. Thornber, "A Comparison of Measures for Detecting Natural Shapes in Cluttered Backgrounds," Int'l J. Computer Vision, vol. 34, no. 2/3, pp. 81-96, 2000.
64. G. Winkler, Image Analysis, Random Fields and Dynamic Monte Carlo Methods, Applications of Math., vol. 27, Heidelberg: Springer, 1995.
65. Handbook of Semidefinite Programming, H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds. Boston: Kluwer Academic, 2000.
66. S.J. Wright, Primal-Dual Interior-Point Methods. SIAM 1996.
67. C.-H. Wu and P.C. Doerschuk, "Cluster Expansions for the Deterministic Computation of Bayesian Estimators Based on Markov Random Fields," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 3, pp. 275-293, Mar. 1995.
68. Y.N. Wu, S.C. Zhu, and X. Liu, "Equivalence of Julesz Ensembles and FRAME Models," Int'l J. Computer Vision, vol. 38, no. 3, pp. 247-265, 2000.
69. Y. Ye, Interior Point Algorithms: Theory and Analysis. Wiley, 1997.
70. Y. Ye, "A .699-Approximation Algorithm for Max-Bisection," Math. Programming, vol. 90, pp. 101-111, 2001.
71. S.C. Zhu and D. Mumford, "Prior Learning and Gibbs Reaction-Diffusion," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 11, pp. 1236-1250, Nov. 1997.