{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T05:29:08Z","timestamp":1730266148239,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/ijcnn.2018.8489405","type":"proceedings-article","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T22:25:09Z","timestamp":1539987909000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Online Max-flow Learning via Augmenting and De-augmenting Path"],"prefix":"10.1109","author":[{"given":"Shaoning","family":"Pang","sequence":"first","affiliation":[]},{"given":"Lei","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Bany","sequence":"additional","affiliation":[]},{"given":"Kazushi","family":"Ikeda","sequence":"additional","affiliation":[]},{"given":"Wangfei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Abdolhossein","family":"Sarrafzadeh","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Takahashi","sequence":"additional","affiliation":[]},{"given":"Daisuke","family":"Inoue","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.150"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2000.855839"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023607406540"},{"key":"ref13","first-page":"619","article-title":"Faster and more dynamic maximum flow by incremental breadth-first search","volume":"9294","author":"goldberg","year":"2015"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2010.5713166"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SAM.2014.6882338"},{"key":"ref6","first-page":"2516","article-title":"Shape prior regularized continuous max-flow approach to image segmentation","author":"duan","year":"2012","journal-title":"Pattern Recognition (ICPR) 2012 21st International Conference on"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2011.113011.100098"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937505"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSES.2012.6382217"},{"key":"ref2","first-page":"1905","article-title":"Research on method of traffic network bottleneck identification based on max-flow min-cut theorem","author":"shengwu","year":"2011","journal-title":"Transportation Mechanical and Electrical Engineering (TMEE) 2011 International Conference on"},{"journal-title":"Algorithm Design","year":"2005","author":"kleinberg","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980121"}],"event":{"name":"2018 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2018,7,8]]},"location":"Rio de Janeiro","end":{"date-parts":[[2018,7,13]]}},"container-title":["2018 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8465565\/8488986\/08489405.pdf?arnumber=8489405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T03:14:09Z","timestamp":1598238849000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8489405\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2018.8489405","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}