Abstract
This paper discusses segmentation and reconstruction problems using a integer linear programming approach. These problems have important applications in remote sensing, medical image analysis and industrial inspection. We focus on methods that produce optimal or near-optimal solutions for the corresponding optimization problems. We show that for the two problems one may use similar ideas in both modeling and solution methods. These methods are based on Lagrangian decomposition and dynamic programming for certain subproblems (associated with lines in the image). Some computational experiences are also reported.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.K. Ahuja, T.L. Magnati, and J.B. Orlin. Network flows: theory, algorithms, and applications. Prentice-Hall, 1993.
E. Barcucci, A. Del Lungo, M. Nivat, and R. Pinzani. Reconstructing convex polyominoes from horizontal and vertical projections. Theoret. Comput. Sci., 155:321–347, 1996.
J. Besag. On the statistical analysis of dirty pictures. J. R. Stat. Soc. Ser. B Stat. Methodol., 48(3):259–302, 1986.
J. Besag. Towards Bayesian image analysis. J. Appl. Stat., 16(3):395–407, 1989.
Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell., 23(11):1222–1239, 2001.
T.G. Crainic, A. Frangioni, and B. Gendron. Bundle-base relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math., 112:73–99, 2001.
W. Cunningham. The optimal multiterminal cut problem. DIMACS Ser. Discrete Math. Theor. Comput. Sci., 5:105–120, 1991.
G. Dahl and T. Flatberg. Reconstructing (0,1)-matrices from projections using integer programming. Working paper.
G. Dahl and T. Flatberg. Optimization and reconstruction of hv-convex (0, 1)-matrices. Discrete Appl. Math., 151(1–3):93–105, 2005.
E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM J. Comput., 23:864–894, 1994.
P. Fishburn, P. Schwander, L. Shepp, and R.J. Vanderbei. The discrete Radon transform and its approximate inversion via linear programming. Discrete Appl. Math., 75:39–61, 1997.
G.D. Forney. The Viterbi algorithm. Proc. of the IEEE, 3(61):268–278, 1973.
G. Storvik G. Dahl and A. Fadnes. Large-scale integer programs in image analysis. Operations Research, 50(3):490–500, 2002.
D. Gale. A theorem on flows in networks. Pacific J. Math., 7:1073–1082, 1957.
S. Geman and D. Geman. Stochastic relaxation, Gibbs distribution, and Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell., 6(6):721–741, 1984.
P. Gritzmann, S. de Vries, and M. Wiegelmann. Approximating binary images from discrete x-rays. SIAM J. Comput., 11(2):522–546, 2000.
G.T. Herman and A. Kuba, editors. Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, 1999.
ILOG CPLEX. http://www.ilog.com/products/cplex.
A.W. Marshall and I. Olkin. Inequalities: Theory of Majorization and Its Applications. Academic Press, 1979.
G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.
H.J. Ryser. Combinatorial properties of matrices of zeros and ones. Canad. J. Math., 9:371–377, 1957.
G. Storvik and G. Dahl. Lagrangian-based methods for finding MAP solutions for MRF models. IEEE Trans. Image Process., 9(3):469–479, 2000.
G.J. Woeginger. The reconstruction of polyominoes from their orthogonal projections. Inform. Process. Lett., 77:225–229, 2001.
B.A. Zalesky. Network flow optimization for restoration of images. J. Appl. Math., 2(4):199–218, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dahl, G., Flatberg, T. (2007). An Integer Programming Approach to Image Segmentation and Reconstruction Problems. In: Hasle, G., Lie, KA., Quak, E. (eds) Geometric Modelling, Numerical Simulation, and Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68783-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-68783-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68782-5
Online ISBN: 978-3-540-68783-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)