{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:59Z","timestamp":1750308239696,"version":"3.41.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591070"},{"type":"electronic","value":"9783319591087"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59108-7_25","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T08:43:06Z","timestamp":1494924186000},"page":"322-333","source":"Crossref","is-referenced-by-count":2,"title":["Gradient and Graph Cuts Based Method for Multi-level Discrete Tomography"],"prefix":"10.1007","author":[{"given":"Tibor","family":"Luki\u0107","sequence":"first","affiliation":[]},{"given":"Marina","family":"Mar\u010deta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two point step size gradient methods. IMA J. Num. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Num. Anal."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Batenburg, K.J., Sijbers, J.: DART: a fast heuristic algebraic reconstruction algorithm for discrete tomography. In: Proceedings of International Conference on Image Processing (ICIP), pp. 133\u2013136 (2007)","DOI":"10.1109\/ICIP.2007.4379972"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Birchfield, S., Tomasi, C.: Multiway cut for stereo and motion with slanted surfaces. In: Proceedings of International Conference on Computer Vision, pp. 489\u2013495 (1999)","DOI":"10.1109\/ICCV.1999.791261"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"EG Birgin","year":"2001","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Algorithm: 813: SPG - software for convex-constrained optimization. ACM Trans. Math. Softw. 27, 340\u2013349 (2001)","journal-title":"ACM Trans. Math. Softw."},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"E Birgin","year":"2001","unstructured":"Birgin, E., Mart\u00ednez, J.: Spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43, 117\u2013128 (2001)","journal-title":"Appl. Math. Optim."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: Proceedings of International Conference on Computer Vision, pp. 105\u2013112 (2001)","DOI":"10.1109\/ICCV.2001.937505"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: Proceedings of International Conference on Computer Vision, pp. 26\u201333 (2003)","DOI":"10.1109\/ICCV.2003.1238310"},{"issue":"9","key":"25_CR8","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Trans. PAMI 26(9), 1124\u20131137 (2004)","journal-title":"IEEE Trans. PAMI"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 648\u2013655 (1998)","DOI":"10.1109\/CVPR.1998.698673"},{"issue":"11","key":"25_CR10","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. PAMI 23(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. PAMI"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast approximate energy minimization with label costs. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition vol. 96, no. 1, pp. 1\u201327 (2010)","DOI":"10.1109\/CVPR.2010.5539897"},{"issue":"2","key":"25_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"D Greig","year":"1989","unstructured":"Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. J. R. Stat. Soc. 51(2), 271\u2013279 (1989)","journal-title":"J. R. Stat. Soc."},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"25_CR14","series-title":"Advances in Computer Vision and Pattern Recognition","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-723-7","volume-title":"Fundamentals of Computerized Tomography: Image Reconstruction from Projection","author":"GT Herman","year":"2009","unstructured":"Herman, G.T.: Fundamentals of Computerized Tomography: Image Reconstruction from Projection. Advances in Computer Vision and Pattern Recognition, 2nd edn. Springer, London (2009)","edition":"2"},{"key":"25_CR15","series-title":"Applied and Numerical Harmonic Analysis","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1568-4","volume-title":"Discrete Tomography: Foundations, Algorithms and Applications","author":"GT Herman","year":"1999","unstructured":"Herman, G.T., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Applied and Numerical Harmonic Analysis. Birkh\u00e4user, Boston (1999)"},{"key":"25_CR16","volume-title":"Advances in Discrete Tomography and Its Applications","author":"GT Herman","year":"2006","unstructured":"Herman, G.T., Kuba, A.: Advances in Discrete Tomography and Its Applications. Birkh\u00e4user, Boston (2006)"},{"key":"25_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719277","volume-title":"Principles of Computerized Tomographic Imaging","author":"AC Kak","year":"2001","unstructured":"Kak, A.C., Slaney, M.: Principles of Computerized Tomographic Imaging. SIAM, Philadelphia (2001)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Kim, J., Zabih, R.: Automatic segmentation of contrast-enhanced image sequences. In: Proceedings of International Conference on Computer Vision, pp. 502\u2013509 (2003)","DOI":"10.1109\/ICCV.2003.1238389"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Visual correspondence with occlusions using graph cuts. In: Proceedings of International Conference on Computer Vision, pp. 508\u2013515 (2001)","DOI":"10.1109\/ICCV.2001.937668"},{"issue":"2","key":"25_CR20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. PAMI 26(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. PAMI"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Kwatra, V., Schoedl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: image and video synthesis using graph cuts. In: Proceedings of SIGGRAPH 2003, pp. 277\u2013286 (2003). ACM Trans. Graphics","DOI":"10.1145\/1201775.882264"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-21073-0_30","volume-title":"Combinatorial Image Analysis","author":"T Luki\u0107","year":"2011","unstructured":"Luki\u0107, T.: Discrete tomography reconstruction based on the multi-well potential. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 335\u2013345. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21073-0_30"},{"key":"25_CR23","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.patrec.2016.04.010","volume":"79","author":"T Luki\u0107","year":"2016","unstructured":"Luki\u0107, T., Bal\u00e1zs, P.: Binary tomography reconstruction based on shape orientation. Pattern Recognit. Lett. 79, 18\u201324 (2016)","journal-title":"Pattern Recognit. Lett."},{"key":"25_CR24","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.patrec.2014.05.014","volume":"49","author":"T Luki\u0107","year":"2014","unstructured":"Luki\u0107, T., Nagy, B.: Deterministic discrete tomography reconstruction method for images on triangular grid. Pattern Recognit. Lett. 49, 11\u201316 (2014)","journal-title":"Pattern Recognit. Lett."},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-45886-1_21","volume-title":"Pattern Recognition","author":"M Zisler","year":"2016","unstructured":"Zisler, M., Petra, S., Schn\u00f6rr, C., Schn\u00f6rr, C.: Discrete tomography by continuous multilabeling subject to projection constraints. In: Rosenhahn, B., Andres, B. (eds.) GCPR 2016. LNCS, vol. 9796, pp. 261\u2013272. Springer, Cham (2016). doi: 10.1007\/978-3-319-45886-1_21"},{"key":"25_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/FI-2016-1350","volume":"145","author":"B Nagy","year":"2016","unstructured":"Nagy, B., Luki\u0107, T.: Dense projection tomography on the triangular tiling. Fundamenta Informaticae 145, 125\u2013141 (2016)","journal-title":"Fundamenta Informaticae"},{"key":"25_CR27","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Browein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"25_CR28","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.dam.2005.02.028","volume":"151","author":"T Sch\u00fcle","year":"2005","unstructured":"Sch\u00fcle, T., Schn\u00f6rr, C., Weber, S., Hornegger, J.: Discrete tomography by convex-concave regularization and D.C. programming. Discrete Appl. Math. 151, 229\u2013243 (2005)","journal-title":"Discrete Appl. Math."},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Snow, D., Viola, P., Zabih, R.: Exact voxel occupacy with graph cuts. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 345\u2013352 (2000)","DOI":"10.1109\/CVPR.2000.855839"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Varga, L., Bal\u00e1zs, P., Nagy, A.: An energy minimization reconstruction algorithm for multivalued discrete tomography. In: Proceedings of 3rd International Symposium on Computational Modeling of Objects Represented in Images, pp. 179\u2013185. Taylor & Francis, Rome (2012)","DOI":"10.1201\/b12753-33"},{"key":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11907350_13","volume-title":"Discrete Geometry for Computer Imagery","author":"S Weber","year":"2006","unstructured":"Weber, S., Nagy, A., Sch\u00fcle, T., Schn\u00f6rr, C., Kuba, A.: A benchmark evaluation of large-scale optimization approaches to binary tomography. In: Kuba, A., Ny\u00fal, L.G., Pal\u00e1gyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 146\u2013156. Springer, Heidelberg (2006). doi: 10.1007\/11907350_13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59108-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:41:15Z","timestamp":1750264875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59108-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591070","9783319591087"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59108-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}