{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:08:11Z","timestamp":1770336491249,"version":"3.49.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T00:00:00Z","timestamp":1248652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF 03-0352203-2586704-4691605-4125907-01775"],"award-info":[{"award-number":["CCF 03-0352203-2586704-4691605-4125907-01775"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-09-1-0741"],"award-info":[{"award-number":["N00014-09-1-0741"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-07-1-0900"],"award-info":[{"award-number":["N00014-07-1-0900"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2009,7,27]]},"abstract":"<jats:p>\n            We describe a method for plausible interpolation of images, with a wide range of applications like temporal up-sampling for smooth playback of lower frame rate video, smooth view interpolation, and animation of still images. The method is based on the intuitive idea, that a given pixel in the interpolated frames traces out a\n            <jats:italic>path<\/jats:italic>\n            in the source images. Therefore, we simply move and copy pixel gradients from the input images along this path. A key innovation is to allow arbitrary (asymmetric)\n            <jats:italic>transition points<\/jats:italic>\n            , where the path moves from one image to the other. This flexible transition preserves the frequency content of the originals without ghosting or blurring, and maintains temporal coherence. Perhaps most importantly, our framework makes occlusion handling particularly simple. The transition points allow for matches away from the occluded regions, at any suitable point along the path. Indeed, occlusions do not need to be handled explicitly at all in our initial graph-cut optimization. Moreover, a simple comparison of computed path lengths\n            <jats:italic>after<\/jats:italic>\n            the optimization, allows us to robustly identify occluded regions, and compute the most plausible interpolation in those areas. Finally, we show that significant improvements are obtained by moving gradients and using Poisson reconstruction.\n          <\/jats:p>","DOI":"10.1145\/1531326.1531348","type":"journal-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:43:55Z","timestamp":1248785035000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":112,"title":["Moving gradients"],"prefix":"10.1145","volume":"28","author":[{"given":"Dhruv","family":"Mahajan","sequence":"first","affiliation":[{"name":"Columbia University"}]},{"given":"Fu-Chung","family":"Huang","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Wojciech","family":"Matusik","sequence":"additional","affiliation":[{"name":"Adobe Systems, Inc."}]},{"given":"Ravi","family":"Ramamoorthi","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Peter","family":"Belhumeur","sequence":"additional","affiliation":[{"name":"Columbia University"}]}],"member":"320","published-online":{"date-parts":[[2009,7,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015718"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0041-4"},{"key":"e_1_2_2_3_1","volume-title":"Proc. IEEE Int. Conf. Computer Vision, 1--8.","author":"Baker S.","unstructured":"Baker , S. , Scharstein , D. , Lewis , J. P. , Roth , S. , Black , M. J. , and Szeliski , R . 2007. A database and evaluation methodology for optical flow . In Proc. IEEE Int. Conf. Computer Vision, 1--8. Baker, S., Scharstein, D., Lewis, J. P., Roth, S., Black, M. J., and Szeliski, R. 2007. A database and evaluation methodology for optical flow. In Proc. IEEE Int. Conf. Computer Vision, 1--8."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01420984"},{"key":"e_1_2_2_5_1","volume-title":"Proc. IEEE Conf. Computer Vision and Pattern Recognition, 506--512","author":"Belhumeur P.","unstructured":"Belhumeur , P. , and Mumford , D . 1992. A bayesian treatment of the stereo correspondence problem using half-occluded regions . Proc. IEEE Conf. Computer Vision and Pattern Recognition, 506--512 . Belhumeur, P., and Mumford, D. 1992. A bayesian treatment of the stereo correspondence problem using half-occluded regions. Proc. IEEE Conf. Computer Vision and Pattern Recognition, 506--512."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/cviu.1996.0006"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"e_1_2_2_8_1","volume-title":"Proc. European Conf. Computer Vision","volume":"3024","author":"Brox T.","unstructured":"Brox , T. , Bruhn , A. , Papenberg , N. , and Weickert , J . 2004. High accuracy optical flow estimation based on a theory for warping . In Proc. European Conf. Computer Vision , vol. 3024 , 25--36. Brox, T., Bruhn, A., Papenberg, N., and Weickert, J. 2004. High accuracy optical flow estimation based on a theory for warping. In Proc. European Conf. Computer Vision, vol. 3024, 25--36."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/166117.166153"},{"key":"e_1_2_2_10_1","volume-title":"Proc. IEEE Int. Conf. Computer Vision, 1176--1183","author":"Fitzgibbon A. W.","unstructured":"Fitzgibbon , A. W. , Wexler , Y. , and Zisserman , A . 2003. Image-based rendering using image-based priors . In Proc. IEEE Int. Conf. Computer Vision, 1176--1183 . Fitzgibbon, A. W., Wexler, Y., and Zisserman, A. 2003. Image-based rendering using image-based priors. In Proc. IEEE Int. Conf. Computer Vision, 1176--1183."},{"key":"e_1_2_2_11_1","volume-title":"Proc. European Conf. Computer Vision, 425--433","author":"Geiger D.","unstructured":"Geiger , D. , Ladendorf , B. , and Yuille , A . 1992. Occlusions and binocular stereo . In Proc. European Conf. Computer Vision, 425--433 . Geiger, D., Ladendorf, B., and Yuille, A. 1992. Occlusions and binocular stereo. In Proc. European Conf. Computer Vision, 425--433."},{"key":"e_1_2_2_12_1","volume-title":"Digital Image Processing","author":"Gonzalez","unstructured":"Gonzalez , and Woods. 2002. Digital Image Processing . Prentice Hall Inc . Gonzalez, and Woods. 2002. Digital Image Processing. Prentice Hall Inc."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70729"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141934"},{"key":"e_1_2_2_15_1","volume-title":"Proc. IEEE Int. Conf. Computer Vision, 508--515","author":"Kolmogorov V.","unstructured":"Kolmogorov , V. , and Zabih , R . 2001. Computing visual correspondence with occlusions using graph cuts . Proc. IEEE Int. Conf. Computer Vision, 508--515 . Kolmogorov, V., and Zabih, R. 2001. Computing visual correspondence with occlusions using graph cuts. Proc. IEEE Int. Conf. Computer Vision, 508--515."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882264"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/218380.218398"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013539930159"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882269"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014573219977"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.345012"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/237170.237196"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.337"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018429.1021105"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.369"},{"key":"e_1_2_2_26_1","volume-title":"Digital Image Warping","author":"Wolberg G.","unstructured":"Wolberg , G. 1990. Digital Image Warping . IEEE Press . Wolberg, G. 1990. Digital Image Warping. IEEE Press."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11744023_17"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.61"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1531326.1531348","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1531326.1531348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:23Z","timestamp":1750253423000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1531326.1531348"}},"subtitle":["a path-based method for plausible image interpolation"],"short-title":[],"issued":{"date-parts":[[2009,7,27]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7,27]]}},"alternative-id":["10.1145\/1531326.1531348"],"URL":"https:\/\/doi.org\/10.1145\/1531326.1531348","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,27]]},"assertion":[{"value":"2009-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}