{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:23:15Z","timestamp":1737091395348,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540687825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68783-2_14","type":"book-chapter","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T13:14:17Z","timestamp":1181308457000},"page":"475-496","source":"Crossref","is-referenced-by-count":1,"title":["An Integer Programming Approach to Image Segmentation and Reconstruction Problems"],"prefix":"10.1007","author":[{"given":"Geir","family":"Dahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Truls","family":"Flatberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"R.K. Ahuja, T.L. Magnati, and J.B. Orlin. Network flows: theory, algorithms, and applications. Prentice-Hall, 1993.","key":"14_CR1"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(94)00293-2","volume":"155","author":"E. Barcucci","year":"1996","unstructured":"E. Barcucci, A. Del Lungo, M. Nivat, and R. Pinzani. Reconstructing convex polyominoes from horizontal and vertical projections. Theoret. Comput. Sci., 155:321\u2013347, 1996.","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"14_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","volume":"48","author":"J. Besag","year":"1986","unstructured":"J. Besag. On the statistical analysis of dirty pictures. J. R. Stat. Soc. Ser. B Stat. Methodol., 48(3):259\u2013302, 1986.","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"issue":"3","key":"14_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1080\/02664768900000049","volume":"16","author":"J. Besag","year":"1989","unstructured":"J. Besag. Towards Bayesian image analysis. J. Appl. Stat., 16(3):395\u2013407, 1989.","journal-title":"J. Appl. Stat."},{"issue":"11","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell., 23(11):1222\u20131239, 2001.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"T.G. Crainic","year":"2001","unstructured":"T.G. Crainic, A. Frangioni, and B. Gendron. Bundle-base relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math., 112:73\u201399, 2001.","journal-title":"Discrete Appl. Math."},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1090\/dimacs\/005\/07","volume":"5","author":"W. Cunningham","year":"1991","unstructured":"W. Cunningham. The optimal multiterminal cut problem. DIMACS Ser. Discrete Math. Theor. Comput. Sci., 5:105\u2013120, 1991.","journal-title":"DIMACS Ser. Discrete Math. Theor. Comput. Sci."},{"unstructured":"G. Dahl and T. Flatberg. Reconstructing (0,1)-matrices from projections using integer programming. Working paper.","key":"14_CR8"},{"issue":"1\u20133","key":"14_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.dam.2005.02.023","volume":"151","author":"G. Dahl","year":"2005","unstructured":"G. Dahl and T. Flatberg. Optimization and reconstruction of hv-convex (0, 1)-matrices. Discrete Appl. Math., 151(1\u20133):93\u2013105, 2005.","journal-title":"Discrete Appl. Math."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM J. Comput., 23:864\u2013894, 1994.","journal-title":"SIAM J. Comput."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(96)00083-2","volume":"75","author":"P. Fishburn","year":"1997","unstructured":"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\u201361, 1997.","journal-title":"Discrete Appl. Math."},{"issue":"61","key":"14_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/PROC.1973.9030","volume":"3","author":"G.D. Forney","year":"1973","unstructured":"G.D. Forney. The Viterbi algorithm. Proc. of the IEEE, 3(61):268\u2013278, 1973.","journal-title":"Proc. of the IEEE"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1287\/opre.50.3.490.7741","volume":"50","author":"G. Storvik","year":"2002","unstructured":"G. Storvik G. Dahl and A. Fadnes. Large-scale integer programs in image analysis. Operations Research, 50(3):490\u2013500, 2002.","journal-title":"Operations Research"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D. Gale","year":"1957","unstructured":"D. Gale. A theorem on flows in networks. Pacific J. Math., 7:1073\u20131082, 1957.","journal-title":"Pacific J. Math."},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"S. Geman and D. Geman. Stochastic relaxation, Gibbs distribution, and Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell., 6(6):721\u2013741, 1984.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"14_CR16","first-page":"522","volume":"11","author":"P. Gritzmann","year":"2000","unstructured":"P. Gritzmann, S. de Vries, and M. Wiegelmann. Approximating binary images from discrete x-rays. SIAM J. Comput., 11(2):522\u2013546, 2000.","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"G.T. Herman and A. Kuba, editors. Discrete Tomography: Foundations, Algorithms and Applications. Birkh\u00e4user, 1999.","key":"14_CR17","DOI":"10.1007\/978-1-4612-1568-4"},{"unstructured":"ILOG CPLEX. http:\/\/www.ilog.com\/products\/cplex.","key":"14_CR18"},{"unstructured":"A.W. Marshall and I. Olkin. Inequalities: Theory of Majorization and Its Applications. Academic Press, 1979.","key":"14_CR19"},{"doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.","key":"14_CR20","DOI":"10.1002\/9781118627372"},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"H.J. Ryser","year":"1957","unstructured":"H.J. Ryser. Combinatorial properties of matrices of zeros and ones. Canad. J. Math., 9:371\u2013377, 1957.","journal-title":"Canad. J. Math."},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/83.826783","volume":"9","author":"G. Storvik","year":"2000","unstructured":"G. Storvik and G. Dahl. Lagrangian-based methods for finding MAP solutions for MRF models. IEEE Trans. Image Process., 9(3):469\u2013479, 2000.","journal-title":"IEEE Trans. Image Process."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0020-0190(00)00162-9","volume":"77","author":"G.J. Woeginger","year":"2001","unstructured":"G.J. Woeginger. The reconstruction of polyominoes from their orthogonal projections. Inform. Process. Lett., 77:225\u2013229, 2001.","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"14_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1155\/S1110757X02110035","volume":"2","author":"B.A. Zalesky","year":"2002","unstructured":"B.A. Zalesky. Network flow optimization for restoration of images. J. Appl. Math., 2(4):199\u2013218, 2002.","journal-title":"J. Appl. Math."}],"container-title":["Geometric Modelling, Numerical Simulation, and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68783-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T02:27:30Z","timestamp":1737080850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68783-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540687825"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68783-2_14","relation":{},"subject":[]}}