Segmenting planar superpixel adjacency graphs w.r.t. non-planar superpixel affinity graphs

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

Volumn 8081 LNCS, Issue , 2013, Pages 266-279

  Andres, Bjoern ^a   Yarkony, Julian ^b   Manjunath, B S ^b   Kirchhoff, Steffen ^a   Turetken, Engin ^c   Fowlkes, Charless C ^d   Pfister, Hanspeter ^a  

^a HARVARD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c EPFL   (Switzerland)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY GRAPHS; GRAPH PARTITIONING; LAGRANGIAN DECOMPOSITION; MULTICUTS; PLANARITY; RELAXED PROBLEM; SUPER PIXELS;

PATTERN RECOGNITION;

IMAGE SEGMENTATION;

EID: 84884930805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40395-8_20     Document Type: Conference Paper

References (17)

1. Andres, B.: https://github.com/bjoern-andres/graph
2. Andres, B., Kappes, J.H., Beier, T., Köthe, U., Hamprecht, F.A.: Probabilistic image segmentation with closedness constraints. In: ICCV (2011)
3. Andres, B., Kroeger, T., Briggman, K.L., Denk, W., Korogod, N., Knott, G., Koethe, U., Hamprecht, F.A.: Globally optimal closed-surface segmentation for connectomics. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part III. LNCS, vol. 7574, pp. 778-791. Springer, Heidelberg (2012)
4. Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: Contour detection and hierarchical image segmentation. TPAMI 33(5), 898-916 (2011)
5. Bachrach, Y., Kohli, P., Kolmogorov, V., Zadimoghaddam, M.: Optimal coalition structures in graph games. arXiv ePrint (2011)
6. Bagon, S., Galun, M.: Large scale correlation clustering optimization. arXiv ePrint, abs/1112.2903 (2011)
7. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56, 89-113 (2004)
8. Chopra, S., Rao, M.R.: The partition problem. Math. Program. 59, 87-115 (1993)
9. Kappes, J.H., Speth, M., Andres, B., Reinelt, G., Schnörr, C.: Globally optimal image partitioning by multicuts. In: Boykov, Y., Kahl, F., Lempitsky, V., Schmidt, F.R. (eds.) EMMCVPR 2011. LNCS, vol. 6819, pp. 31-44. Springer, Heidelberg (2011)
10. Kim, S., Nowozin, S., Kohli, P., Yoo, C.D.: Higher-order correlation clustering for image segmentation. In: NIPS (2011)
11. Kolmogorov, V.: Blossom V: a new implementation of a minimum cost perfect matching algorithm. Mathematical Programming Computation 1(1), 43-67 (2009)
12. Nowozin, S., Jegelka, S.: Solution stability in linear programming relaxations: graph partitioning and unsupervised learning. In: ICML, pp. 769-776 (2009)
13. Nowozin, S., Lampert, C.H.: Global interactions in random field models: A potential function ensuring connectedness. SIAM J. Img. Sci. 3(4), 1048-1074 (2010)
14. Shih, W.-K., Wu, S., Kuo, Y.S.: Unifying maximum cut and minimum cut of a planar graph. IEEE Trans. Comput. 39(5), 694-697 (1990)
15. Vitaladevuni, S.N.P., Basri, R.: Co-clustering of image segments using convex optimization applied to EM neuronal reconstruction. In: CVPR (2010)
16. Yarkony, J.: MAP inference in Planar Markov Random Fields with Applications to Computer Vision. PhD thesis, University of California, Irvine (2012)
17. Yarkony, J., Ihler, A., Fowlkes, C.C.: Fast planar correlation clustering for image segmentation. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part VI. LNCS, vol. 7577, pp. 568-581. Springer, Heidelberg (2012)