{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T16:35:00Z","timestamp":1770050100764,"version":"3.49.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"DEFI"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/lsp.2017.2752261","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T18:10:48Z","timestamp":1505412648000},"page":"1827-1831","source":"Crossref","is-referenced-by-count":18,"title":["Proximity Operator of a Sum of Functions; Application to Depth Map Estimation"],"prefix":"10.1109","volume":"24","author":[{"given":"Nelly","family":"Pustelnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Condat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2003.1211354"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24033\/bsmf.1625"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/080727749"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-010-0147-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-016-0696-y"},{"key":"ref14","first-page":"91","article-title":"On decomposing the proximal map","author":"yu","year":"0","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref15","article-title":"A primer on coordinate descent algorithms","author":"shi","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/060669498"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/996986501"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2278339"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/16M1075247"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2008.2011386"},{"key":"ref4","first-page":"273","article-title":"A parallel inertial proximal optimization method","volume":"8","author":"pesquet","year":"2012","journal-title":"Pacific J Optim"},{"key":"ref27","article-title":"A convex approach to K-means clustering and image segmentation","author":"condat","year":"2017","journal-title":"Proc Intern Conf on Energy Minimization Methods in Computer Vision and Pattern Recognition"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41589-5_10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-011-0191-y"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-012-0361-z"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","article-title":"A splitting algorithm for dual monotone inclusions involving cocoercive operators","volume":"38","author":"v?","year":"2013","journal-title":"Adv Comput Math"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0245-9"},{"key":"ref2","first-page":"185","article-title":"Proximal splitting methods in signal processing","author":"combettes","year":"2010","journal-title":"Fixed-Point Algorithms For Inverse Problems in Science and Engineering"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2377273"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"ref20","article-title":"A parametric maximum flow approach for discrete total variation regularization","author":"chambolle","year":"2012","journal-title":"Image Processing and Analysis With Graphs Theory and Practice"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00490.x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01449044"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728423"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/110856733"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-319-14612-6_14","article-title":"A fast projection method for connectivity constraints in image segmentation","volume":"8932","author":"cremers","year":"2015","journal-title":"Proc 10th Int Conf Energy Minimization Methods Comput Vis Pattern Recognit"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/8069041\/08037997.pdf?arnumber=8037997","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T17:02:35Z","timestamp":1642006955000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8037997\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":30,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2017.2752261","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}