{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:42:53Z","timestamp":1665780173331},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T00:00:00Z","timestamp":1618012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T00:00:00Z","timestamp":1618012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00730-4","type":"journal-article","created":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T15:03:32Z","timestamp":1618067012000},"page":"2324-2346","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Regularized graph cuts based discrete tomography reconstruction methods"],"prefix":"10.1007","volume":"44","author":[{"given":"Marina","family":"Mar\u010deta","sequence":"first","affiliation":[]},{"given":"Tibor","family":"Luki\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,10]]},"reference":[{"key":"730_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM (1988) Two point step size gradient methods. IMA J Num Anal 8:141\u2013148","journal-title":"IMA J Num Anal"},{"key":"730_CR2","doi-asserted-by":"crossref","unstructured":"Batenburg KJ, Sijbers J (2007) DART: A Fast heuristic algebraic reconstruction algorithm for discrete tomography. In Proceedings of International conference on image processing (ICIP), pages 133\u2013136","DOI":"10.1109\/ICIP.2007.4379972"},{"key":"730_CR3","doi-asserted-by":"crossref","unstructured":"Birchfield S, Tomasi C (1999) Multiway cut for stereo and motion with slanted surfaces. Proc. International Conf. Computer Vision, pages 489\u2013495","DOI":"10.1109\/ICCV.1999.791261"},{"key":"730_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"E Birgin","year":"2001","unstructured":"Birgin E, Mart\u00ednez J (2001) Spectral conjugate gradient method for unconstrained optimization. Appl Math Optim 43:117\u2013128","journal-title":"Appl Math Optim"},{"key":"730_CR5","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"E Birgin","year":"2000","unstructured":"Birgin E, Mart\u00ednez J, Raydan M (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim 10:1196\u20131211","journal-title":"SIAM J Optim"},{"key":"730_CR6","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"EG Birgin","year":"2001","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2001) Algorithm: 813: SPG - software for convex-constrained optimization. ACM Trans Math Softw 27:340\u2013349","journal-title":"ACM Trans Math Softw"},{"key":"730_CR7","doi-asserted-by":"crossref","unstructured":"Boykov Y, Jolly MP (2001) Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In Proc. International Conf. Computer Vision, pages 105\u2013112","DOI":"10.1109\/ICCV.2001.937505"},{"key":"730_CR8","doi-asserted-by":"crossref","unstructured":"Boykov Y, Kolmogorov V (2003) Computing geodesics and minimal surfaces via graph cuts. In Proc. International Conf. Computer Vision, pages 26\u201333","DOI":"10.1109\/ICCV.2003.1238310"},{"issue":"9","key":"730_CR9","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y Boykov","year":"2004","unstructured":"Boykov Y, Kolmogorov V (2004) An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Trans. PAMI 26(9):1124\u20131137","journal-title":"IEEE Trans. PAMI"},{"key":"730_CR10","doi-asserted-by":"crossref","unstructured":"Boykov Y, Veksler O, Zabih R (1998) Markov random fields with efficient approximations. In Proceedings of IEEE Conf. Computer Vision and Pattern Recognition, pages 648\u2013655","DOI":"10.1109\/CVPR.1998.698673"},{"issue":"11","key":"730_CR11","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov Y, Veksler O, Zabih R (2001) Fast approximate energy minimization via graph cuts. IEEE Trans PAMI 23(11):1222\u20131239","journal-title":"IEEE Trans PAMI"},{"key":"730_CR12","doi-asserted-by":"crossref","unstructured":"Delong A, Osokin A, Isack H. N, Boykov Y (2010) Fast approximate energy minimization with label costs. Proc. IEEE Conf. computer vision and pattern recognition 96(1):1\u201327","DOI":"10.1007\/s11263-011-0437-z"},{"key":"730_CR13","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo L, Lampariello F, Lucidi S (1986) A nonmonotone line search technique for Newton\u2019s method. SIAM J Numer Anal 23:707\u2013716","journal-title":"SIAM J Numer Anal"},{"key":"730_CR14","doi-asserted-by":"crossref","unstructured":"Herman GT, Kuba A (1999) Discrete tomography: foundations, algorithms and applications. Birkh\u00e4user","DOI":"10.1007\/978-1-4612-1568-4"},{"key":"730_CR15","doi-asserted-by":"crossref","unstructured":"Herman GT, Kuba A (2006) Advances in discrete tomography and its applications. Birkh\u00e4user","DOI":"10.1007\/978-0-8176-4543-4"},{"key":"730_CR16","doi-asserted-by":"crossref","unstructured":"Kim J, Zabih R (2003) Automatic segmentation of contrast- enhanced image sequences. In Proc. International Conf. Computer Vision, pages 502\u2013509","DOI":"10.1109\/ICCV.2003.1238389"},{"key":"730_CR17","doi-asserted-by":"crossref","unstructured":"Kolmogorov V, Zabih R (2001) Visual correspondence with occlusions using graph cuts. In Proc. International Conf. Computer Vision, pages 508\u2013515","DOI":"10.1109\/ICCV.2001.937668"},{"issue":"2","key":"730_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov V, Zabih R (2004) What energy functions can be minimized via graph cuts? IEEE Trans PAMI 26(2):147\u2013159","journal-title":"IEEE Trans PAMI"},{"key":"730_CR19","doi-asserted-by":"crossref","unstructured":"Kwatra V, Schoedl A, Essa I, Turk G, Bobick A (2003) Graphcut textures: image and video synthesis using graph cuts. In Proc. SIGGRAPH 2003, pages 277\u2013286. ACM Trans. Graphics","DOI":"10.1145\/882262.882264"},{"key":"730_CR20","doi-asserted-by":"crossref","unstructured":"Luki\u0107 T (2011) Discrete tomography reconstruction based on the multi-well potential. In Proceedings of combinatorial image analysis - 14th international workshop (IWCIA), volume 6636 of LNCS, pages 335\u2013345, Madrid, Spain. Springer-Verlag","DOI":"10.1007\/978-3-642-21073-0_30"},{"key":"730_CR21","doi-asserted-by":"publisher","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 (2016) Binary tomography reconstruction based on shape orientation. Pattern Recognit Lett 79:18\u201324","journal-title":"Pattern Recognit Lett"},{"issue":"10","key":"730_CR22","doi-asserted-by":"publisher","first-page":"105211","DOI":"10.1088\/1402-4896\/abb633","volume":"95","author":"T Luki\u0107","year":"2020","unstructured":"Luki\u0107 T, Bal\u00e1zs P (2020) Shape circularity assisted tomography reconstruction. Physica Scripta 95(10):105211","journal-title":"Physica Scripta"},{"key":"730_CR23","doi-asserted-by":"crossref","unstructured":"Luki\u0107 T, Mar\u010deta M (2017) Gradient and graph cuts based method for multi-level discrete tomography. In Proceedings of combinatorial image analysis - 18th International workshop (IWCIA), LNCS, pages 322\u2013333, Plovdiv, Bulgaria, Springer-Verlag","DOI":"10.1007\/978-3-319-59108-7_25"},{"key":"730_CR24","doi-asserted-by":"publisher","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 (2014) Deterministic discrete tomography reconstruction method for images on triangular grid. Pattern Recognit Lett 49:11\u201316","journal-title":"Pattern Recognit Lett"},{"key":"730_CR25","doi-asserted-by":"publisher","unstructured":"Mar\u010deta M, Luki\u0107 T (2020) Graph cuts based tomography enhanced by shape orientation. In T.\u00a0Lukic, R.\u00a0P. Barneva, V.\u00a0E. Brimkov, L.\u00a0Comic, and N.\u00a0Sladoje, editors, Combinatorial image analysis - 20th International workshop, IWCIA 2020, Novi Sad, Serbia, July 16-18, 2020, Proceedings, volume 12148 of lecture notes in computer science, pages 219\u2013235. Springer. https:\/\/doi.org\/10.1007\/978-3-030-51002-2_16","DOI":"10.1007\/978-3-030-51002-2_16"},{"key":"730_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.3233\/FI-2016-1350","volume":"145","author":"B Nagy","year":"2016","unstructured":"Nagy B, Luki\u0107 T (2016) Dense projection tomography on the triangular tiling. Fundamenta Informaticae 145:125\u2013141","journal-title":"Fundamenta Informaticae"},{"key":"730_CR27","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan M (1997) The Barzilai and Browein gradient method for the large scale unconstrained minimization problem. SIAM J Optim 7:26\u201333","journal-title":"SIAM J Optim"},{"key":"730_CR28","doi-asserted-by":"publisher","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 (2005) Discrete tomography by convex-concave regularization and D.C. programming. Discrete Appl Math 151:229\u2013243","journal-title":"Discrete Appl Math"},{"key":"730_CR29","unstructured":"Sonka M, Hlavac V, Boyle R (2007) Image processing, analysis, and machine vision. Thomosn-Engineering"},{"key":"730_CR30","doi-asserted-by":"publisher","first-page":"3478","DOI":"10.1109\/TIP.2006.877527","volume":"15","author":"J \u017duni\u0107","year":"2006","unstructured":"\u017duni\u0107 J, Rosin PL, Kopanja L (2006) On the orientability of shapes. IEEE Trans Image Process 15:3478\u20133487","journal-title":"IEEE Trans Image Process"},{"key":"730_CR31","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.patcog.2009.06.017","volume":"43","author":"J \u017duni\u0107","year":"2010","unstructured":"\u017duni\u0107 J, Hirota K, Rosin PL (2010) A hu invariant as a shape circularity measure. Pattern Recognit 43:47\u201357","journal-title":"Pattern Recognit"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00730-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00730-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00730-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:17:35Z","timestamp":1665778655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00730-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,10]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["730"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00730-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,10]]},"assertion":[{"value":"31 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The research is not financially supported.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"The Matlab code used in this paper is available on request per email from the corresponding author.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}