{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T07:36:29Z","timestamp":1773473789743,"version":"3.50.1"},"reference-count":63,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2016,7,11]]},"abstract":"<jats:p>Computational photography systems are becoming increasingly diverse, while computational resources---for example on mobile platforms---are rapidly increasing. As diverse as these camera systems may be, slightly different variants of the underlying image processing tasks, such as demosaicking, deconvolution, denoising, inpainting, image fusion, and alignment, are shared between all of these systems. Formal optimization methods have recently been demonstrated to achieve state-of-the-art quality for many of these applications. Unfortunately, different combinations of natural image priors and optimization algorithms may be optimal for different problems, and implementing and testing each combination is currently a time-consuming and error-prone process. ProxImaL is a domain-specific language and compiler for image optimization problems that makes it easy to experiment with different problem formulations and algorithm choices. The language uses proximal operators as the fundamental building blocks of a variety of linear and nonlinear image formation models and cost functions, advanced image priors, and noise models. The compiler intelligently chooses the best way to translate a problem formulation and choice of optimization algorithm into an efficient solver implementation. In applications to the image processing pipeline, deconvolution in the presence of Poisson-distributed shot noise, and burst denoising, we show that a few lines of ProxImaL code can generate highly efficient solvers that achieve state-of-the-art results. We also show applications to the nonlinear and nonconvex problem of phase retrieval.<\/jats:p>","DOI":"10.1145\/2897824.2925875","type":"journal-article","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T16:04:33Z","timestamp":1468253073000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["ProxImaL"],"prefix":"10.1145","volume":"35","author":[{"given":"Felix","family":"Heide","sequence":"first","affiliation":[{"name":"Stanford University and University of British Columbia"}]},{"given":"Steven","family":"Diamond","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Matthias","family":"Nie\u00dfner","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Jonathan","family":"Ragan-Kelley","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Wolfgang","family":"Heidrich","sequence":"additional","affiliation":[{"name":"KAUST and University of British Columbia"}]},{"given":"Gordon","family":"Wetzstein","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Proc. ICIP, 582--585","author":"Almeida M."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0029-5"},{"key":"e_1_2_2_5_1","volume-title":"Ebb: A DSL for physical simluation on CPUs and GPUs. arXiv e-Print 1506.07577.","author":"Bernstein G. L.","year":"2015"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344972"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_2_2_8_1","volume-title":"GAMS: A user's guide. Course Technology.","author":"Brooke A.","year":"1988"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1975-13874-2"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2176954"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258884"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.84"},{"key":"e_1_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Diamond S. and Boyd S. 2016. Matrix-free convex optimization modeling. In Optimization and Applications in Control and Data Sciences. Springer. To appear.  Diamond S. and Boyd S. 2016. Matrix-free convex optimization modeling. In Optimization and Applications in Control and Data Sciences. Springer. To appear.","DOI":"10.1007\/978-3-319-42056-1_7"},{"key":"e_1_2_2_15_1","article-title":"CVXPY: A Python-embedded modeling language for convex optimization","author":"Diamond S.","year":"2016","journal-title":"Journal of Machine Learning Research. To appear."},{"key":"e_1_2_2_16_1","volume-title":"-L","author":"Dupe F.-X.","year":"2011"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/09076934X"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.113"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566573"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141956"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1364\/AO.21.002758"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2053941"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1965002"},{"key":"e_1_2_2_24_1","unstructured":"Fougner C. and Boyd S. 2015. Parameter selection and preconditioning for a graph form solver. arXiv e-Print 1503.08366.  Fougner C. and Boyd S. 2015. Parameter selection and preconditioning for a graph form solver. arXiv e-Print 1503.08366."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/83.392335"},{"key":"e_1_2_2_26_1","volume-title":"Proceedings of the 53rd IEEE Conference on Decision and Control.","author":"Giselsson P."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725891"},{"key":"e_1_2_2_28_1","volume-title":"CVX: MATLAB software for disciplined convex programming, version 2.1","author":"Grant M.","year":"2014"},{"key":"e_1_2_2_29_1","volume-title":"Proc. IEEE ICCP.","author":"Gu J."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783313"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2516971.2516974"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661229.2661260"},{"key":"e_1_2_2_33_1","first-page":"409","article-title":"Methods of conjugate gradients for solving linear systems","author":"Hestenes M.","year":"1952","journal-title":"J. Res. N.B."},{"key":"e_1_2_2_34_1","volume-title":"Proc. IEEE CVPR, 1550--1557","author":"Joshi N."},{"key":"e_1_2_2_35_1","unstructured":"Krishnan D. and Fergus R. 2009. Fast image deconvolution using hyper-Laplacian priors. In Advances in Neural Information Processing Systems 1033--1041.  Krishnan D. and Fergus R. 2009. Fast image deconvolution using hyper-Laplacian priors. In Advances in Neural Information Processing Systems 1033--1041."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024211"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/120882706"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895281484"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015780"},{"key":"e_1_2_2_40_1","volume-title":"Proc. ECCV. 377--389","author":"Levin A."},{"key":"e_1_2_2_41_1","unstructured":"Li G. and Pong T. K. 2015. Global convergence of splitting methods for nonconvex composite optimization. arXiv e-Print 1407.0753.  Li G. and Pong T. K. 2015. Global convergence of splitting methods for nonconvex composite optimization. arXiv e-Print 1407.0753."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/140976601"},{"key":"e_1_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Moreau J.-J. 1965. Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bulletin de la Soci\u00e9t\u00e9 math\u00e9matique de France 93 273--299.  Moreau J.-J. 1965. Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bulletin de la Soci\u00e9t\u00e9 math\u00e9matique de France 93 273--299.","DOI":"10.24033\/bsmf.1625"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/130942954"},{"key":"e_1_2_2_46_1","unstructured":"O'Donoghue B. Chu E. Parikh N. and Boyd S. 2015. Operator splitting for conic optimization via homogeneous self-dual embedding. arXiv e-Print 1312.3039.  O'Donoghue B. Chu E. Parikh N. and Boyd S. 2015. Operator splitting for conic optimization via homogeneous self-dual embedding. arXiv e-Print 1312.3039."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/355984.355989"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126441"},{"key":"e_1_2_2_50_1","volume-title":"Proceedings of the IEEE International Conference on Computer Vision, 1133--1140","author":"Pock T."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462176"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/140987845"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.349"},{"key":"e_1_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Sidky E. Y. and Pan X. 2008. Image reconstruction in circular cone-beam computed tomography by constrained total-variation minimization. Physics in medicine and biology 53 17 4777.  Sidky E. Y. and Pan X. 2008. Image reconstruction in circular cone-beam computed tomography by constrained total-variation minimization. Physics in medicine and biology 53 17 4777.","DOI":"10.1088\/0031-9155\/53\/17\/021"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1364\/OPTICA.2.000104"},{"key":"e_1_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Tsai Y.-T. Steinberger M. Pajak D. and Pulli K. 2014. Fast ANN for high-quality collaborative filtering. In High Performance Graphics.  Tsai Y.-T. Steinberger M. Pajak D. and Pulli K. 2014. Fast ANN for high-quality collaborative filtering. In High Performance Graphics .","DOI":"10.1111\/cgf.12715"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPTCDL.2014.5"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461993"},{"key":"e_1_2_2_60_1","unstructured":"Wytock M. Wang P.-W. and Zico Kolter J. 2015. Convex programming with fast proximal and linear operators. arXiv e-Print 1511.04815.  Wytock M. Wang P.-W. and Zico Kolter J. 2015. Convex programming with fast proximal and linear operators. arXiv e-Print 1511.04815."},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1117\/1.3600632"},{"key":"e_1_2_2_62_1","article-title":"An augmented ADMM algorithm with application to the generalized lasso problem","author":"Zhu Y.","year":"2015","journal-title":"Journal of Computational and Graphical Statistics, just-accepted."},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126278"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897824.2925875","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897824.2925875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:38:46Z","timestamp":1750221526000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897824.2925875"}},"subtitle":["efficient image optimization using proximal algorithms"],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":63,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7,11]]}},"alternative-id":["10.1145\/2897824.2925875"],"URL":"https:\/\/doi.org\/10.1145\/2897824.2925875","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}