{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T23:04:44Z","timestamp":1751929484546},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T00:00:00Z","timestamp":1674518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T00:00:00Z","timestamp":1674518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SIViP"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11760-023-02483-5","type":"journal-article","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T16:49:26Z","timestamp":1674578966000},"page":"2671-2678","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Global suppression heuristic: fast GraphCut in GPU for image stitching"],"prefix":"10.1007","volume":"17","author":[{"given":"Minh","family":"Bui","sequence":"first","affiliation":[]},{"given":"Tai","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Huong","family":"Ninh","sequence":"additional","affiliation":[]},{"given":"Tu","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Tien Hai","family":"Tran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,24]]},"reference":[{"issue":"2","key":"2483_CR1","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.: What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2483_CR2","volume-title":"ACM SIGGRAPH 2005 papers on\u2014SIGGRAPH \u201905","author":"Y Li","year":"2005","unstructured":"Li, Y., Sun, J., Shum, H.Y.: ACM SIGGRAPH 2005 papers on\u2014SIGGRAPH \u201905. ACM Press (2005)"},{"issue":"9","key":"2483_CR3","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.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9), 1124\u20131137 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"2483_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/882262.882264","volume":"22","author":"V Kwatra","year":"2003","unstructured":"Kwatra, V., Sch\u00f6dl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: image and video synthesis using graph cuts. ACM Trans. Graph. 22(3), 277\u2013286 (2003)","journal-title":"ACM Trans. Graph."},{"key":"2483_CR5","unstructured":"Kolmogorov, V., Zabih, R.: In: Proceedings Eighth IEEE International Conference on Computer Vision. ICCV (2001)"},{"key":"2483_CR6","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184","volume-title":"Flows in Networks","author":"LR Ford","year":"1963","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1963)"},{"issue":"2","key":"2483_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"2483_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-02158-9","volume-title":"Algorithmic Aspects in Information and Management","author":"AV Goldberg","year":"2009","unstructured":"Goldberg, A.V.: Algorithmic Aspects in Information and Management, pp. 212\u2013225. Springer, Berlin Heidelberg (2009)"},{"key":"2483_CR9","doi-asserted-by":"crossref","unstructured":"Vineet, V., Narayanan, P.J.: In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPRW.2008.4563095"},{"key":"2483_CR10","unstructured":"Hussein, M., Varshney, A., Davis, L.: On implementing graph cuts on cuda"},{"key":"2483_CR11","unstructured":"Dixit, N., Keriven, R., Paragios, N.: Gpu-cuts: Combinatorial optimisation, graphic processing units and adaptive object extraction (2005)"},{"issue":"4","key":"2483_CR12","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"2483_CR13","doi-asserted-by":"crossref","unstructured":"Shekhovtsov, A., Hlav\u00e1c, V.: A distributed mincut\/maxflow algorithm combining path augmentation and push-relabel. CoRR arXiv:abs\/1109.1146 (2011)","DOI":"10.1007\/978-3-642-23094-3_1"},{"key":"2483_CR14","first-page":"1277","volume":"11","author":"EA Dinic","year":"1970","unstructured":"Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Sov. Math. Doklady 11, 1277\u20131280 (1970)","journal-title":"Sov. Math. Doklady"},{"issue":"12","key":"2483_CR15","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1109\/TPAMI.2007.1128","volume":"29","author":"P Kohli","year":"2007","unstructured":"Kohli, P., Torr, P.: Dynamic graph cuts for efficient inference in Markov random fields. IEEE Trans. Pattern Anal. Mach. Intell. 29(12), 2079\u20132088 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2483_CR16","unstructured":"Liu, J., Sun, J.: In: 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE (2010)"},{"issue":"4","key":"2483_CR17","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"BV Cherkassky","year":"1997","unstructured":"Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4), 390\u2013410 (1997)","journal-title":"Algorithmica"},{"key":"2483_CR18","unstructured":"Anderson, R.J., Setubal, J.C.: In: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures\u2014SPAA \u201992. ACM Press (1992)"},{"key":"2483_CR19","unstructured":"Bader, D., Sachdeva, V.: A cache-aware parallel implementation of the push-relabel network flow algorithm and experimental evaluation of the gap relabeling heuristic. ISCA PDCS (2005)"},{"key":"2483_CR20","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Third Edition, MIT Press (2009)"}],"container-title":["Signal, Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-023-02483-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11760-023-02483-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-023-02483-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T23:43:52Z","timestamp":1728776632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11760-023-02483-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,24]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["2483"],"URL":"https:\/\/doi.org\/10.1007\/s11760-023-02483-5","relation":{},"ISSN":["1863-1703","1863-1711"],"issn-type":[{"type":"print","value":"1863-1703"},{"type":"electronic","value":"1863-1711"}],"subject":[],"published":{"date-parts":[[2023,1,24]]},"assertion":[{"value":"13 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2023","order":4,"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 they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}